./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-09 06:55:51,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:55:51,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:55:51,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:55:51,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:55:51,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:55:51,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:55:51,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:55:51,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:55:51,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:55:51,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:55:51,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:55:51,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:55:51,461 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:55:51,461 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:55:51,461 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:55:51,461 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:55:51,461 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:55:51,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:55:51,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:55:51,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:55:51,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:55:51,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:55:51,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:55:51,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:55:51,464 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:55:51,464 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-09 06:55:51,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:55:51,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:55:51,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:55:51,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:55:51,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:55:51,701 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-09 06:55:52,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc6c8eef/e637fb7adf474f7f8078aaf102692714/FLAG284a0b7e0 [2025-03-09 06:55:53,054 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:55:53,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2025-03-09 06:55:53,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc6c8eef/e637fb7adf474f7f8078aaf102692714/FLAG284a0b7e0 [2025-03-09 06:55:53,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc6c8eef/e637fb7adf474f7f8078aaf102692714 [2025-03-09 06:55:53,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:55:53,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:55:53,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:55:53,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:55:53,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:55:53,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492dc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53, skipping insertion in model container [2025-03-09 06:55:53,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:55:53,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:55:53,560 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:55:53,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:55:53,610 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:55:53,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53 WrapperNode [2025-03-09 06:55:53,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:55:53,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:55:53,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:55:53,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:55:53,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,639 INFO L138 Inliner]: procedures = 151, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-03-09 06:55:53,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:55:53,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:55:53,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:55:53,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:55:53,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,658 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-09 06:55:53,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:55:53,666 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:55:53,666 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:55:53,667 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:55:53,667 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (1/1) ... [2025-03-09 06:55:53,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:53,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:53,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:53,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:55:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:55:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:55:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:55:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:55:53,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:55:53,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:55:53,751 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:55:53,752 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:55:53,845 INFO L1307 $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-09 06:55:53,848 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-09 06:55:53,848 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:55:53,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:55:53,854 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:55:53,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:55:53 BoogieIcfgContainer [2025-03-09 06:55:53,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:55:53,855 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:55:53,855 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:55:53,858 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:55:53,859 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:55:53,859 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:55:53" (1/3) ... [2025-03-09 06:55:53,860 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d29e3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:55:53, skipping insertion in model container [2025-03-09 06:55:53,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:55:53,860 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:55:53" (2/3) ... [2025-03-09 06:55:53,860 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d29e3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:55:53, skipping insertion in model container [2025-03-09 06:55:53,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:55:53,860 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:55:53" (3/3) ... [2025-03-09 06:55:53,861 INFO L363 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2025-03-09 06:55:53,894 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:55:53,894 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:55:53,894 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:55:53,894 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:55:53,894 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:55:53,895 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:55:53,895 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:55:53,895 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:55:53,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:53,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-09 06:55:53,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:53,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:53,916 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:55:53,916 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:55:53,916 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:55:53,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:53,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-03-09 06:55:53,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:53,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:53,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:55:53,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 06:55:53,923 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-09 06:55:53,924 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-09 06:55:53,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 50546324, now seen corresponding path program 1 times [2025-03-09 06:55:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:53,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47906011] [2025-03-09 06:55:53,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:53,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:53,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:55:54,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:55:54,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:54,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:55:54,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:55:54,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:54,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 1 times [2025-03-09 06:55:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98745634] [2025-03-09 06:55:54,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:54,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:54,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:54,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:54,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:54,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:54,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:54,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1566936057, now seen corresponding path program 1 times [2025-03-09 06:55:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030739390] [2025-03-09 06:55:54,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:54,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:54,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:54,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:54,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:54,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:54,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:54,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:54,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:54,401 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:55:54,402 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:55:54,402 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:55:54,402 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:55:54,402 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:55:54,404 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:54,405 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:55:54,405 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:55:54,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2025-03-09 06:55:54,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:55:54,405 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:55:54,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:54,907 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:55:54,909 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:55:54,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:54,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:54,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:54,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:55:54,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:54,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:54,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:54,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:54,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:54,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:54,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:54,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:54,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:54,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 06:55:54,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:54,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:54,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:54,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:55:54,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:54,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:54,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:54,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:54,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:54,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:54,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:54,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:54,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:54,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:55:54,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:54,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:54,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:55:54,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:54,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:54,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:54,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:54,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:54,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:54,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:54,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:54,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:54,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:55:54,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:54,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:54,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:54,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:55:54,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:55,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,025 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:55:55,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:55,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:55,055 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:55:55,076 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:55:55,078 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-09 06:55:55,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:55:55,083 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:55:55,095 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:55:55,095 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:55:55,096 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-09 06:55:55,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:55,113 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-03-09 06:55:55,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:55:55,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:55:55,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:55,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:55:55,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:55,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 06:55:55,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 06:55:55,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:55,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:55:55,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:55,197 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-09 06:55:55,199 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:55,223 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 24 transitions. Complement of second has 3 states. [2025-03-09 06:55:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:55:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2025-03-09 06:55:55,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-09 06:55:55,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:55,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-09 06:55:55,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:55,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-09 06:55:55,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:55,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-03-09 06:55:55,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:55:55,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 12 states and 17 transitions. [2025-03-09 06:55:55,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:55:55,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:55:55,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-03-09 06:55:55,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:55:55,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-09 06:55:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-03-09 06:55:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-09 06:55:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2025-03-09 06:55:55,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-03-09 06:55:55,256 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-03-09 06:55:55,256 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:55:55,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2025-03-09 06:55:55,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:55:55,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:55,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:55,257 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:55:55,257 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:55:55,257 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-09 06:55:55,257 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-09 06:55:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1566936056, now seen corresponding path program 1 times [2025-03-09 06:55:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385206142] [2025-03-09 06:55:55,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:55,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:55,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:55,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:55,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:55,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:55,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 40676, now seen corresponding path program 1 times [2025-03-09 06:55:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597452214] [2025-03-09 06:55:55,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:55,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:55:55,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:55:55,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:55,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597452214] [2025-03-09 06:55:55,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597452214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:55:55,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:55:55,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:55:55,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202454149] [2025-03-09 06:55:55,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:55:55,311 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:55:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:55,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:55:55,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:55:55,313 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:55,317 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2025-03-09 06:55:55,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 15 transitions. [2025-03-09 06:55:55,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:55:55,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 15 transitions. [2025-03-09 06:55:55,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:55:55,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:55:55,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2025-03-09 06:55:55,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:55:55,319 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-09 06:55:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2025-03-09 06:55:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-09 06:55:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-03-09 06:55:55,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-09 06:55:55,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:55:55,320 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-09 06:55:55,320 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:55:55,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2025-03-09 06:55:55,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 06:55:55,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:55,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:55,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:55:55,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:55:55,322 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-09 06:55:55,322 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-09 06:55:55,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1566936056, now seen corresponding path program 2 times [2025-03-09 06:55:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:55,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572313660] [2025-03-09 06:55:55,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:55,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:55,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:55,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:55:55,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,336 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:55,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:55,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:55,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:55,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 1 times [2025-03-09 06:55:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:55,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378745158] [2025-03-09 06:55:55,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:55,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:55,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:55:55,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:55:55,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:55,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:55:55,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:55:55,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:55,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash -682364237, now seen corresponding path program 1 times [2025-03-09 06:55:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:55,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974409264] [2025-03-09 06:55:55,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:55,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:55:55,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:55:55,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:55,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:55:55,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:55:55,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:55,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:55,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:55,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 06:55:55,556 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:55:55,556 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:55:55,556 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:55:55,556 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:55:55,556 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:55:55,556 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,556 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:55:55,556 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:55:55,557 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration3_Lasso [2025-03-09 06:55:55,557 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:55:55,557 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:55:55,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:55,789 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:55:55,790 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:55:55,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,793 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:55:55,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:55,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:55:55,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 06:55:55,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,841 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:55:55,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,859 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-09 06:55:55,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,861 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:55:55,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:55:55,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,887 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 06:55:55,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 06:55:55,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,908 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 06:55:55,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:55:55,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,932 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:55:55,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:55,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,952 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 06:55:55,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,970 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-09 06:55:55,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,972 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 06:55:55,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:55,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:55,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:55,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:55,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:55,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:55,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:55,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:55,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:55,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 06:55:55,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:55,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:55,992 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:55,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 06:55:55,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:56,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:56,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:56,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:56,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:56,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:56,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:56,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:56,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:56,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-09 06:55:56,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,015 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:56,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 06:55:56,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:56,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:56,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:56,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:56,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:56,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:56,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:56,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:56,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:56,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,042 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:56,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 06:55:56,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:56,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:56,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:56,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:56,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:56,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:56,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:56,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:56,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:56,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,069 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:56,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 06:55:56,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:56,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:56,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:56,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:56,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:56,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:56,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:56,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:56,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:56,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,095 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:56,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 06:55:56,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:56,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:56,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:56,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:56,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:56,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:56,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:56,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:56,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 06:55:56,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,126 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:56,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 06:55:56,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:56,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:56,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:56,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:56,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:56,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:56,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:56,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:55:56,178 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-09 06:55:56,178 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-09 06:55:56,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:56,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,180 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:56,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 06:55:56,184 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:55:56,195 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 06:55:56,195 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:55:56,195 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-09 06:55:56,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 06:55:56,209 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2025-03-09 06:55:56,212 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:55:56,213 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:55:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:55:56,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:55:56,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:56,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 06:55:56,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:56,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:55:56,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:55:56,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:56,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:55:56,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:56,305 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-09 06:55:56,305 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:56,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 23 transitions. Complement of second has 7 states. [2025-03-09 06:55:56,349 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-09 06:55:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2025-03-09 06:55:56,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-09 06:55:56,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:56,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-09 06:55:56,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:56,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2025-03-09 06:55:56,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:56,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2025-03-09 06:55:56,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:56,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 22 transitions. [2025-03-09 06:55:56,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:55:56,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:55:56,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2025-03-09 06:55:56,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:56,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-03-09 06:55:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2025-03-09 06:55:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-03-09 06:55:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2025-03-09 06:55:56,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-09 06:55:56,354 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-09 06:55:56,354 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:55:56,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2025-03-09 06:55:56,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:56,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:56,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:56,354 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:56,354 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:56,354 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-09 06:55:56,354 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-09 06:55:56,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1330377491, now seen corresponding path program 1 times [2025-03-09 06:55:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:56,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945957489] [2025-03-09 06:55:56,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:56,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:56,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:56,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:56,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:56,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:55:56,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:55:56,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:56,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2025-03-09 06:55:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:56,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6324982] [2025-03-09 06:55:56,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:56,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:56,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:56,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:56,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:56,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:56,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1407485070, now seen corresponding path program 1 times [2025-03-09 06:55:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548524952] [2025-03-09 06:55:56,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:56,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:55:56,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:55:56,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:56,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:56,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548524952] [2025-03-09 06:55:56,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548524952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:55:56,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:55:56,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:55:56,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657271377] [2025-03-09 06:55:56,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:55:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:56,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:55:56,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:55:56,623 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:56,657 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2025-03-09 06:55:56,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2025-03-09 06:55:56,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:56,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 30 transitions. [2025-03-09 06:55:56,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:55:56,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:55:56,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2025-03-09 06:55:56,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:56,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-09 06:55:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2025-03-09 06:55:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2025-03-09 06:55:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-09 06:55:56,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-09 06:55:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:55:56,661 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-09 06:55:56,661 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:55:56,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2025-03-09 06:55:56,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:56,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:56,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:56,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:56,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:56,663 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-09 06:55:56,663 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-09 06:55:56,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 321545144, now seen corresponding path program 2 times [2025-03-09 06:55:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:56,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477527327] [2025-03-09 06:55:56,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:56,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 06:55:56,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:55:56,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:55:56,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:56,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:56,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477527327] [2025-03-09 06:55:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477527327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:55:56,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210132154] [2025-03-09 06:55:56,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:56,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:56,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:56,724 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-09 06:55:56,726 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-09 06:55:56,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 06:55:56,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:55:56,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:55:56,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:56,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:55:56,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:56,787 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-09 06:55:56,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:55:56,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210132154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:55:56,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:55:56,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:55:56,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008053] [2025-03-09 06:55:56,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:55:56,788 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:55:56,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2025-03-09 06:55:56,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:56,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681472860] [2025-03-09 06:55:56,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:56,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:56,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:56,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:55:56,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:56,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:56,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:56,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:56,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:55:56,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:55:56,821 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:56,839 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2025-03-09 06:55:56,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2025-03-09 06:55:56,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:56,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2025-03-09 06:55:56,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:55:56,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:55:56,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2025-03-09 06:55:56,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:56,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 06:55:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2025-03-09 06:55:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-09 06:55:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-09 06:55:56,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 06:55:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:55:56,842 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-09 06:55:56,842 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:55:56,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2025-03-09 06:55:56,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:56,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:56,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:56,843 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:56,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:56,843 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-09 06:55:56,844 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-09 06:55:56,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1998960291, now seen corresponding path program 1 times [2025-03-09 06:55:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:56,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894373904] [2025-03-09 06:55:56,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:56,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:55:56,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:55:56,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:56,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:55:56,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:55:56,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:56,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2025-03-09 06:55:56,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:56,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251452979] [2025-03-09 06:55:56,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:55:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:56,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:56,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:56,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:55:56,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:56,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:56,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:56,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1150458052, now seen corresponding path program 1 times [2025-03-09 06:55:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:56,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395616133] [2025-03-09 06:55:56,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:55:56,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:56,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:55:56,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:55:56,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:56,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:55:56,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:55:56,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:56,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:56,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:57,143 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:55:57,143 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:55:57,143 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:55:57,143 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:55:57,143 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:55:57,143 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,143 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:55:57,144 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:55:57,144 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration6_Lasso [2025-03-09 06:55:57,144 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:55:57,144 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:55:57,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:55:57,410 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:55:57,410 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:55:57,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,412 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 06:55:57,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:57,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:57,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:57,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:57,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:57,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:57,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:57,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:57,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:57,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 06:55:57,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,431 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 06:55:57,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:57,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:57,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:57,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:57,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:57,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:57,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:57,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:57,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:57,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 06:55:57,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,451 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 06:55:57,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:57,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:57,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:57,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:57,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:57,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:57,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:57,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:57,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:57,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 06:55:57,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,471 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 06:55:57,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:57,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:57,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:57,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:57,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:57,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:57,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:57,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:57,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 06:55:57,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,495 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 06:55:57,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:57,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:57,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:57,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:57,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:57,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:57,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:57,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:57,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:57,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:57,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,516 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 06:55:57,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:57,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:57,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:55:57,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:57,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:57,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:57,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:55:57,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:55:57,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:57,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 06:55:57,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,536 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 06:55:57,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:57,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:57,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:57,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:57,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:57,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:57,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:57,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:57,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-09 06:55:57,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,564 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 06:55:57,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:57,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:57,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:57,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:57,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:57,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:57,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:57,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:55:57,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 06:55:57,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,591 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 06:55:57,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:55:57,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:55:57,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:55:57,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:55:57,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:55:57,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:55:57,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:55:57,611 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:55:57,616 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-09 06:55:57,616 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:55:57,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:55:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:57,618 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:55:57,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 06:55:57,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:55:57,630 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:55:57,630 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:55:57,630 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-09 06:55:57,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 06:55:57,653 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-09 06:55:57,655 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:55:57,655 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:55:57,655 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:55:57,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 06:55:57,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:57,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:55:57,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:55:57,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:57,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:57,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:55:57,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:57,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:57,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:57,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:57,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:57,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:55:57,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:57,791 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 06:55:57,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:57,833 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 20 transitions. Complement of second has 5 states. [2025-03-09 06:55:57,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:55:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-09 06:55:57,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 06:55:57,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:57,834 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:55:57,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:57,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:55:57,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:55:57,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:57,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:57,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:55:57,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:57,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:57,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:57,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:57,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:57,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:55:57,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:57,956 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 06:55:57,956 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:57,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 20 transitions. Complement of second has 5 states. [2025-03-09 06:55:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:55:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-09 06:55:57,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 06:55:57,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:57,989 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:55:58,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:58,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:55:58,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:55:58,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:58,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:58,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:55:58,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:58,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:58,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:58,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:58,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:58,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:55:58,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:55:58,114 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 06:55:58,114 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:58,188 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 37 transitions. Complement of second has 11 states. [2025-03-09 06:55:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:55:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2025-03-09 06:55:58,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 06:55:58,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:58,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 14 letters. Loop has 2 letters. [2025-03-09 06:55:58,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:58,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-09 06:55:58,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:55:58,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2025-03-09 06:55:58,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:58,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 25 states and 30 transitions. [2025-03-09 06:55:58,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:55:58,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:55:58,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2025-03-09 06:55:58,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:58,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-09 06:55:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2025-03-09 06:55:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-03-09 06:55:58,192 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-09 06:55:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-09 06:55:58,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-09 06:55:58,192 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-09 06:55:58,192 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 06:55:58,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2025-03-09 06:55:58,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:58,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:58,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:58,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:58,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:58,193 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-09 06:55:58,193 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-09 06:55:58,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1783593726, now seen corresponding path program 2 times [2025-03-09 06:55:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:58,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005699215] [2025-03-09 06:55:58,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:58,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:55:58,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:55:58,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:55:58,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:58,253 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-09 06:55:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:58,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005699215] [2025-03-09 06:55:58,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005699215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:55:58,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067147250] [2025-03-09 06:55:58,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:58,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:58,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:58,255 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:55:58,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-09 06:55:58,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:55:58,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:55:58,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:55:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:58,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 06:55:58,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:58,347 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-09 06:55:58,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:55:58,389 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-09 06:55:58,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067147250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:55:58,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:55:58,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-09 06:55:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002393829] [2025-03-09 06:55:58,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:55:58,390 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:55:58,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2025-03-09 06:55:58,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:58,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869159463] [2025-03-09 06:55:58,390 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:55:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:58,393 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:55:58,394 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:58,394 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:55:58,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:58,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:58,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:58,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:58,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:58,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:58,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:58,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:58,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:55:58,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:55:58,428 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:58,474 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-09 06:55:58,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 38 transitions. [2025-03-09 06:55:58,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:58,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 22 states and 27 transitions. [2025-03-09 06:55:58,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:55:58,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:55:58,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2025-03-09 06:55:58,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:58,477 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-09 06:55:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2025-03-09 06:55:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 06:55:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-09 06:55:58,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-09 06:55:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:55:58,481 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-09 06:55:58,481 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 06:55:58,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2025-03-09 06:55:58,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:58,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:58,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:58,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:58,482 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:58,482 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-09 06:55:58,482 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-09 06:55:58,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:58,482 INFO L85 PathProgramCache]: Analyzing trace with hash 884432509, now seen corresponding path program 3 times [2025-03-09 06:55:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:58,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875037323] [2025-03-09 06:55:58,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:55:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:58,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-03-09 06:55:58,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:55:58,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:55:58,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:58,782 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-09 06:55:58,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:55:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875037323] [2025-03-09 06:55:58,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875037323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:55:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491367483] [2025-03-09 06:55:58,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:55:58,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:55:58,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:55:58,785 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-09 06:55:58,787 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-09 06:55:58,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-03-09 06:55:58,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:55:58,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:55:58,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:55:58,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 06:55:58,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:55:58,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:55:58,850 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-09 06:55:58,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:55:58,871 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-09 06:55:58,981 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-09 06:55:58,981 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-09 06:55:59,058 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-09 06:55:59,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:55:59,311 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-09 06:55:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491367483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:55:59,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:55:59,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-09 06:55:59,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574593708] [2025-03-09 06:55:59,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:55:59,312 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:55:59,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 5 times [2025-03-09 06:55:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:59,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777117555] [2025-03-09 06:55:59,312 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:55:59,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:59,315 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:59,316 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:59,316 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:55:59,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:59,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:59,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:59,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:59,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:59,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:59,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:55:59,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 06:55:59,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-03-09 06:55:59,348 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:55:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:55:59,844 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-09 06:55:59,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 46 transitions. [2025-03-09 06:55:59,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:59,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 42 transitions. [2025-03-09 06:55:59,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:55:59,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-09 06:55:59,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2025-03-09 06:55:59,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:55:59,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-09 06:55:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2025-03-09 06:55:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2025-03-09 06:55:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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-09 06:55:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-09 06:55:59,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-09 06:55:59,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 06:55:59,847 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-09 06:55:59,847 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 06:55:59,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2025-03-09 06:55:59,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:55:59,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:55:59,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:55:59,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:55:59,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:55:59,848 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-09 06:55:59,848 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-09 06:55:59,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash -462814692, now seen corresponding path program 2 times [2025-03-09 06:55:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:59,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599061698] [2025-03-09 06:55:59,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:55:59,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:59,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 06:55:59,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:55:59,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:55:59,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:59,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:59,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:55:59,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:55:59,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:59,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:59,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:59,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 6 times [2025-03-09 06:55:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:59,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425794870] [2025-03-09 06:55:59,886 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:55:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:59,890 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:59,891 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:59,891 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:55:59,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:59,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:59,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:55:59,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:55:59,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:59,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:59,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:55:59,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:55:59,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1911680059, now seen corresponding path program 3 times [2025-03-09 06:55:59,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:55:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027118514] [2025-03-09 06:55:59,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:55:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:55:59,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-09 06:55:59,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:55:59,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 06:55:59,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:59,924 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:55:59,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:55:59,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:55:59,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:55:59,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:55:59,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:00,470 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:56:00,470 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:56:00,470 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:56:00,470 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:56:00,470 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:56:00,470 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:00,470 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:56:00,470 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:56:00,470 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration9_Lasso [2025-03-09 06:56:00,470 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:56:00,470 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:56:00,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:00,775 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:56:00,775 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:56:00,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:00,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:00,778 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:00,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 06:56:00,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:00,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:00,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:00,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:00,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:00,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:00,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:00,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:00,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 06:56:00,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:00,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:00,800 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:00,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 06:56:00,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:00,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:00,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:00,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:00,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:00,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:00,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:00,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:00,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 06:56:00,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:00,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:00,827 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:00,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 06:56:00,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:00,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:00,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:00,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:00,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:00,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:00,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:00,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:00,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-09 06:56:00,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:00,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:00,852 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:00,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 06:56:00,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:00,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:00,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:00,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:00,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:00,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:00,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:00,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:00,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-09 06:56:00,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:00,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:00,878 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:00,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 06:56:00,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:00,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:00,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:00,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:00,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:00,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:00,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:00,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:00,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-09 06:56:00,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:00,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:00,904 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:00,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 06:56:00,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:00,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:00,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:00,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:00,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:00,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:00,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:00,922 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:56:00,932 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 06:56:00,932 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-09 06:56:00,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:00,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:00,934 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:00,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 06:56:00,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:56:00,946 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:56:00,946 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:56:00,946 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-09 06:56:00,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-09 06:56:00,966 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-09 06:56:00,967 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:56:00,967 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:56:00,967 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:56:00,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:00,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:56:01,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:56:01,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:01,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:01,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:56:01,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:01,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:01,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:01,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:01,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:01,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:01,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:01,075 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-09 06:56:01,076 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:01,095 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Result 25 states and 30 transitions. Complement of second has 4 states. [2025-03-09 06:56:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-09 06:56:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-09 06:56:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:01,096 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:01,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:01,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:56:01,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:56:01,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:01,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:01,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:56:01,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:01,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:01,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:01,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:01,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:01,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:01,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:01,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:01,238 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-09 06:56:01,238 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:01,258 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Result 25 states and 30 transitions. Complement of second has 4 states. [2025-03-09 06:56:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-09 06:56:01,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-09 06:56:01,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:01,259 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:01,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:01,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:56:01,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:56:01,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:01,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:01,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:56:01,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:01,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:01,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:01,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:01,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:01,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:01,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:01,353 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-09 06:56:01,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:01,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Result 41 states and 49 transitions. Complement of second has 12 states. [2025-03-09 06:56:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:56:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2025-03-09 06:56:01,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-09 06:56:01,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:01,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 21 letters. Loop has 2 letters. [2025-03-09 06:56:01,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:01,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 19 letters. Loop has 4 letters. [2025-03-09 06:56:01,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:01,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 49 transitions. [2025-03-09 06:56:01,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:01,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 35 states and 41 transitions. [2025-03-09 06:56:01,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:56:01,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:56:01,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2025-03-09 06:56:01,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:01,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-09 06:56:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2025-03-09 06:56:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2025-03-09 06:56:01,419 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-09 06:56:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-09 06:56:01,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-09 06:56:01,419 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-09 06:56:01,419 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 06:56:01,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2025-03-09 06:56:01,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:01,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:01,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:01,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:01,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:01,425 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-09 06:56:01,425 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-09 06:56:01,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash 308250848, now seen corresponding path program 4 times [2025-03-09 06:56:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:01,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899421747] [2025-03-09 06:56:01,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:56:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:01,430 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-09 06:56:01,433 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-03-09 06:56:01,434 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:56:01,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:01,509 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-09 06:56:01,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:01,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899421747] [2025-03-09 06:56:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899421747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:01,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685199588] [2025-03-09 06:56:01,509 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:56:01,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:01,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:01,511 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-09 06:56:01,512 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-09 06:56:01,547 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-09 06:56:01,557 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-03-09 06:56:01,557 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 06:56:01,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:01,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:01,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:01,633 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-09 06:56:01,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:01,685 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-09 06:56:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685199588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:01,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:01,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-09 06:56:01,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975134673] [2025-03-09 06:56:01,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:01,686 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:01,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 7 times [2025-03-09 06:56:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:01,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761875949] [2025-03-09 06:56:01,686 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:56:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:01,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:01,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:01,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:01,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:01,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:01,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:01,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:01,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:01,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:01,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:01,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 06:56:01,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:56:01,718 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 11 Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:01,770 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-09 06:56:01,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2025-03-09 06:56:01,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:01,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 32 states and 38 transitions. [2025-03-09 06:56:01,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:56:01,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:56:01,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2025-03-09 06:56:01,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:01,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-09 06:56:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2025-03-09 06:56:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-09 06:56:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 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-09 06:56:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-09 06:56:01,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-09 06:56:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:56:01,777 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-09 06:56:01,777 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 06:56:01,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2025-03-09 06:56:01,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:01,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:01,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:01,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:01,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:01,778 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-09 06:56:01,778 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-09 06:56:01,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:01,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1706677819, now seen corresponding path program 5 times [2025-03-09 06:56:01,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:01,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326010799] [2025-03-09 06:56:01,779 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:56:01,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:01,784 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 6 equivalence classes. [2025-03-09 06:56:01,793 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:56:01,793 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 06:56:01,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:02,368 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-09 06:56:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326010799] [2025-03-09 06:56:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326010799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909698156] [2025-03-09 06:56:02,368 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:56:02,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:02,370 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-09 06:56:02,372 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-09 06:56:02,411 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 6 equivalence classes. [2025-03-09 06:56:02,429 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:56:02,429 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 06:56:02,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:02,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 06:56:02,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:02,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:56:02,469 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-09 06:56:02,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:02,498 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-09 06:56:02,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:02,531 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-09 06:56:02,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:02,667 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-09 06:56:02,752 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-09 06:56:02,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:02,781 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-09 06:56:02,782 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-09 06:56:02,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:02,930 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-09 06:56:02,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909698156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:02,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:02,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 33 [2025-03-09 06:56:02,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493780942] [2025-03-09 06:56:02,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:02,930 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:02,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 8 times [2025-03-09 06:56:02,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:02,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039178633] [2025-03-09 06:56:02,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:02,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:02,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:02,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:56:02,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:02,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:02,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:02,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:02,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:02,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:02,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:02,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:02,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 06:56:02,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 06:56:02,959 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. cyclomatic complexity: 11 Second operand has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:03,396 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-03-09 06:56:03,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. [2025-03-09 06:56:03,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:03,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 51 transitions. [2025-03-09 06:56:03,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:56:03,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:56:03,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2025-03-09 06:56:03,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:03,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-09 06:56:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2025-03-09 06:56:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2025-03-09 06:56:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-09 06:56:03,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-09 06:56:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:56:03,399 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-09 06:56:03,399 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 06:56:03,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 44 transitions. [2025-03-09 06:56:03,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:03,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:03,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:03,400 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:03,400 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:03,400 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-09 06:56:03,400 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-09 06:56:03,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 561191780, now seen corresponding path program 6 times [2025-03-09 06:56:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412698720] [2025-03-09 06:56:03,401 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:56:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:03,405 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 6 equivalence classes. [2025-03-09 06:56:03,425 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:56:03,425 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-09 06:56:03,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:03,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:03,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:56:03,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:56:03,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:03,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:03,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:03,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 9 times [2025-03-09 06:56:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:03,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332880676] [2025-03-09 06:56:03,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:56:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:03,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:03,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:03,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:56:03,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:03,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:03,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:03,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:03,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:03,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:03,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:03,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1860578429, now seen corresponding path program 7 times [2025-03-09 06:56:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:03,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817882154] [2025-03-09 06:56:03,449 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:56:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:03,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:56:03,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:56:03,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:03,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:03,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:03,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 06:56:03,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 06:56:03,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:03,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:03,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:04,734 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:56:04,734 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:56:04,734 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:56:04,734 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:56:04,734 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:56:04,734 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:04,734 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:56:04,734 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:56:04,734 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration12_Lasso [2025-03-09 06:56:04,734 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:56:04,734 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:56:04,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:04,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:05,095 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:56:05,095 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:56:05,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,097 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-09 06:56:05,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:05,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:05,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:05,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:05,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,117 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-09 06:56:05,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:05,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:05,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:05,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-09 06:56:05,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,137 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-09 06:56:05,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:05,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:05,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:05,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-09 06:56:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,157 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-09 06:56:05,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:05,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:05,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:05,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-09 06:56:05,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,177 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-09 06:56:05,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:05,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:05,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:05,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-09 06:56:05,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,200 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-09 06:56:05,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:05,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:05,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:05,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-09 06:56:05,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,221 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-09 06:56:05,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:05,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:05,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:05,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-09 06:56:05,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,241 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-09 06:56:05,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-09 06:56:05,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:05,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:05,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:05,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:05,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,262 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-09 06:56:05,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:05,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:05,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:05,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:05,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,282 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-09 06:56:05,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:05,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:05,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-09 06:56:05,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,303 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-09 06:56:05,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:05,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:05,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:05,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-09 06:56:05,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,327 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-09 06:56:05,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:05,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:05,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:05,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:05,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:05,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:05,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:05,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:56:05,355 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 06:56:05,355 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:56:05,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:05,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,357 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-09 06:56:05,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:56:05,369 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:56:05,369 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:56:05,369 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-09 06:56:05,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-09 06:56:05,390 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:56:05,391 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:56:05,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:56:05,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:56:05,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:05,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:56:05,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:56:05,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:05,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:05,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:56:05,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:05,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:05,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:05,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:05,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:05,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:05,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:05,507 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 06:56:05,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 44 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:05,526 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 44 transitions. cyclomatic complexity: 10. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 44 transitions. Complement of second has 4 states. [2025-03-09 06:56:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-09 06:56:05,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 28 letters. Loop has 2 letters. [2025-03-09 06:56:05,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:05,527 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:05,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:05,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:56:05,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:56:05,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:05,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:05,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:56:05,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:05,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:05,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:05,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:05,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:05,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:05,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:05,650 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 06:56:05,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 44 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:05,666 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 44 transitions. cyclomatic complexity: 10. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 44 transitions. Complement of second has 4 states. [2025-03-09 06:56:05,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-09 06:56:05,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 28 letters. Loop has 2 letters. [2025-03-09 06:56:05,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:05,667 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:05,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:05,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:56:05,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:56:05,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:05,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:05,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:56:05,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:05,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:05,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:05,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:05,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:05,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:05,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:05,784 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 06:56:05,784 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 44 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:05,849 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 44 transitions. cyclomatic complexity: 10. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 61 transitions. Complement of second has 14 states. [2025-03-09 06:56:05,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:56:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2025-03-09 06:56:05,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 40 transitions. Stem has 28 letters. Loop has 2 letters. [2025-03-09 06:56:05,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:05,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 40 transitions. Stem has 30 letters. Loop has 2 letters. [2025-03-09 06:56:05,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:05,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 40 transitions. Stem has 28 letters. Loop has 4 letters. [2025-03-09 06:56:05,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:05,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 61 transitions. [2025-03-09 06:56:05,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:05,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 52 transitions. [2025-03-09 06:56:05,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:56:05,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:56:05,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 52 transitions. [2025-03-09 06:56:05,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:05,851 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-03-09 06:56:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 52 transitions. [2025-03-09 06:56:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-09 06:56:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-03-09 06:56:05,852 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-03-09 06:56:05,852 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-03-09 06:56:05,852 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 06:56:05,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2025-03-09 06:56:05,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:05,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:05,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:05,853 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:05,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:05,853 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;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-09 06:56:05,853 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-09 06:56:05,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2127589639, now seen corresponding path program 8 times [2025-03-09 06:56:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:05,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104099750] [2025-03-09 06:56:05,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:05,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 06:56:05,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:56:05,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:56:05,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 06:56:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104099750] [2025-03-09 06:56:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104099750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130738308] [2025-03-09 06:56:05,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:05,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:05,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:05,963 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:05,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-03-09 06:56:06,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 06:56:06,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:56:06,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:56:06,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:06,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:56:06,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 06:56:06,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 06:56:06,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130738308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:06,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:06,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-09 06:56:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255182186] [2025-03-09 06:56:06,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:06,193 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:06,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 10 times [2025-03-09 06:56:06,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:06,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273297708] [2025-03-09 06:56:06,193 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:56:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:06,195 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:56:06,196 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:06,196 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:56:06,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:06,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:06,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:06,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:06,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:06,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:06,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:06,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 06:56:06,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-09 06:56:06,226 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. cyclomatic complexity: 11 Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:06,282 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2025-03-09 06:56:06,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 78 transitions. [2025-03-09 06:56:06,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:06,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 43 states and 49 transitions. [2025-03-09 06:56:06,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:56:06,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:56:06,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2025-03-09 06:56:06,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:06,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-09 06:56:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2025-03-09 06:56:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 06:56:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-09 06:56:06,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-09 06:56:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:56:06,285 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-09 06:56:06,285 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-09 06:56:06,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2025-03-09 06:56:06,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:06,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:06,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:06,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:06,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:06,286 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;" "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-09 06:56:06,286 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-09 06:56:06,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash 342802178, now seen corresponding path program 9 times [2025-03-09 06:56:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912777674] [2025-03-09 06:56:06,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:56:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:06,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 7 equivalence classes. [2025-03-09 06:56:06,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:56:06,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-09 06:56:06,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:06,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 06:56:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 14 proven. 76 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:56:07,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:07,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912777674] [2025-03-09 06:56:07,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912777674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:07,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487948319] [2025-03-09 06:56:07,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:56:07,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:07,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:07,148 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:07,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-03-09 06:56:07,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 7 equivalence classes. [2025-03-09 06:56:07,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:56:07,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-09 06:56:07,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:07,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-09 06:56:07,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:07,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:56:07,266 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-09 06:56:07,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:07,293 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-09 06:56:07,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:07,324 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-09 06:56:07,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:07,355 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-09 06:56:07,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:07,527 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-09 06:56:07,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:07,641 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-09 06:56:07,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:07,683 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-09 06:56:07,755 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-09 06:56:07,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:07,807 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 3 case distinctions, treesize of input 50 treesize of output 33 [2025-03-09 06:56:07,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:07,844 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-09 06:56:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 7 proven. 89 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:56:07,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 7 proven. 83 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:56:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487948319] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:08,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:08,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 43 [2025-03-09 06:56:08,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822122745] [2025-03-09 06:56:08,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:08,221 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:08,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:08,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 11 times [2025-03-09 06:56:08,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:08,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008055461] [2025-03-09 06:56:08,221 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:56:08,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:08,226 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:08,227 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:08,227 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:56:08,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:08,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:08,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:08,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:08,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:08,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:08,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:08,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-09 06:56:08,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1508, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 06:56:08,253 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. cyclomatic complexity: 11 Second operand has 43 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 43 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:09,645 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2025-03-09 06:56:09,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 155 transitions. [2025-03-09 06:56:09,646 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:56:09,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 128 states and 146 transitions. [2025-03-09 06:56:09,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-09 06:56:09,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-09 06:56:09,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 146 transitions. [2025-03-09 06:56:09,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:09,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 146 transitions. [2025-03-09 06:56:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 146 transitions. [2025-03-09 06:56:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 111. [2025-03-09 06:56:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.162162162162162) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2025-03-09 06:56:09,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 129 transitions. [2025-03-09 06:56:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-09 06:56:09,652 INFO L432 stractBuchiCegarLoop]: Abstraction has 111 states and 129 transitions. [2025-03-09 06:56:09,652 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-09 06:56:09,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 129 transitions. [2025-03-09 06:56:09,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:09,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:09,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:09,653 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:09,653 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:09,653 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-09 06:56:09,653 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-09 06:56:09,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1278519967, now seen corresponding path program 10 times [2025-03-09 06:56:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:09,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227982005] [2025-03-09 06:56:09,653 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:56:09,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:09,666 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-09 06:56:09,679 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:56:09,679 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:56:09,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:09,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:09,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:56:09,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:56:09,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:09,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:09,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:09,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:09,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 12 times [2025-03-09 06:56:09,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:09,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082903507] [2025-03-09 06:56:09,692 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:56:09,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:09,694 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:09,694 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:09,694 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 06:56:09,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:09,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:09,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:09,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:09,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:09,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:09,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:09,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash -297041344, now seen corresponding path program 11 times [2025-03-09 06:56:09,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:09,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045489174] [2025-03-09 06:56:09,697 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:56:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:09,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 7 equivalence classes. [2025-03-09 06:56:09,720 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:56:09,720 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-09 06:56:09,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:09,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:09,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 06:56:09,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:56:09,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:09,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:09,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:15,328 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 247 DAG size of output: 186 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 06:56:15,479 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:56:15,479 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:56:15,479 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:56:15,479 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:56:15,479 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:56:15,479 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:15,479 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:56:15,479 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:56:15,479 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration15_Lasso [2025-03-09 06:56:15,479 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:56:15,479 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:56:15,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,909 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:56:15,909 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:56:15,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:15,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:15,912 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:15,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-09 06:56:15,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:15,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:15,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:15,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:15,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:15,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:15,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:15,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:15,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:15,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:15,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:15,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:15,931 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:15,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-09 06:56:15,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:15,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:15,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:15,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:15,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:15,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:15,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:15,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:15,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:15,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-09 06:56:15,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:15,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:15,951 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:15,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-09 06:56:15,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:15,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:15,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:15,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:15,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:15,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:15,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:15,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:15,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:15,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-09 06:56:15,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:15,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:15,971 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:15,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-09 06:56:15,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:15,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:15,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:15,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:15,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:15,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:15,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:15,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:15,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:15,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-09 06:56:15,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:15,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:15,992 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:15,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-09 06:56:15,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:16,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:16,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:16,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-09 06:56:16,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,012 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-09 06:56:16,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:16,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:16,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:16,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,035 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-09 06:56:16,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,037 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-09 06:56:16,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:16,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:16,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:16,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:16,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,057 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-09 06:56:16,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-09 06:56:16,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,092 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-09 06:56:16,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,112 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-09 06:56:16,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,114 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-09 06:56:16,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-09 06:56:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,138 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-09 06:56:16,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-09 06:56:16,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,162 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-09 06:56:16,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-09 06:56:16,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,189 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-09 06:56:16,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-09 06:56:16,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:16,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,212 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-09 06:56:16,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-09 06:56:16,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,237 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-09 06:56:16,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,260 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-09 06:56:16,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,262 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-09 06:56:16,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-09 06:56:16,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,284 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-09 06:56:16,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:56:16,310 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 06:56:16,310 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-09 06:56:16,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,312 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-09 06:56:16,313 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:56:16,324 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:56:16,324 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:56:16,324 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-09 06:56:16,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:16,360 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2025-03-09 06:56:16,361 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:56:16,361 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:56:16,361 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:56:16,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:16,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:56:16,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:56:16,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:16,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:16,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:56:16,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:16,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:16,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:16,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:16,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:16,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:16,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:16,582 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-09 06:56:16,582 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 129 transitions. cyclomatic complexity: 27 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:16,620 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 129 transitions. cyclomatic complexity: 27. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 111 states and 129 transitions. Complement of second has 5 states. [2025-03-09 06:56:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-09 06:56:16,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 39 letters. Loop has 2 letters. [2025-03-09 06:56:16,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:16,621 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:16,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:16,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:56:16,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:56:16,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:16,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:16,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:56:16,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:16,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:16,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:16,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:16,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:16,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:16,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:16,823 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-09 06:56:16,823 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 129 transitions. cyclomatic complexity: 27 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:16,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 129 transitions. cyclomatic complexity: 27. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 111 states and 129 transitions. Complement of second has 5 states. [2025-03-09 06:56:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-09 06:56:16,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 39 letters. Loop has 2 letters. [2025-03-09 06:56:16,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:16,857 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:16,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:16,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:56:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:56:16,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:16,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:16,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:56:16,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:17,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:17,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:17,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:17,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:17,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:17,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:17,068 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-03-09 06:56:17,068 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 129 transitions. cyclomatic complexity: 27 Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:17,228 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 129 transitions. cyclomatic complexity: 27. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 144 states and 167 transitions. Complement of second has 17 states. [2025-03-09 06:56:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:56:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2025-03-09 06:56:17,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 39 letters. Loop has 2 letters. [2025-03-09 06:56:17,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:17,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 41 letters. Loop has 2 letters. [2025-03-09 06:56:17,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:17,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 39 letters. Loop has 4 letters. [2025-03-09 06:56:17,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:17,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 167 transitions. [2025-03-09 06:56:17,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:17,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 134 states and 154 transitions. [2025-03-09 06:56:17,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:56:17,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:56:17,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 154 transitions. [2025-03-09 06:56:17,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-09 06:56:17,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:17,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 134 states and 154 transitions. [2025-03-09 06:56:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 154 transitions. [2025-03-09 06:56:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2025-03-09 06:56:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 126 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2025-03-09 06:56:17,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 147 transitions. [2025-03-09 06:56:17,240 INFO L432 stractBuchiCegarLoop]: Abstraction has 127 states and 147 transitions. [2025-03-09 06:56:17,240 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-09 06:56:17,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 147 transitions. [2025-03-09 06:56:17,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:17,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:17,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:17,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:17,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:17,241 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;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;" "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-09 06:56:17,241 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-09 06:56:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1936642250, now seen corresponding path program 12 times [2025-03-09 06:56:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795777380] [2025-03-09 06:56:17,242 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:56:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:17,248 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 46 statements into 10 equivalence classes. [2025-03-09 06:56:17,290 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 06:56:17,291 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-09 06:56:17,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 10 proven. 160 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:56:21,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:21,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795777380] [2025-03-09 06:56:21,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795777380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:21,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355030171] [2025-03-09 06:56:21,061 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:56:21,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:21,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:21,063 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:21,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-03-09 06:56:21,118 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 46 statements into 10 equivalence classes. [2025-03-09 06:56:21,335 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 06:56:21,335 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-09 06:56:21,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:21,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-09 06:56:21,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:21,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-09 06:56:21,365 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-09 06:56:21,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,395 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-09 06:56:21,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-09 06:56:21,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 56 [2025-03-09 06:56:21,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-09 06:56:21,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 62 [2025-03-09 06:56:21,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 50 [2025-03-09 06:56:21,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 47 [2025-03-09 06:56:21,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:21,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 38 [2025-03-09 06:56:22,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:22,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2025-03-09 06:56:22,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:22,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2025-03-09 06:56:22,133 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 45 treesize of output 26 [2025-03-09 06:56:22,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:22,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2025-03-09 06:56:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 9 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:56:22,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 9 proven. 143 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 06:56:22,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355030171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:22,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:22,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 16] total 58 [2025-03-09 06:56:22,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967940712] [2025-03-09 06:56:22,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:22,780 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:22,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 13 times [2025-03-09 06:56:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:22,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844819524] [2025-03-09 06:56:22,780 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:56:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:22,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:22,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:22,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:22,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:22,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:22,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:22,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:22,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:22,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:22,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:22,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-09 06:56:22,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2955, Unknown=0, NotChecked=0, Total=3306 [2025-03-09 06:56:22,812 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. cyclomatic complexity: 31 Second operand has 58 states, 58 states have (on average 1.9655172413793103) internal successors, (114), 58 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:28,926 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2025-03-09 06:56:28,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 228 transitions. [2025-03-09 06:56:28,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 06:56:28,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 181 states and 203 transitions. [2025-03-09 06:56:28,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-09 06:56:28,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-09 06:56:28,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 203 transitions. [2025-03-09 06:56:28,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:28,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 203 transitions. [2025-03-09 06:56:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 203 transitions. [2025-03-09 06:56:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2025-03-09 06:56:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 172 states have (on average 1.127906976744186) internal successors, (194), 171 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 194 transitions. [2025-03-09 06:56:28,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 172 states and 194 transitions. [2025-03-09 06:56:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-03-09 06:56:28,932 INFO L432 stractBuchiCegarLoop]: Abstraction has 172 states and 194 transitions. [2025-03-09 06:56:28,932 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-09 06:56:28,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172 states and 194 transitions. [2025-03-09 06:56:28,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:28,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:28,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:28,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 9, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:28,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:28,933 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;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-09 06:56:28,934 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-09 06:56:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1565377565, now seen corresponding path program 13 times [2025-03-09 06:56:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810071440] [2025-03-09 06:56:28,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:56:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:28,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:56:28,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:56:28,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:28,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 140 proven. 45 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 06:56:29,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:29,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810071440] [2025-03-09 06:56:29,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810071440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:29,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555781650] [2025-03-09 06:56:29,081 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 06:56:29,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:29,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:29,084 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:29,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-03-09 06:56:29,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:56:29,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:56:29,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:29,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:29,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:56:29,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 175 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 06:56:29,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 175 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 06:56:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555781650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:29,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-03-09 06:56:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866544106] [2025-03-09 06:56:29,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:29,414 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:29,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 14 times [2025-03-09 06:56:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:29,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761958599] [2025-03-09 06:56:29,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:29,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:29,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:29,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:29,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:56:29,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:29,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:29,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:29,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:29,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:29,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:29,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:29,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:29,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 06:56:29,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:56:29,458 INFO L87 Difference]: Start difference. First operand 172 states and 194 transitions. cyclomatic complexity: 35 Second operand has 21 states, 20 states have (on average 3.4) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:29,540 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2025-03-09 06:56:29,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 183 transitions. [2025-03-09 06:56:29,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:29,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 125 states and 142 transitions. [2025-03-09 06:56:29,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:56:29,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:56:29,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 142 transitions. [2025-03-09 06:56:29,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:29,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 142 transitions. [2025-03-09 06:56:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 142 transitions. [2025-03-09 06:56:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-09 06:56:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.136) internal successors, (142), 124 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2025-03-09 06:56:29,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 142 transitions. [2025-03-09 06:56:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:56:29,548 INFO L432 stractBuchiCegarLoop]: Abstraction has 125 states and 142 transitions. [2025-03-09 06:56:29,548 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-09 06:56:29,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 142 transitions. [2025-03-09 06:56:29,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:29,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:29,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:29,549 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 8, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:29,550 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:29,550 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;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-09 06:56:29,550 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-09 06:56:29,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1357364572, now seen corresponding path program 14 times [2025-03-09 06:56:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:29,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433470374] [2025-03-09 06:56:29,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:29,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:29,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-09 06:56:29,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:56:29,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:56:29,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 9 proven. 175 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 06:56:30,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433470374] [2025-03-09 06:56:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433470374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270126455] [2025-03-09 06:56:30,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:30,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:30,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:30,401 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:30,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-03-09 06:56:30,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-09 06:56:30,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:56:30,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:56:30,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:30,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-09 06:56:30,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:30,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:56:30,533 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-09 06:56:30,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:30,561 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-09 06:56:30,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:30,595 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-09 06:56:30,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:30,634 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-09 06:56:30,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:30,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2025-03-09 06:56:30,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,713 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 06:56:30,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 66 treesize of output 83 [2025-03-09 06:56:30,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:30,980 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 06:56:30,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 77 treesize of output 79 [2025-03-09 06:56:31,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,178 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 06:56:31,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 70 treesize of output 69 [2025-03-09 06:56:31,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,248 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 06:56:31,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 66 [2025-03-09 06:56:31,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,364 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 06:56:31,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 59 [2025-03-09 06:56:31,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,436 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 06:56:31,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2025-03-09 06:56:31,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,467 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 06:56:31,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2025-03-09 06:56:31,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,573 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 06:56:31,573 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 1 case distinctions, treesize of input 56 treesize of output 49 [2025-03-09 06:56:31,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,641 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-09 06:56:31,641 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 69 treesize of output 58 [2025-03-09 06:56:31,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:56:31,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:31,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 48 treesize of output 26 [2025-03-09 06:56:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 9 proven. 185 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 06:56:31,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:32,295 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 83 treesize of output 79 [2025-03-09 06:56:32,297 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:56:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 9 proven. 173 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 06:56:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270126455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:32,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:32,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 17] total 52 [2025-03-09 06:56:32,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120590852] [2025-03-09 06:56:32,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:32,299 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:32,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 15 times [2025-03-09 06:56:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:32,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857813390] [2025-03-09 06:56:32,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:56:32,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:32,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:32,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:32,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:56:32,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:32,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:32,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:32,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:32,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:32,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:32,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:32,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-09 06:56:32,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2372, Unknown=0, NotChecked=0, Total=2652 [2025-03-09 06:56:32,332 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. cyclomatic complexity: 27 Second operand has 52 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 52 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:36,189 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2025-03-09 06:56:36,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 179 transitions. [2025-03-09 06:56:36,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:36,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 158 states and 176 transitions. [2025-03-09 06:56:36,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-09 06:56:36,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-09 06:56:36,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 176 transitions. [2025-03-09 06:56:36,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:36,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 176 transitions. [2025-03-09 06:56:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 176 transitions. [2025-03-09 06:56:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 114. [2025-03-09 06:56:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 113 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2025-03-09 06:56:36,195 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114 states and 127 transitions. [2025-03-09 06:56:36,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-09 06:56:36,196 INFO L432 stractBuchiCegarLoop]: Abstraction has 114 states and 127 transitions. [2025-03-09 06:56:36,196 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-09 06:56:36,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 127 transitions. [2025-03-09 06:56:36,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:36,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:36,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:36,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 10, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:36,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:36,197 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;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;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-09 06:56:36,197 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-09 06:56:36,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2088387929, now seen corresponding path program 15 times [2025-03-09 06:56:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:36,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502886123] [2025-03-09 06:56:36,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:56:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:36,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 10 equivalence classes. [2025-03-09 06:56:36,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:56:36,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-09 06:56:36,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:36,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:36,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:56:36,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:56:36,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:36,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:36,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:36,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:36,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 16 times [2025-03-09 06:56:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:36,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096890001] [2025-03-09 06:56:36,237 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:56:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:36,239 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 06:56:36,240 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:36,240 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:56:36,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:36,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:36,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:36,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:36,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:36,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:36,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:36,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1191072250, now seen corresponding path program 16 times [2025-03-09 06:56:36,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:36,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481860471] [2025-03-09 06:56:36,242 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 06:56:36,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:36,249 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-09 06:56:36,263 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:56:36,263 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 06:56:36,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:36,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:36,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 06:56:36,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:56:36,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:36,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:36,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:48,475 WARN L286 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 319 DAG size of output: 246 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 06:56:48,693 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:56:48,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:56:48,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:56:48,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:56:48,694 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:56:48,694 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:48,694 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:56:48,694 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:56:48,694 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration19_Lasso [2025-03-09 06:56:48,694 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:56:48,694 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:56:48,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:48,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:49,085 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:56:49,085 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:56:49,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,088 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-09 06:56:49,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:49,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:49,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:49,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:49,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,110 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-09 06:56:49,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:49,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:49,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:49,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-09 06:56:49,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,130 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-09 06:56:49,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:49,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:49,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:49,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,151 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-09 06:56:49,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:49,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:49,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:49,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-09 06:56:49,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,171 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-09 06:56:49,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:49,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:49,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-09 06:56:49,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,194 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-09 06:56:49,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:49,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:49,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:49,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,219 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-09 06:56:49,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:49,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:49,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-09 06:56:49,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,242 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-09 06:56:49,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:49,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:49,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-09 06:56:49,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,263 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-09 06:56:49,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:49,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:49,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-09 06:56:49,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,285 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-09 06:56:49,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:49,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:49,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-03-09 06:56:49,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,307 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-09 06:56:49,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:49,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:49,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:49,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-09 06:56:49,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,329 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-09 06:56:49,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:49,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:49,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:49,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:49,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:49,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:49,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:49,347 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:56:49,353 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:56:49,353 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 06:56:49,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:49,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:49,356 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:49,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-09 06:56:49,357 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:56:49,367 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:56:49,367 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:56:49,367 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 20))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 20))_1 Supporting invariants [] [2025-03-09 06:56:49,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-09 06:56:49,390 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:56:49,391 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 06:56:49,391 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 06:56:49,391 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-03-09 06:56:49,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:49,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:56:49,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:56:49,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:49,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:49,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:56:49,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:49,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:49,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:49,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:49,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:49,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:49,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:49,578 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-09 06:56:49,578 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 127 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:49,592 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 127 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 114 states and 127 transitions. Complement of second has 4 states. [2025-03-09 06:56:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-09 06:56:49,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-09 06:56:49,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:49,593 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:49,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:49,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:56:49,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:56:49,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:49,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:49,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:56:49,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:49,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:49,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:49,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:49,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:49,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:49,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:49,782 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-09 06:56:49,783 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 127 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:49,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 127 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 114 states and 127 transitions. Complement of second has 4 states. [2025-03-09 06:56:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-09 06:56:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-09 06:56:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:49,806 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:56:49,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:49,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:56:49,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:56:49,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:49,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:49,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:56:49,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:49,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:49,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:49,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:49,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:49,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:56:49,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:50,011 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-09 06:56:50,011 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 127 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:50,111 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 127 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 144 states and 161 transitions. Complement of second has 18 states. [2025-03-09 06:56:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 06:56:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2025-03-09 06:56:50,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 52 letters. Loop has 2 letters. [2025-03-09 06:56:50,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:50,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 54 letters. Loop has 2 letters. [2025-03-09 06:56:50,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:50,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 52 letters. Loop has 4 letters. [2025-03-09 06:56:50,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:50,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 161 transitions. [2025-03-09 06:56:50,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:50,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 132 states and 146 transitions. [2025-03-09 06:56:50,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:56:50,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-09 06:56:50,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 146 transitions. [2025-03-09 06:56:50,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:50,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132 states and 146 transitions. [2025-03-09 06:56:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 146 transitions. [2025-03-09 06:56:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2025-03-09 06:56:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.1111111111111112) internal successors, (140), 125 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2025-03-09 06:56:50,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 140 transitions. [2025-03-09 06:56:50,119 INFO L432 stractBuchiCegarLoop]: Abstraction has 126 states and 140 transitions. [2025-03-09 06:56:50,119 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-09 06:56:50,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 140 transitions. [2025-03-09 06:56:50,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:50,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:50,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:50,121 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [18, 12, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:50,121 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:50,122 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;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;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-09 06:56:50,122 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-09 06:56:50,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash -37937846, now seen corresponding path program 17 times [2025-03-09 06:56:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:50,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710724990] [2025-03-09 06:56:50,122 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:56:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:50,130 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 60 statements into 13 equivalence classes. [2025-03-09 06:56:50,154 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 06:56:50,154 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-09 06:56:50,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:50,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-09 06:56:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 296 proven. 15 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 06:56:50,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710724990] [2025-03-09 06:56:50,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710724990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886751291] [2025-03-09 06:56:50,311 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:56:50,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:50,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:50,313 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:50,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-03-09 06:56:50,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 60 statements into 13 equivalence classes. [2025-03-09 06:56:50,629 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 06:56:50,629 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-09 06:56:50,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:50,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:56:50,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 296 proven. 15 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 06:56:50,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:56:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 296 proven. 15 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 06:56:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886751291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:56:50,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:56:50,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-09 06:56:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801648280] [2025-03-09 06:56:50,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:56:50,896 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:56:50,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 17 times [2025-03-09 06:56:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:50,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376580284] [2025-03-09 06:56:50,896 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 06:56:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:50,899 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:50,899 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:50,900 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:56:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:50,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:50,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:50,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:50,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:50,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:50,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:50,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 06:56:50,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-09 06:56:50,928 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. cyclomatic complexity: 25 Second operand has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:50,984 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2025-03-09 06:56:50,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 131 transitions. [2025-03-09 06:56:50,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:50,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 71 states and 79 transitions. [2025-03-09 06:56:50,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:56:50,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:56:50,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 79 transitions. [2025-03-09 06:56:50,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:56:50,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-09 06:56:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 79 transitions. [2025-03-09 06:56:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-09 06:56:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-03-09 06:56:50,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-09 06:56:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:56:50,987 INFO L432 stractBuchiCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-03-09 06:56:50,987 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-09 06:56:50,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 79 transitions. [2025-03-09 06:56:50,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:50,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:50,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:50,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 14, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-09 06:56:50,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:50,988 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;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;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;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-09 06:56:50,988 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-09 06:56:50,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1458545091, now seen corresponding path program 18 times [2025-03-09 06:56:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687123191] [2025-03-09 06:56:50,989 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:56:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:50,997 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 65 statements into 13 equivalence classes. [2025-03-09 06:56:51,020 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 06:56:51,020 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-09 06:56:51,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 163 proven. 240 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-09 06:56:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687123191] [2025-03-09 06:56:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687123191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:56:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608228528] [2025-03-09 06:56:53,017 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 06:56:53,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:56:53,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:53,019 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:56:53,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-03-09 06:56:53,093 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 65 statements into 13 equivalence classes. [2025-03-09 06:56:53,400 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 06:56:53,400 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-09 06:56:53,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:53,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-09 06:56:53,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:53,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:56:53,429 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-09 06:56:53,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:53,456 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-09 06:56:53,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:53,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-09 06:56:53,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:53,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 56 [2025-03-09 06:56:53,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:56:53,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-09 06:56:53,664 INFO L349 Elim1Store]: treesize reduction 162, result has 26.0 percent of original size [2025-03-09 06:56:53,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 79 treesize of output 100 [2025-03-09 06:56:54,057 INFO L349 Elim1Store]: treesize reduction 143, result has 25.1 percent of original size [2025-03-09 06:56:54,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 38 case distinctions, treesize of input 120 treesize of output 139 [2025-03-09 06:56:54,435 INFO L349 Elim1Store]: treesize reduction 127, result has 27.4 percent of original size [2025-03-09 06:56:54,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 30 case distinctions, treesize of input 116 treesize of output 132 [2025-03-09 06:56:54,757 INFO L349 Elim1Store]: treesize reduction 254, result has 28.0 percent of original size [2025-03-09 06:56:54,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 153 treesize of output 201 [2025-03-09 06:56:56,823 INFO L349 Elim1Store]: treesize reduction 258, result has 26.9 percent of original size [2025-03-09 06:56:56,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 153 treesize of output 188 [2025-03-09 06:56:57,489 INFO L349 Elim1Store]: treesize reduction 333, result has 37.8 percent of original size [2025-03-09 06:56:57,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 51 case distinctions, treesize of input 176 treesize of output 303