./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:10:48,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:10:48,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:10:48,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:10:48,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:10:48,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:10:48,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:10:48,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:10:48,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:10:48,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:10:48,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:10:48,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:10:48,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:10:48,641 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:10:48,641 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:10:48,641 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:10:48,641 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:10:48,641 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:10:48,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:10:48,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:10:48,643 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:10:48,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:10:48,643 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:10:48,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:10:48,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:10:48,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:10:48,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:10:48,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:10:48,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:10:48,643 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:10:48,644 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 [2025-02-06 19:10:48,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:10:48,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:10:48,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:10:48,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:10:48,853 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:10:48,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2025-02-06 19:10:50,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eea16833/6ef9e3f20e3542409bcdf54e935089c7/FLAGec129a257 [2025-02-06 19:10:50,261 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:10:50,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2025-02-06 19:10:50,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eea16833/6ef9e3f20e3542409bcdf54e935089c7/FLAGec129a257 [2025-02-06 19:10:50,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2eea16833/6ef9e3f20e3542409bcdf54e935089c7 [2025-02-06 19:10:50,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:10:50,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:10:50,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:10:50,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:10:50,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:10:50,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50, skipping insertion in model container [2025-02-06 19:10:50,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:10:50,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:10:50,801 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:10:50,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:10:50,853 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:10:50,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50 WrapperNode [2025-02-06 19:10:50,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:10:50,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:10:50,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:10:50,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:10:50,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,878 INFO L138 Inliner]: procedures = 115, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2025-02-06 19:10:50,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:10:50,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:10:50,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:10:50,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:10:50,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,898 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-02-06 19:10:50,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:10:50,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:10:50,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:10:50,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:10:50,916 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (1/1) ... [2025-02-06 19:10:50,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:50,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:10:50,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:10:51,060 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:10:51,062 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:10:51,166 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L517: call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; [2025-02-06 19:10:51,171 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-06 19:10:51,171 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:10:51,177 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:10:51,177 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:10:51,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:10:51 BoogieIcfgContainer [2025-02-06 19:10:51,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:10:51,178 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:10:51,178 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:10:51,183 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:10:51,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:10:51,183 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:10:50" (1/3) ... [2025-02-06 19:10:51,185 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@512ef54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:10:51, skipping insertion in model container [2025-02-06 19:10:51,185 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:10:51,185 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:50" (2/3) ... [2025-02-06 19:10:51,185 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@512ef54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:10:51, skipping insertion in model container [2025-02-06 19:10:51,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:10:51,186 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:10:51" (3/3) ... [2025-02-06 19:10:51,187 INFO L363 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-1.i [2025-02-06 19:10:51,229 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:10:51,229 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:10:51,230 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:10:51,230 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:10:51,230 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:10:51,230 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:10:51,231 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:10:51,231 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:10:51,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-02-06 19:10:51,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 19:10:51,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:51,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:51,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:10:51,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:10:51,254 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:10:51,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-02-06 19:10:51,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 19:10:51,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:51,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:51,256 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:10:51,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:10:51,260 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" [2025-02-06 19:10:51,260 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume main_~val~0#1 < 0;main_~val~0#1 := 0;" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-06 19:10:51,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash 53409239, now seen corresponding path program 1 times [2025-02-06 19:10:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076625580] [2025-02-06 19:10:51,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:51,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:10:51,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:10:51,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:51,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:10:51,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:10:51,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:51,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash 45614, now seen corresponding path program 1 times [2025-02-06 19:10:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247067942] [2025-02-06 19:10:51,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:51,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:10:51,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:10:51,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:51,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:10:51,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:10:51,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:51,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1976755352, now seen corresponding path program 1 times [2025-02-06 19:10:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990170827] [2025-02-06 19:10:51,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:51,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:10:51,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:10:51,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:51,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:10:51,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:10:51,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:51,700 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:51,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:51,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:51,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:51,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:51,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:51,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:51,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:51,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration1_Lasso [2025-02-06 19:10:51,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:51,701 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:51,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:51,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,086 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:52,088 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:52,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:52,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:10:52,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:52,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 19:10:52,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:52,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:10:52,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:52,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:52,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:52,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-06 19:10:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:52,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:10:52,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:52,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:52,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:52,196 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:52,217 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-02-06 19:10:52,219 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-02-06 19:10:52,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:52,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:10:52,231 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:52,244 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:52,244 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:52,244 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-02-06 19:10:52,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:10:52,266 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-02-06 19:10:52,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:52,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:10:52,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:10:52,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:52,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:10:52,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:52,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:10:52,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:10:52,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:52,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:10:52,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:52,359 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:10:52,363 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:52,417 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 31 transitions. Complement of second has 5 states. [2025-02-06 19:10:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-02-06 19:10:52,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-06 19:10:52,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:52,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-06 19:10:52,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:52,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-06 19:10:52,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:52,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2025-02-06 19:10:52,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:10:52,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 20 transitions. [2025-02-06 19:10:52,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:52,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:10:52,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-02-06 19:10:52,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:52,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-02-06 19:10:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-02-06 19:10:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-02-06 19:10:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2025-02-06 19:10:52,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-02-06 19:10:52,451 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-02-06 19:10:52,451 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:10:52,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2025-02-06 19:10:52,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:10:52,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:52,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:52,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:10:52,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:10:52,452 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-02-06 19:10:52,452 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume !true;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-02-06 19:10:52,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1655686421, now seen corresponding path program 1 times [2025-02-06 19:10:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199391489] [2025-02-06 19:10:52,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:52,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:52,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:52,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199391489] [2025-02-06 19:10:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199391489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:10:52,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:10:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:10:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551563904] [2025-02-06 19:10:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:10:52,566 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:52,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash 40676, now seen corresponding path program 1 times [2025-02-06 19:10:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103689846] [2025-02-06 19:10:52,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:52,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:10:52,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:10:52,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:52,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103689846] [2025-02-06 19:10:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103689846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:10:52,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:10:52,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:10:52,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816803633] [2025-02-06 19:10:52,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:10:52,579 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:10:52,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:52,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 19:10:52,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 19:10:52,581 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 8 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-02-06 19:10:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:52,584 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2025-02-06 19:10:52,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2025-02-06 19:10:52,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:10:52,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2025-02-06 19:10:52,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:52,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:10:52,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-02-06 19:10:52,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:52,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-06 19:10:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-02-06 19:10:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-06 19:10:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-02-06 19:10:52,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-06 19:10:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 19:10:52,587 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-06 19:10:52,587 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:10:52,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-02-06 19:10:52,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:10:52,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:52,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:52,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:10:52,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:10:52,588 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-02-06 19:10:52,588 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-02-06 19:10:52,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:52,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1655686421, now seen corresponding path program 2 times [2025-02-06 19:10:52,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:52,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103491172] [2025-02-06 19:10:52,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:52,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:52,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:52,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:52,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:52,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:52,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:52,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103491172] [2025-02-06 19:10:52,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103491172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:10:52,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:10:52,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:10:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667528374] [2025-02-06 19:10:52,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:10:52,626 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:52,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 1 times [2025-02-06 19:10:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133219019] [2025-02-06 19:10:52,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:52,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:52,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:52,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:52,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:52,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:52,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:52,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:52,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:52,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:10:52,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:10:52,664 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-02-06 19:10:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:52,677 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-06 19:10:52,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2025-02-06 19:10:52,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:10:52,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2025-02-06 19:10:52,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:52,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:10:52,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2025-02-06 19:10:52,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:52,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-02-06 19:10:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2025-02-06 19:10:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-02-06 19:10:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-02-06 19:10:52,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-06 19:10:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:10:52,680 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-06 19:10:52,680 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:10:52,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-02-06 19:10:52,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 19:10:52,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:52,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:52,681 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:52,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:10:52,681 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-02-06 19:10:52,681 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-02-06 19:10:52,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1149874741, now seen corresponding path program 1 times [2025-02-06 19:10:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274432791] [2025-02-06 19:10:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:52,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:10:52,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:10:52,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:52,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:52,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:10:52,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:10:52,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:52,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 2 times [2025-02-06 19:10:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:52,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449234450] [2025-02-06 19:10:52,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:52,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:52,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:52,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:52,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:52,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:52,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:52,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:52,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:52,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:52,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1487883664, now seen corresponding path program 1 times [2025-02-06 19:10:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:52,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371812980] [2025-02-06 19:10:52,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:52,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:10:52,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:10:52,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:52,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:10:52,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:10:52,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:52,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:52,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:52,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:52,913 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:52,913 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:52,913 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:52,913 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:52,913 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:52,913 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,913 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:52,913 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:52,913 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration4_Lasso [2025-02-06 19:10:52,913 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:52,914 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:52,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,192 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:53,193 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:53,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:53,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:10:53,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:53,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:53,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:53,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:53,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:53,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:53,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,222 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:53,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:53,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:10:53,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:53,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:53,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:53,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:53,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 19:10:53,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:53,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:10:53,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:53,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:53,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:53,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:53,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:53,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:53,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,278 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:53,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:10:53,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:53,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:53,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:53,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:53,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:53,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-06 19:10:53,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,305 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:53,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:10:53,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-02-06 19:10:53,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:53,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:53,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:53,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:53,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:53,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:53,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:10:53,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-02-06 19:10:53,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:53,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:53,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:53,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-06 19:10:53,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,356 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:53,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:10:53,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:53,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:53,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:53,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:53,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:53,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:10:53,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:53,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:10:53,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:53,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:53,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:53,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:53,422 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-02-06 19:10:53,422 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-02-06 19:10:53,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,424 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:53,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:10:53,425 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:53,437 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:53,437 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:53,437 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-02-06 19:10:53,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:53,454 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-02-06 19:10:53,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:10:53,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:10:53,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:53,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:10:53,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:53,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:53,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:53,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:53,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:10:53,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:53,510 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:10:53,510 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:53,531 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 24 transitions. Complement of second has 4 states. [2025-02-06 19:10:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-02-06 19:10:53,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-06 19:10:53,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:53,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2025-02-06 19:10:53,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:53,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2025-02-06 19:10:53,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:53,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-02-06 19:10:53,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:53,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2025-02-06 19:10:53,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:10:53,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:10:53,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2025-02-06 19:10:53,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:53,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-02-06 19:10:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2025-02-06 19:10:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-02-06 19:10:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-02-06 19:10:53,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-02-06 19:10:53,534 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-02-06 19:10:53,534 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:10:53,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2025-02-06 19:10:53,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:53,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:53,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:53,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:53,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:53,535 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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-02-06 19:10:53,535 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:10:53,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1286378614, now seen corresponding path program 1 times [2025-02-06 19:10:53,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:53,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325003691] [2025-02-06 19:10:53,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:53,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:53,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:10:53,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:10:53,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:53,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:10:53,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:10:53,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2025-02-06 19:10:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596458626] [2025-02-06 19:10:53,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:53,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:53,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:53,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,556 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:53,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:53,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:53,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:53,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash -740732907, now seen corresponding path program 1 times [2025-02-06 19:10:53,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:53,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729601047] [2025-02-06 19:10:53,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:53,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:10:53,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:10:53,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:53,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:10:53,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:10:53,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:53,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-06 19:10:53,826 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:53,826 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:53,826 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:53,826 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:53,826 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:53,826 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,826 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:53,826 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:53,826 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration5_Lasso [2025-02-06 19:10:53,826 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:53,826 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:53,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:53,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,154 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:54,154 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:54,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:54,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:54,163 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:54,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:10:54,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:54,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:54,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:54,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:54,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:54,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:54,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:54,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:54,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:54,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:10:54,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:54,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:54,187 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:54,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:10:54,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:54,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:54,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:54,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:54,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:54,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:54,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:54,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:54,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:54,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:10:54,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:54,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:54,213 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:54,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:10:54,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-02-06 19:10:54,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:54,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:54,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:54,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:54,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:54,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:54,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:54,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-06 19:10:54,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:54,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:54,243 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:54,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:10:54,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:54,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:54,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:54,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:54,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:54,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:54,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:54,263 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:54,271 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:10:54,271 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:10:54,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:54,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:54,275 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:54,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:10:54,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:54,287 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:54,287 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:54,287 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2 Supporting invariants [] [2025-02-06 19:10:54,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:10:54,303 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2025-02-06 19:10:54,305 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:54,306 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:54,306 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:10:54,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:54,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:10:54,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:10:54,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:54,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:54,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:54,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:54,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:54,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:54,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:54,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:54,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:54,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:54,391 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-02-06 19:10:54,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:54,434 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 33 transitions. Complement of second has 9 states. [2025-02-06 19:10:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2025-02-06 19:10:54,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-06 19:10:54,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:54,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-06 19:10:54,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:54,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-06 19:10:54,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:54,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2025-02-06 19:10:54,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:54,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 26 transitions. [2025-02-06 19:10:54,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:10:54,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:10:54,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2025-02-06 19:10:54,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:54,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-02-06 19:10:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2025-02-06 19:10:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-02-06 19:10:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-02-06 19:10:54,438 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-02-06 19:10:54,438 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-02-06 19:10:54,438 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:10:54,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2025-02-06 19:10:54,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:54,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:54,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:54,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:54,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:54,439 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:10:54,439 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:10:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1120246683, now seen corresponding path program 2 times [2025-02-06 19:10:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443790820] [2025-02-06 19:10:54,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:54,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 19:10:54,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:10:54,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:54,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:54,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:54,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443790820] [2025-02-06 19:10:54,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443790820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:54,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467405012] [2025-02-06 19:10:54,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:54,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:54,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:54,607 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:10:54,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 19:10:54,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 19:10:54,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:10:54,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:54,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:54,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:10:54,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:54,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467405012] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:54,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 19:10:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381427620] [2025-02-06 19:10:54,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:54,764 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:54,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:54,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2025-02-06 19:10:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:54,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509665093] [2025-02-06 19:10:54,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:54,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:54,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:54,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:54,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:54,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:54,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:54,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:54,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:54,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:54,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:54,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:54,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 19:10:54,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 19:10:54,820 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 10 Second operand has 10 states, 9 states have (on average 3.2222222222222223) 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-02-06 19:10:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:54,884 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-02-06 19:10:54,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2025-02-06 19:10:54,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:54,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 32 transitions. [2025-02-06 19:10:54,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:10:54,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:10:54,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2025-02-06 19:10:54,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:54,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-02-06 19:10:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2025-02-06 19:10:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-06 19:10:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-02-06 19:10:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-02-06 19:10:54,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-06 19:10:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:10:54,887 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-06 19:10:54,887 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:10:54,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2025-02-06 19:10:54,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:54,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:54,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:54,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:54,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:54,888 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:10:54,888 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:10:54,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:54,888 INFO L85 PathProgramCache]: Analyzing trace with hash 519071931, now seen corresponding path program 3 times [2025-02-06 19:10:54,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:54,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248950226] [2025-02-06 19:10:54,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:54,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-02-06 19:10:54,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:10:54,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:10:54,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:54,901 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:54,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:10:54,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:10:54,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:54,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:54,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:54,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2025-02-06 19:10:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835023896] [2025-02-06 19:10:54,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:54,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:54,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:54,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:10:54,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:54,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:54,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:54,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:54,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:54,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:54,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:54,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash 611919642, now seen corresponding path program 1 times [2025-02-06 19:10:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:54,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789331946] [2025-02-06 19:10:54,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:54,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:54,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:10:54,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:10:54,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:54,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:54,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:54,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:10:54,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:10:54,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:54,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:54,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:55,333 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:55,333 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:55,333 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:55,333 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:55,334 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:55,334 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,334 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:55,334 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:55,334 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration7_Lasso [2025-02-06 19:10:55,334 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:55,334 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:55,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,699 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:55,700 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:55,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,702 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:55,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:10:55,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:55,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,721 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:55,728 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-06 19:10:55,729 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:10:55,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,734 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:55,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:10:55,736 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:55,747 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:55,747 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:55,747 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 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 4))_1 Supporting invariants [] [2025-02-06 19:10:55,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:10:55,763 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-02-06 19:10:55,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:55,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:55,765 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:10:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:55,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:10:55,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:10:55,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:55,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:55,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:10:55,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:55,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:55,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:55,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:55,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:55,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:55,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:55,851 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-02-06 19:10:55,851 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-02-06 19:10:55,868 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Result 23 states and 31 transitions. Complement of second has 4 states. [2025-02-06 19:10:55,868 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-02-06 19:10:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-02-06 19:10:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:10:55,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 17 letters. Loop has 2 letters. [2025-02-06 19:10:55,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:55,869 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:55,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:55,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:10:55,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:10:55,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:55,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:55,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:10:55,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:55,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:55,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:55,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:55,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:55,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:55,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:55,958 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2025-02-06 19:10:55,958 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-02-06 19:10:55,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Result 23 states and 31 transitions. Complement of second has 4 states. [2025-02-06 19:10:55,978 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-02-06 19:10:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-02-06 19:10:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:10:55,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 17 letters. Loop has 2 letters. [2025-02-06 19:10:55,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:55,979 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:55,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:10:56,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:10:56,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:56,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,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-02-06 19:10:56,068 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-02-06 19:10:56,068 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-02-06 19:10:56,129 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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) Result 37 states and 48 transitions. Complement of second has 10 states. [2025-02-06 19:10:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:10:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-02-06 19:10:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2025-02-06 19:10:56,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 17 letters. Loop has 2 letters. [2025-02-06 19:10:56,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:56,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 19 letters. Loop has 2 letters. [2025-02-06 19:10:56,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:56,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 17 letters. Loop has 4 letters. [2025-02-06 19:10:56,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:56,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2025-02-06 19:10:56,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:56,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 41 transitions. [2025-02-06 19:10:56,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:56,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:10:56,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2025-02-06 19:10:56,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:56,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-02-06 19:10:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2025-02-06 19:10:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-02-06 19:10:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-02-06 19:10:56,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-02-06 19:10:56,133 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-02-06 19:10:56,133 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:10:56,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2025-02-06 19:10:56,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:56,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:56,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:56,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:56,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:56,135 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:10:56,135 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:10:56,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash -355744416, now seen corresponding path program 4 times [2025-02-06 19:10:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652738126] [2025-02-06 19:10:56,135 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:56,140 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-02-06 19:10:56,143 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-02-06 19:10:56,143 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:10:56,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:56,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:56,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652738126] [2025-02-06 19:10:56,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652738126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:56,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099510464] [2025-02-06 19:10:56,238 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:56,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:56,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:56,240 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:10:56,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-06 19:10:56,280 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-02-06 19:10:56,285 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-02-06 19:10:56,286 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:10:56,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:56,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099510464] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:56,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:56,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 19:10:56,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214458404] [2025-02-06 19:10:56,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:56,401 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:56,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2025-02-06 19:10:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:56,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256807346] [2025-02-06 19:10:56,402 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:56,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:56,405 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:10:56,407 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,407 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:10:56,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:56,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:56,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:56,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:10:56,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:10:56,444 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 13 Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:56,509 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2025-02-06 19:10:56,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2025-02-06 19:10:56,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:56,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 32 states and 42 transitions. [2025-02-06 19:10:56,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:10:56,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:10:56,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2025-02-06 19:10:56,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:56,510 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-02-06 19:10:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2025-02-06 19:10:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-02-06 19:10:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-02-06 19:10:56,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-02-06 19:10:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:10:56,513 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-02-06 19:10:56,514 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:10:56,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2025-02-06 19:10:56,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:56,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:56,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:56,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:56,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:56,515 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:10:56,515 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:10:56,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash 947254336, now seen corresponding path program 5 times [2025-02-06 19:10:56,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:56,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479180425] [2025-02-06 19:10:56,515 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:10:56,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:56,525 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 4 equivalence classes. [2025-02-06 19:10:56,533 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:10:56,533 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 19:10:56,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,533 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:56,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:10:56,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:10:56,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:56,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 5 times [2025-02-06 19:10:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:56,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154427889] [2025-02-06 19:10:56,545 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:10:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:56,547 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:56,548 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,548 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:56,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:56,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:56,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:56,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash -221649569, now seen corresponding path program 2 times [2025-02-06 19:10:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302456934] [2025-02-06 19:10:56,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:56,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 19:10:56,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 19:10:56,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:56,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:56,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 19:10:56,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 19:10:56,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:56,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:56,937 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:56,937 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:56,937 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:56,937 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:56,937 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:56,937 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:56,937 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:56,938 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:56,938 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration9_Lasso [2025-02-06 19:10:56,938 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:56,938 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:56,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:56,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:56,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:56,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:56,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:56,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:57,283 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:57,285 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:57,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:57,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:57,287 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:57,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:10:57,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:57,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:57,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:57,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:57,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:57,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:57,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:57,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:57,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:57,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:57,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:57,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:57,314 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:57,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:10:57,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:57,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:57,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:57,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:57,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:57,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:57,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:57,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:57,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:57,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:57,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:57,338 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:57,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:10:57,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:57,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:57,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:57,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:57,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:57,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:57,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:57,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:57,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:57,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:10:57,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:57,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:57,363 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:57,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:10:57,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:57,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:57,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:57,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:57,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:57,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:57,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:57,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:57,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:57,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 19:10:57,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:57,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:57,384 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:57,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 19:10:57,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:57,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:57,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:57,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:57,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:57,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:57,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:57,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:57,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:57,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:57,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:57,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:57,407 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:57,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 19:10:57,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:57,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:57,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:57,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:57,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:57,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:57,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:57,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:57,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:57,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:57,438 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:57,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 19:10:57,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:57,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:57,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:57,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:57,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:57,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:57,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:57,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:57,464 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:10:57,464 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:10:57,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:57,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:57,466 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:57,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 19:10:57,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:57,478 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:57,478 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:57,479 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 8)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 8)_1 Supporting invariants [] [2025-02-06 19:10:57,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-06 19:10:57,495 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2025-02-06 19:10:57,496 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:57,497 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:57,497 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:10:57,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:57,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:10:57,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:10:57,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:57,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:57,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:10:57,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:57,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:57,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:57,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:57,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:57,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:57,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:57,675 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-02-06 19:10:57,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-02-06 19:10:57,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) Result 31 states and 41 transitions. Complement of second has 5 states. [2025-02-06 19:10:57,699 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-02-06 19:10:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-02-06 19:10:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-06 19:10:57,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 24 letters. Loop has 2 letters. [2025-02-06 19:10:57,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:57,699 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:57,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:10:57,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:10:57,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:57,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:57,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:10:57,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:57,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:57,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:57,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:57,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:57,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:57,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:57,855 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-02-06 19:10:57,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-02-06 19:10:57,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) Result 31 states and 41 transitions. Complement of second has 5 states. [2025-02-06 19:10:57,880 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-02-06 19:10:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-02-06 19:10:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-06 19:10:57,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 24 letters. Loop has 2 letters. [2025-02-06 19:10:57,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:57,881 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:57,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:57,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:10:57,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:10:57,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:57,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:57,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:10:57,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:58,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:58,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:58,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:58,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:58,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:58,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:58,027 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-02-06 19:10:58,027 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-02-06 19:10:58,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) Result 46 states and 60 transitions. Complement of second has 13 states. [2025-02-06 19:10:58,094 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-02-06 19:10:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-02-06 19:10:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2025-02-06 19:10:58,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 24 letters. Loop has 2 letters. [2025-02-06 19:10:58,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:58,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 26 letters. Loop has 2 letters. [2025-02-06 19:10:58,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:58,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 24 letters. Loop has 4 letters. [2025-02-06 19:10:58,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:58,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 60 transitions. [2025-02-06 19:10:58,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:58,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 41 states and 53 transitions. [2025-02-06 19:10:58,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:58,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:10:58,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2025-02-06 19:10:58,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:58,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-02-06 19:10:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2025-02-06 19:10:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-02-06 19:10:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2025-02-06 19:10:58,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-02-06 19:10:58,098 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-02-06 19:10:58,098 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:10:58,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2025-02-06 19:10:58,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:58,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:58,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:58,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:58,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:58,098 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:10:58,098 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:10:58,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1743128165, now seen corresponding path program 6 times [2025-02-06 19:10:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547990942] [2025-02-06 19:10:58,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:10:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:58,103 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-02-06 19:10:58,108 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:10:58,108 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 19:10:58,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:58,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547990942] [2025-02-06 19:10:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547990942] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950421339] [2025-02-06 19:10:58,218 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:10:58,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:58,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:58,221 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:10:58,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-02-06 19:10:58,257 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-02-06 19:10:58,274 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:10:58,274 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 19:10:58,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:58,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:58,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:58,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950421339] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:58,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 19:10:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210561572] [2025-02-06 19:10:58,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:58,454 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:58,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 6 times [2025-02-06 19:10:58,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:58,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776191882] [2025-02-06 19:10:58,454 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:10:58,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:58,458 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:58,460 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:58,460 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:10:58,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:58,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:58,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:58,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:58,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:58,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:58,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:58,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 19:10:58,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-02-06 19:10:58,492 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 16 Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:58,558 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2025-02-06 19:10:58,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 71 transitions. [2025-02-06 19:10:58,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:58,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 40 states and 52 transitions. [2025-02-06 19:10:58,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:10:58,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:10:58,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2025-02-06 19:10:58,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:58,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-02-06 19:10:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2025-02-06 19:10:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-02-06 19:10:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 37 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-02-06 19:10:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-02-06 19:10:58,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-02-06 19:10:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:10:58,563 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-02-06 19:10:58,563 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:10:58,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 49 transitions. [2025-02-06 19:10:58,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:58,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:58,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:58,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:58,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:58,564 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:10:58,564 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:10:58,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:58,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1575789691, now seen corresponding path program 7 times [2025-02-06 19:10:58,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:58,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894885283] [2025-02-06 19:10:58,565 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:10:58,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:58,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:10:58,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:10:58,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:58,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:58,584 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:58,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:10:58,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:10:58,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:58,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:58,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:58,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 7 times [2025-02-06 19:10:58,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:58,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844221790] [2025-02-06 19:10:58,607 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:10:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:58,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:58,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:58,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:58,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:58,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:58,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:58,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:58,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:58,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:58,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:58,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1789562724, now seen corresponding path program 3 times [2025-02-06 19:10:58,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:58,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420576568] [2025-02-06 19:10:58,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:58,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-02-06 19:10:58,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 19:10:58,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 19:10:58,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:58,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:58,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 19:10:58,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 19:10:58,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:58,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:58,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:59,209 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:59,209 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:59,209 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:59,209 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:59,209 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:59,209 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,209 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:59,210 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:59,210 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration11_Lasso [2025-02-06 19:10:59,210 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:59,210 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:59,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,576 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:59,579 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:59,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,581 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:59,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-06 19:10:59,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:59,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:59,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:59,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:59,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,604 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:59,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-06 19:10:59,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:59,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:59,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:59,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:59,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,624 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:59,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-06 19:10:59,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:59,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:59,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:59,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:59,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-06 19:10:59,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,647 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:59,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-06 19:10:59,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:59,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,675 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:59,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-06 19:10:59,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:59,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,693 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:59,700 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-02-06 19:10:59,700 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:10:59,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,703 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:59,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-06 19:10:59,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:59,715 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:59,715 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:59,715 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-02-06 19:10:59,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-06 19:10:59,738 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-02-06 19:10:59,739 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:59,739 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:59,739 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:10:59,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:59,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:10:59,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:10:59,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:59,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:59,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:59,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:59,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:59,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:59,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:59,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:59,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:59,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:59,867 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-02-06 19:10:59,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17 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-02-06 19:10:59,883 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17. 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 39 states and 51 transitions. Complement of second has 4 states. [2025-02-06 19:10:59,883 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-02-06 19:10:59,883 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-02-06 19:10:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:10:59,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 31 letters. Loop has 2 letters. [2025-02-06 19:10:59,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:59,883 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:59,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:59,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:10:59,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:10:59,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:59,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:59,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:59,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:59,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:59,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:59,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:59,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:59,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:59,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:00,012 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-02-06 19:11:00,012 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17 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-02-06 19:11:00,026 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17. 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 39 states and 51 transitions. Complement of second has 4 states. [2025-02-06 19:11:00,027 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-02-06 19:11:00,031 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-02-06 19:11:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:11:00,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 31 letters. Loop has 2 letters. [2025-02-06 19:11:00,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:00,031 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:00,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:11:00,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:11:00,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:00,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:11:00,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:00,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:00,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:00,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:00,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:00,139 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-02-06 19:11:00,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17 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-02-06 19:11:00,223 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 17. 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 55 states and 72 transitions. Complement of second has 14 states. [2025-02-06 19:11:00,224 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-02-06 19:11:00,224 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-02-06 19:11:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2025-02-06 19:11:00,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 31 letters. Loop has 2 letters. [2025-02-06 19:11:00,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:00,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 33 letters. Loop has 2 letters. [2025-02-06 19:11:00,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:00,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 31 letters. Loop has 4 letters. [2025-02-06 19:11:00,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:00,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 72 transitions. [2025-02-06 19:11:00,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:00,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 50 states and 65 transitions. [2025-02-06 19:11:00,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:11:00,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:11:00,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 65 transitions. [2025-02-06 19:11:00,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:00,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 65 transitions. [2025-02-06 19:11:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 65 transitions. [2025-02-06 19:11:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2025-02-06 19:11:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 42 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-02-06 19:11:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-02-06 19:11:00,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-02-06 19:11:00,227 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-02-06 19:11:00,228 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:11:00,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 55 transitions. [2025-02-06 19:11:00,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:00,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:00,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:00,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:00,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:00,229 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:00,229 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1782858538, now seen corresponding path program 8 times [2025-02-06 19:11:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055259319] [2025-02-06 19:11:00,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 19:11:00,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:11:00,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:00,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055259319] [2025-02-06 19:11:00,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055259319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:00,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570873185] [2025-02-06 19:11:00,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:00,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:00,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:00,395 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:11:00,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-02-06 19:11:00,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 19:11:00,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:11:00,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:00,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:00,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:11:00,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:00,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570873185] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:00,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:00,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-02-06 19:11:00,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528047602] [2025-02-06 19:11:00,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:00,624 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:00,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 8 times [2025-02-06 19:11:00,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889480201] [2025-02-06 19:11:00,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:00,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:00,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:00,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,635 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:00,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:00,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:00,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 19:11:00,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-02-06 19:11:00,680 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. cyclomatic complexity: 19 Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:00,775 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2025-02-06 19:11:00,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2025-02-06 19:11:00,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:00,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 48 states and 62 transitions. [2025-02-06 19:11:00,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:00,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:11:00,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 62 transitions. [2025-02-06 19:11:00,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:00,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-02-06 19:11:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 62 transitions. [2025-02-06 19:11:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-02-06 19:11:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-02-06 19:11:00,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-02-06 19:11:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:11:00,780 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-02-06 19:11:00,780 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:11:00,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2025-02-06 19:11:00,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:00,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:00,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:00,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:00,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:00,782 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:00,782 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:00,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1820136950, now seen corresponding path program 9 times [2025-02-06 19:11:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428033401] [2025-02-06 19:11:00,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-02-06 19:11:00,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:11:00,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:11:00,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:00,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:11:00,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:11:00,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:00,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 9 times [2025-02-06 19:11:00,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85217561] [2025-02-06 19:11:00,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:00,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-06 19:11:00,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:00,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:11:00,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:00,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:00,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:00,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1099919191, now seen corresponding path program 4 times [2025-02-06 19:11:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950756697] [2025-02-06 19:11:00,864 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:00,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,871 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-02-06 19:11:00,891 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 19:11:00,891 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:00,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:00,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 19:11:00,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 19:11:00,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:01,701 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:01,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:01,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:01,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:01,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:01,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:01,702 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:01,702 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:01,702 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration13_Lasso [2025-02-06 19:11:01,702 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:01,702 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:01,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:01,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:02,035 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:02,035 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:02,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,038 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-06 19:11:02,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:02,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:02,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:02,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:02,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:02,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:02,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,061 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-06 19:11:02,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:02,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:02,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:02,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:02,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:02,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-06 19:11:02,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,084 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-06 19:11:02,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:02,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:02,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:02,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:02,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:02,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,108 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-06 19:11:02,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:02,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:02,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:02,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:02,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:02,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,132 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-06 19:11:02,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:02,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:02,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:02,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:02,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-02-06 19:11:02,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,157 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-06 19:11:02,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-02-06 19:11:02,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:02,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:02,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:02,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:02,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,182 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-06 19:11:02,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:02,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:02,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:02,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:02,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-06 19:11:02,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,207 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-06 19:11:02,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:02,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:02,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:02,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:02,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:02,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,237 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-06 19:11:02,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:02,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:02,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:02,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:02,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:02,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,279 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-06 19:11:02,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:02,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:02,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:02,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:02,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:02,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:02,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:02,298 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:02,305 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:11:02,305 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:11:02,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:02,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:02,307 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:02,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-02-06 19:11:02,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:02,319 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:02,320 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:02,320 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 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2025-02-06 19:11:02,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:02,339 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-02-06 19:11:02,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:02,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:02,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:11:02,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:02,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:11:02,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:11:02,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:02,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:02,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:11:02,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:02,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:02,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:02,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:02,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:02,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:02,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:02,514 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-02-06 19:11:02,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:02,534 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 61 transitions. Complement of second has 4 states. [2025-02-06 19:11:02,534 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-02-06 19:11:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:11:02,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-06 19:11:02,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:02,535 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:02,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:02,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:11:02,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:11:02,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:02,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:02,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:11:02,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:02,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:02,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:02,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:02,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:02,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:02,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:02,668 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2025-02-06 19:11:02,668 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:02,691 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 61 transitions. Complement of second has 4 states. [2025-02-06 19:11:02,692 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-02-06 19:11:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:11:02,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-06 19:11:02,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:02,696 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:02,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:02,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:11:02,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:11:02,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:02,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:02,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:11:02,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:02,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:02,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:02,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:02,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:02,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:02,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:02,850 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-02-06 19:11:02,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:02,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 59 transitions. cyclomatic complexity: 20. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 84 transitions. Complement of second has 16 states. [2025-02-06 19:11:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2025-02-06 19:11:02,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-06 19:11:02,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:02,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 40 letters. Loop has 2 letters. [2025-02-06 19:11:02,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:02,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 38 letters. Loop has 4 letters. [2025-02-06 19:11:02,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:02,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 84 transitions. [2025-02-06 19:11:02,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:02,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 59 states and 77 transitions. [2025-02-06 19:11:02,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:11:02,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:11:02,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 77 transitions. [2025-02-06 19:11:02,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:02,940 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 77 transitions. [2025-02-06 19:11:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 77 transitions. [2025-02-06 19:11:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-02-06 19:11:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-02-06 19:11:02,942 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-02-06 19:11:02,942 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-02-06 19:11:02,942 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-06 19:11:02,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 65 transitions. [2025-02-06 19:11:02,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:02,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:02,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:02,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:02,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:02,947 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:02,947 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:02,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash -460388561, now seen corresponding path program 10 times [2025-02-06 19:11:02,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:02,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520943906] [2025-02-06 19:11:02,947 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:02,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:02,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-02-06 19:11:02,960 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 40 of 42 statements. [2025-02-06 19:11:02,961 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:11:02,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 28 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:03,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:03,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520943906] [2025-02-06 19:11:03,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520943906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:03,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446556976] [2025-02-06 19:11:03,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:03,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:03,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:03,143 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:11:03,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-02-06 19:11:03,190 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-02-06 19:11:03,201 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 40 of 42 statements. [2025-02-06 19:11:03,201 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:11:03,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:03,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:11:03,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:03,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446556976] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:03,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:03,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-02-06 19:11:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904731264] [2025-02-06 19:11:03,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:03,428 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:03,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 10 times [2025-02-06 19:11:03,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:03,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-02-06 19:11:03,428 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:03,431 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:11:03,435 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:03,435 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:03,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:03,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:03,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:03,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:03,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:03,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:03,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:03,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:03,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 19:11:03,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-02-06 19:11:03,465 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. cyclomatic complexity: 22 Second operand has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:03,574 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2025-02-06 19:11:03,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 103 transitions. [2025-02-06 19:11:03,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:03,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 56 states and 72 transitions. [2025-02-06 19:11:03,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:03,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:11:03,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2025-02-06 19:11:03,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:03,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 72 transitions. [2025-02-06 19:11:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2025-02-06 19:11:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-02-06 19:11:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-02-06 19:11:03,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-02-06 19:11:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 19:11:03,582 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-02-06 19:11:03,582 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-06 19:11:03,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2025-02-06 19:11:03,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:03,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:03,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:03,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:03,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:03,583 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:03,583 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:03,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1638982735, now seen corresponding path program 11 times [2025-02-06 19:11:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:03,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335846483] [2025-02-06 19:11:03,583 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:03,596 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 7 equivalence classes. [2025-02-06 19:11:03,613 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 19:11:03,614 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 19:11:03,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:03,614 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:03,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 19:11:03,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 19:11:03,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:03,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:03,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 11 times [2025-02-06 19:11:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163282222] [2025-02-06 19:11:03,634 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:03,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:03,639 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:03,640 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:03,640 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:03,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:03,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:03,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:03,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:03,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:03,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:03,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:03,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1190589010, now seen corresponding path program 5 times [2025-02-06 19:11:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:03,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863614365] [2025-02-06 19:11:03,645 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:03,650 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 7 equivalence classes. [2025-02-06 19:11:03,673 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 19:11:03,673 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 19:11:03,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:03,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:03,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 19:11:03,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 19:11:03,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:03,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:03,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:03,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-02-06 19:11:05,536 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:05,536 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:05,536 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:05,536 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:05,536 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:05,536 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:05,536 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:05,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:05,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration15_Lasso [2025-02-06 19:11:05,536 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:05,536 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:05,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:05,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:06,416 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:06,416 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:06,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,418 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-02-06 19:11:06,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,439 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-06 19:11:06,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,462 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-02-06 19:11:06,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,484 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-02-06 19:11:06,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-02-06 19:11:06,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,506 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-02-06 19:11:06,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:06,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:06,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-02-06 19:11:06,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,529 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-06 19:11:06,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,548 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-06 19:11:06,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,578 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-02-06 19:11:06,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:06,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:06,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-06 19:11:06,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,600 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-02-06 19:11:06,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-02-06 19:11:06,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,622 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-02-06 19:11:06,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,644 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-02-06 19:11:06,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,665 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-02-06 19:11:06,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-02-06 19:11:06,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,686 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-02-06 19:11:06,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:06,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:06,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:06,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,709 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-02-06 19:11:06,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:06,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:06,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-02-06 19:11:06,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,733 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-02-06 19:11:06,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:06,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:06,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,757 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-02-06 19:11:06,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:06,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:06,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,780 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-02-06 19:11:06,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:06,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:06,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,808 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-02-06 19:11:06,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:06,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:06,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:06,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:06,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:06,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,836 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-02-06 19:11:06,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-02-06 19:11:06,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:06,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:06,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:06,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:06,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:06,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:06,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:06,868 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-06 19:11:06,868 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:11:06,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:06,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,871 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:06,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-02-06 19:11:06,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:06,883 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:06,884 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:06,884 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-02-06 19:11:06,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-02-06 19:11:06,921 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2025-02-06 19:11:06,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:06,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:06,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:11:06,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:06,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 19:11:06,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 19:11:06,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:06,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:06,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:11:06,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:07,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:07,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:07,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:07,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:07,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:07,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:07,061 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-02-06 19:11:07,061 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:07,078 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 71 transitions. Complement of second has 4 states. [2025-02-06 19:11:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:11:07,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 45 letters. Loop has 2 letters. [2025-02-06 19:11:07,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:07,079 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:07,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:07,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 19:11:07,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 19:11:07,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:07,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:07,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:11:07,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:07,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:07,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:07,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:07,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:07,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:07,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:07,235 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-02-06 19:11:07,235 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:07,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 71 transitions. Complement of second has 4 states. [2025-02-06 19:11:07,254 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-02-06 19:11:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:11:07,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 45 letters. Loop has 2 letters. [2025-02-06 19:11:07,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:07,255 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:07,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:07,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 19:11:07,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 19:11:07,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:07,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:07,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:11:07,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:07,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:07,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:07,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:07,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:07,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:07,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:07,448 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-02-06 19:11:07,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:07,578 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 69 transitions. cyclomatic complexity: 23. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 96 transitions. Complement of second has 18 states. [2025-02-06 19:11:07,578 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-02-06 19:11:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2025-02-06 19:11:07,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 45 letters. Loop has 2 letters. [2025-02-06 19:11:07,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:07,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 47 letters. Loop has 2 letters. [2025-02-06 19:11:07,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:07,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 45 letters. Loop has 4 letters. [2025-02-06 19:11:07,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:07,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 96 transitions. [2025-02-06 19:11:07,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:07,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 89 transitions. [2025-02-06 19:11:07,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:11:07,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:11:07,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 89 transitions. [2025-02-06 19:11:07,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:07,581 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 89 transitions. [2025-02-06 19:11:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 89 transitions. [2025-02-06 19:11:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2025-02-06 19:11:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.271186440677966) internal successors, (75), 58 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-02-06 19:11:07,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-02-06 19:11:07,587 INFO L432 stractBuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-02-06 19:11:07,587 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-06 19:11:07,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. [2025-02-06 19:11:07,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:07,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:07,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:07,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:07,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:07,588 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:07,588 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:07,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1694738700, now seen corresponding path program 12 times [2025-02-06 19:11:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-02-06 19:11:07,594 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:07,601 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 7 equivalence classes. [2025-02-06 19:11:07,634 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:11:07,635 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-06 19:11:07,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:07,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-02-06 19:11:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-02-06 19:11:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587925555] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977577074] [2025-02-06 19:11:07,980 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:07,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:07,987 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:11:07,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-02-06 19:11:08,033 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 7 equivalence classes. [2025-02-06 19:11:08,054 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:11:08,054 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-06 19:11:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:08,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:11:08,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 66 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:08,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 66 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:08,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977577074] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:08,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:08,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2025-02-06 19:11:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142428784] [2025-02-06 19:11:08,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:08,314 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:08,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 12 times [2025-02-06 19:11:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:08,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774138103] [2025-02-06 19:11:08,314 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:08,316 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:08,317 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:08,317 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:11:08,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:08,317 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:08,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:08,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:08,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:08,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:08,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:08,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:08,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 19:11:08,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-02-06 19:11:08,352 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. cyclomatic complexity: 25 Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:08,467 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2025-02-06 19:11:08,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 119 transitions. [2025-02-06 19:11:08,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:08,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 64 states and 82 transitions. [2025-02-06 19:11:08,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:08,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:11:08,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 82 transitions. [2025-02-06 19:11:08,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:08,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 82 transitions. [2025-02-06 19:11:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 82 transitions. [2025-02-06 19:11:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-02-06 19:11:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 61 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-02-06 19:11:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-02-06 19:11:08,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-02-06 19:11:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 19:11:08,475 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-02-06 19:11:08,475 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-02-06 19:11:08,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 79 transitions. [2025-02-06 19:11:08,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:08,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:08,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:08,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:08,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:08,476 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:08,476 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:08,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1499630124, now seen corresponding path program 13 times [2025-02-06 19:11:08,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:08,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802231450] [2025-02-06 19:11:08,476 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:08,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 19:11:08,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 19:11:08,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:08,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:08,494 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:08,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 19:11:08,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 19:11:08,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:08,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:08,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:08,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 13 times [2025-02-06 19:11:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263028662] [2025-02-06 19:11:08,511 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:08,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:08,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:08,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:08,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:08,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:08,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:08,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:08,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:08,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:08,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:08,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1964462579, now seen corresponding path program 6 times [2025-02-06 19:11:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794694622] [2025-02-06 19:11:08,515 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:08,519 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 8 equivalence classes. [2025-02-06 19:11:08,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 19:11:08,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 19:11:08,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:08,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:08,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 19:11:08,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 19:11:08,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:08,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:08,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:10,214 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:10,214 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:10,214 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:10,214 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:10,214 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:10,214 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,214 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:10,214 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:10,214 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration17_Lasso [2025-02-06 19:11:10,214 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:10,214 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:10,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:10,745 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:10,745 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:10,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,748 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-02-06 19:11:10,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:10,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:10,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:10,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:10,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,771 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-02-06 19:11:10,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:10,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:10,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:10,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-02-06 19:11:10,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,795 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-02-06 19:11:10,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:10,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:10,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:10,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:10,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,817 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-02-06 19:11:10,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:10,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:10,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:10,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:10,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,842 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-02-06 19:11:10,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:10,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:10,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:10,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,866 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-02-06 19:11:10,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:10,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:10,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:10,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-02-06 19:11:10,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,885 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-02-06 19:11:10,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:10,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:10,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:10,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:10,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,908 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-02-06 19:11:10,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:10,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:10,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-02-06 19:11:10,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,930 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-02-06 19:11:10,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:10,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:10,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-02-06 19:11:10,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,954 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-02-06 19:11:10,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:10,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:10,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:10,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:10,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:10,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:10,981 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:10,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-02-06 19:11:10,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:10,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:10,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:10,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:10,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:10,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:10,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:10,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:11,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-02-06 19:11:11,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:11,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:11,003 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:11,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-02-06 19:11:11,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:11,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:11,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:11,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:11,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:11,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:11,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:11,021 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:11,032 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-06 19:11:11,032 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:11:11,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:11,035 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:11,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-02-06 19:11:11,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:11,048 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:11,048 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:11,048 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 24))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1 Supporting invariants [] [2025-02-06 19:11:11,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-02-06 19:11:11,072 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-02-06 19:11:11,073 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:11,073 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:11,073 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:11:11,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:11,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 19:11:11,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 19:11:11,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:11,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:11,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:11:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:11,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:11,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:11,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:11,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:11,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:11,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:11,242 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-02-06 19:11:11,242 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:11,260 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 81 transitions. Complement of second has 4 states. [2025-02-06 19:11:11,260 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-02-06 19:11:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:11:11,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 52 letters. Loop has 2 letters. [2025-02-06 19:11:11,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:11,261 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:11,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 19:11:11,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 19:11:11,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:11,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:11,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:11:11,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:11,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:11,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:11,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:11,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:11,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:11,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:11,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:11,497 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-02-06 19:11:11,498 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:11,524 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 81 transitions. Complement of second has 4 states. [2025-02-06 19:11:11,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-02-06 19:11:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:11:11,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 52 letters. Loop has 2 letters. [2025-02-06 19:11:11,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:11,530 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:11,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:11,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 19:11:11,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 19:11:11,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:11,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:11,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:11:11,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:11,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:11,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:11,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:11,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:11,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:11,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:11,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-02-06 19:11:11,784 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-02-06 19:11:11,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:11,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 79 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 82 states and 108 transitions. Complement of second has 20 states. [2025-02-06 19:11:11,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2025-02-06 19:11:11,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 62 transitions. Stem has 52 letters. Loop has 2 letters. [2025-02-06 19:11:11,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:11,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 62 transitions. Stem has 54 letters. Loop has 2 letters. [2025-02-06 19:11:11,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:11,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 62 transitions. Stem has 52 letters. Loop has 4 letters. [2025-02-06 19:11:11,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:11,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 108 transitions. [2025-02-06 19:11:11,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:11,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 77 states and 101 transitions. [2025-02-06 19:11:11,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:11:11,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:11:11,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 101 transitions. [2025-02-06 19:11:11,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:11,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 101 transitions. [2025-02-06 19:11:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 101 transitions. [2025-02-06 19:11:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-02-06 19:11:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 66 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2025-02-06 19:11:11,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-02-06 19:11:11,955 INFO L432 stractBuchiCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-02-06 19:11:11,955 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-02-06 19:11:11,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 85 transitions. [2025-02-06 19:11:11,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:11,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:11,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:11,956 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:11,956 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:11,956 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:11,956 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:11,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1937072647, now seen corresponding path program 14 times [2025-02-06 19:11:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685366177] [2025-02-06 19:11:11,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:11,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-06 19:11:11,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 19:11:11,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:11,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 66 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:12,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685366177] [2025-02-06 19:11:12,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685366177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848976432] [2025-02-06 19:11:12,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:12,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:12,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,352 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:11:12,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-02-06 19:11:12,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-06 19:11:12,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 19:11:12,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:12,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:12,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:11:12,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:12,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848976432] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:13,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2025-02-06 19:11:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515606297] [2025-02-06 19:11:13,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:13,003 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:13,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:13,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 14 times [2025-02-06 19:11:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:13,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124970163] [2025-02-06 19:11:13,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:13,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:13,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:13,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:13,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:13,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:13,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:13,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:13,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:13,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:13,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:13,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 19:11:13,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-02-06 19:11:13,049 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. cyclomatic complexity: 28 Second operand has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 28 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:13,202 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2025-02-06 19:11:13,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 135 transitions. [2025-02-06 19:11:13,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:13,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 72 states and 92 transitions. [2025-02-06 19:11:13,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:13,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:11:13,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 92 transitions. [2025-02-06 19:11:13,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:13,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-02-06 19:11:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 92 transitions. [2025-02-06 19:11:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-02-06 19:11:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 69 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2025-02-06 19:11:13,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 89 transitions. [2025-02-06 19:11:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 19:11:13,205 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2025-02-06 19:11:13,205 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-02-06 19:11:13,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 89 transitions. [2025-02-06 19:11:13,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:13,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:13,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:13,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:13,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:13,206 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:13,206 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:13,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1575812327, now seen corresponding path program 15 times [2025-02-06 19:11:13,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:13,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748638080] [2025-02-06 19:11:13,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:13,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:13,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 9 equivalence classes. [2025-02-06 19:11:13,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 19:11:13,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-06 19:11:13,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:13,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:13,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 19:11:13,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 19:11:13,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:13,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:13,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 15 times [2025-02-06 19:11:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:13,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70095627] [2025-02-06 19:11:13,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:13,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:13,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:13,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:13,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:11:13,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:13,257 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:13,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:13,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:13,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:13,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:13,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1767809528, now seen corresponding path program 7 times [2025-02-06 19:11:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:13,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224456289] [2025-02-06 19:11:13,259 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:13,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 19:11:13,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 19:11:13,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:13,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:13,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 19:11:13,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 19:11:13,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:13,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:16,773 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:16,774 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:16,774 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:16,774 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:16,774 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:16,774 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:16,774 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:16,774 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:16,774 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration19_Lasso [2025-02-06 19:11:16,774 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:16,774 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:16,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:16,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:17,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:17,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:17,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:17,782 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:17,782 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:17,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,784 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-02-06 19:11:17,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:17,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:17,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:17,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:17,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:17,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-02-06 19:11:17,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,806 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-02-06 19:11:17,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:17,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:17,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:17,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:17,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:17,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:17,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,829 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-02-06 19:11:17,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:17,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:17,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:17,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:17,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-02-06 19:11:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,854 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-02-06 19:11:17,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:17,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:17,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:17,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:17,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:17,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:17,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,875 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-02-06 19:11:17,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:17,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:17,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:17,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:17,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:17,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:17,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,897 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-02-06 19:11:17,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:17,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:17,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:17,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:17,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:17,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:17,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,918 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-02-06 19:11:17,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:17,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:17,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:17,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:17,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:17,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:17,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,940 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-02-06 19:11:17,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-02-06 19:11:17,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:17,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:17,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:17,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:17,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-02-06 19:11:17,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,964 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-02-06 19:11:17,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:17,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:17,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:17,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:17,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-02-06 19:11:17,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:17,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:17,986 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:17,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-02-06 19:11:17,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:17,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:17,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:17,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:17,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:17,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:17,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:17,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:17,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,012 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-02-06 19:11:18,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-02-06 19:11:18,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:18,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:18,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:18,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,033 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-02-06 19:11:18,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:18,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,056 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-02-06 19:11:18,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-02-06 19:11:18,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,087 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-02-06 19:11:18,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:18,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,116 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-02-06 19:11:18,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-02-06 19:11:18,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,142 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-02-06 19:11:18,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:18,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,170 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-02-06 19:11:18,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-02-06 19:11:18,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-02-06 19:11:18,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,197 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-02-06 19:11:18,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:18,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-02-06 19:11:18,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,251 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-02-06 19:11:18,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:18,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,275 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-02-06 19:11:18,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:18,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-02-06 19:11:18,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,305 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-02-06 19:11:18,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-02-06 19:11:18,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,332 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-02-06 19:11:18,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:18,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-02-06 19:11:18,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,359 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-02-06 19:11:18,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:18,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,385 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-02-06 19:11:18,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:18,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:18,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:18,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:18,413 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-02-06 19:11:18,413 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:11:18,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,415 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:18,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-02-06 19:11:18,416 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:18,427 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:18,427 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:18,427 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1 Supporting invariants [] [2025-02-06 19:11:18,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,495 INFO L156 tatePredicateManager]: 32 out of 33 supporting invariants were superfluous and have been removed [2025-02-06 19:11:18,497 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:18,497 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:18,497 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:11:18,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:18,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 19:11:18,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 19:11:18,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:18,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:18,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:18,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:18,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:18,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:18,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:18,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:18,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:18,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:18,794 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-02-06 19:11:18,794 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:18,826 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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 71 states and 91 transitions. Complement of second has 5 states. [2025-02-06 19:11:18,826 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-02-06 19:11:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-06 19:11:18,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 59 letters. Loop has 2 letters. [2025-02-06 19:11:18,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:18,827 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:18,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:18,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 19:11:18,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 19:11:18,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:18,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:18,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:18,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:19,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:19,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:19,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:19,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:19,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:19,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:19,137 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2025-02-06 19:11:19,138 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:19,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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 71 states and 91 transitions. Complement of second has 5 states. [2025-02-06 19:11:19,168 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-02-06 19:11:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-06 19:11:19,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 59 letters. Loop has 2 letters. [2025-02-06 19:11:19,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:19,168 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:19,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:19,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 19:11:19,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 19:11:19,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:19,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:19,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:19,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:19,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-02-06 19:11:19,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:19,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:19,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:19,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:19,506 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-02-06 19:11:19,506 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29 Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:19,681 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 89 transitions. cyclomatic complexity: 29. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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 91 states and 120 transitions. Complement of second has 23 states. [2025-02-06 19:11:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2025-02-06 19:11:19,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 68 transitions. Stem has 59 letters. Loop has 2 letters. [2025-02-06 19:11:19,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:19,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 68 transitions. Stem has 61 letters. Loop has 2 letters. [2025-02-06 19:11:19,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:19,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 68 transitions. Stem has 59 letters. Loop has 4 letters. [2025-02-06 19:11:19,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:19,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 120 transitions. [2025-02-06 19:11:19,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:19,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 86 states and 113 transitions. [2025-02-06 19:11:19,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:11:19,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:11:19,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 113 transitions. [2025-02-06 19:11:19,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:19,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 113 transitions. [2025-02-06 19:11:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 113 transitions. [2025-02-06 19:11:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2025-02-06 19:11:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 74 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2025-02-06 19:11:19,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 95 transitions. [2025-02-06 19:11:19,684 INFO L432 stractBuchiCegarLoop]: Abstraction has 75 states and 95 transitions. [2025-02-06 19:11:19,684 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-02-06 19:11:19,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 95 transitions. [2025-02-06 19:11:19,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:19,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:19,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:19,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:19,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:19,685 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:19,686 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:19,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1942093634, now seen corresponding path program 16 times [2025-02-06 19:11:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:19,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436346371] [2025-02-06 19:11:19,686 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:19,691 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-02-06 19:11:19,696 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 61 of 63 statements. [2025-02-06 19:11:19,697 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:11:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 91 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:19,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436346371] [2025-02-06 19:11:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436346371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804558966] [2025-02-06 19:11:19,938 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,942 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:11:19,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-02-06 19:11:19,998 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-02-06 19:11:20,013 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 61 of 63 statements. [2025-02-06 19:11:20,013 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:11:20,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:20,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:11:20,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 120 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:20,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 120 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804558966] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:20,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:20,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2025-02-06 19:11:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502997662] [2025-02-06 19:11:20,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:20,614 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:20,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 16 times [2025-02-06 19:11:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:20,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647501284] [2025-02-06 19:11:20,614 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:20,617 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:11:20,622 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:20,623 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:20,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:20,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:20,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:20,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:20,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:20,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:20,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:20,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 19:11:20,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2025-02-06 19:11:20,674 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. cyclomatic complexity: 31 Second operand has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 31 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:20,902 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2025-02-06 19:11:20,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 151 transitions. [2025-02-06 19:11:20,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:20,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 80 states and 102 transitions. [2025-02-06 19:11:20,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:20,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:11:20,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 102 transitions. [2025-02-06 19:11:20,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:20,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 102 transitions. [2025-02-06 19:11:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 102 transitions. [2025-02-06 19:11:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-02-06 19:11:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 77 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2025-02-06 19:11:20,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-02-06 19:11:20,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 19:11:20,913 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-02-06 19:11:20,913 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-02-06 19:11:20,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 99 transitions. [2025-02-06 19:11:20,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:20,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:20,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:20,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:20,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:20,914 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:20,914 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:20,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:20,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2138073186, now seen corresponding path program 17 times [2025-02-06 19:11:20,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:20,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939002400] [2025-02-06 19:11:20,915 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:20,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:20,927 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 10 equivalence classes. [2025-02-06 19:11:20,976 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:11:20,977 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-02-06 19:11:20,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:20,977 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:20,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 19:11:20,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:11:20,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:20,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:20,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:20,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 17 times [2025-02-06 19:11:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:20,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365832504] [2025-02-06 19:11:20,991 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:20,993 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:20,993 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:20,993 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:20,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:20,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:20,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:20,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:20,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:20,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:20,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:20,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1693963971, now seen corresponding path program 8 times [2025-02-06 19:11:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962860120] [2025-02-06 19:11:20,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:21,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 19:11:21,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 19:11:21,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:21,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:21,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 19:11:21,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 19:11:21,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:25,095 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:25,095 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:25,095 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:25,095 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:25,095 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:25,095 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,095 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:25,095 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:25,096 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration21_Lasso [2025-02-06 19:11:25,096 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:25,096 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:25,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,522 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:25,522 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:25,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,524 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-02-06 19:11:25,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,549 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-02-06 19:11:25,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-02-06 19:11:25,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,570 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-02-06 19:11:25,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,595 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-02-06 19:11:25,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,621 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-02-06 19:11:25,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,644 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-02-06 19:11:25,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-02-06 19:11:25,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,665 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-02-06 19:11:25,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,685 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-02-06 19:11:25,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,708 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-02-06 19:11:25,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,730 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-02-06 19:11:25,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-02-06 19:11:25,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,751 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-02-06 19:11:25,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,772 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-02-06 19:11:25,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,793 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-02-06 19:11:25,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-02-06 19:11:25,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,813 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-02-06 19:11:25,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-02-06 19:11:25,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,832 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-02-06 19:11:25,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-02-06 19:11:25,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,853 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-02-06 19:11:25,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,879 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-02-06 19:11:25,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-02-06 19:11:25,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-02-06 19:11:25,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,901 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-02-06 19:11:25,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-02-06 19:11:25,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,923 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-02-06 19:11:25,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-02-06 19:11:25,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,946 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-02-06 19:11:25,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:25,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-02-06 19:11:25,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,971 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-02-06 19:11:25,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-02-06 19:11:25,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:25,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:25,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:25,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,996 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:25,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-02-06 19:11:25,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-02-06 19:11:26,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:26,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:26,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,023 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:26,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-02-06 19:11:26,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:26,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:26,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:26,042 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:26,051 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:11:26,051 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-06 19:11:26,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,053 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:26,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-02-06 19:11:26,055 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:26,065 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:26,065 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:26,065 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 32)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 32)_1 Supporting invariants [] [2025-02-06 19:11:26,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-02-06 19:11:26,092 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2025-02-06 19:11:26,094 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:26,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:26,097 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:11:26,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:26,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 19:11:26,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:11:26,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:26,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:26,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:11:26,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:26,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-02-06 19:11:26,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:26,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:26,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:26,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:26,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:26,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:26,502 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-02-06 19:11:26,505 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32 Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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-02-06 19:11:26,539 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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) Result 79 states and 101 transitions. Complement of second has 5 states. [2025-02-06 19:11:26,540 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-02-06 19:11:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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-02-06 19:11:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-06 19:11:26,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 66 letters. Loop has 2 letters. [2025-02-06 19:11:26,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:26,540 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:26,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:26,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 19:11:26,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:11:26,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:26,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:26,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:11:26,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:26,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:26,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:26,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:26,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:26,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:26,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:26,879 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2025-02-06 19:11:26,879 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32 Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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-02-06 19:11:26,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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) Result 79 states and 101 transitions. Complement of second has 5 states. [2025-02-06 19:11:26,922 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-02-06 19:11:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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-02-06 19:11:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-06 19:11:26,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 66 letters. Loop has 2 letters. [2025-02-06 19:11:26,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:26,923 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:26,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:26,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 19:11:26,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:11:26,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:26,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:26,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:11:26,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:27,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:27,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:27,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:27,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:27,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:27,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:27,274 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-02-06 19:11:27,275 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32 Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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-02-06 19:11:27,478 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 32. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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) Result 100 states and 132 transitions. Complement of second has 25 states. [2025-02-06 19:11:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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-02-06 19:11:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2025-02-06 19:11:27,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 74 transitions. Stem has 66 letters. Loop has 2 letters. [2025-02-06 19:11:27,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:27,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 74 transitions. Stem has 68 letters. Loop has 2 letters. [2025-02-06 19:11:27,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:27,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 74 transitions. Stem has 66 letters. Loop has 4 letters. [2025-02-06 19:11:27,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:27,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 132 transitions. [2025-02-06 19:11:27,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:27,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 95 states and 125 transitions. [2025-02-06 19:11:27,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:11:27,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:11:27,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 125 transitions. [2025-02-06 19:11:27,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:27,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 125 transitions. [2025-02-06 19:11:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 125 transitions. [2025-02-06 19:11:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2025-02-06 19:11:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 82 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2025-02-06 19:11:27,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 105 transitions. [2025-02-06 19:11:27,485 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 105 transitions. [2025-02-06 19:11:27,485 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-02-06 19:11:27,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 105 transitions. [2025-02-06 19:11:27,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:27,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:27,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:27,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:27,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:27,486 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:27,486 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:27,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -106771773, now seen corresponding path program 18 times [2025-02-06 19:11:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036302927] [2025-02-06 19:11:27,487 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:27,492 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 10 equivalence classes. [2025-02-06 19:11:27,541 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:11:27,541 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-02-06 19:11:27,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 120 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:27,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:27,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036302927] [2025-02-06 19:11:27,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036302927] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:27,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612380427] [2025-02-06 19:11:27,853 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:27,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,857 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:11:27,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2025-02-06 19:11:27,917 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 10 equivalence classes. [2025-02-06 19:11:27,987 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:11:27,987 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-02-06 19:11:27,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:27,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:27,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 153 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:28,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 153 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612380427] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:28,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:28,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2025-02-06 19:11:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784192011] [2025-02-06 19:11:28,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:28,466 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:28,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 18 times [2025-02-06 19:11:28,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:28,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468551683] [2025-02-06 19:11:28,466 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:28,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:28,471 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:28,471 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:28,471 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:11:28,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:28,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:28,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:28,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:28,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 19:11:28,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 19:11:28,499 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. cyclomatic complexity: 34 Second operand has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 34 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:28,637 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2025-02-06 19:11:28,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 167 transitions. [2025-02-06 19:11:28,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:28,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 88 states and 112 transitions. [2025-02-06 19:11:28,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:28,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:11:28,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 112 transitions. [2025-02-06 19:11:28,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:28,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 112 transitions. [2025-02-06 19:11:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 112 transitions. [2025-02-06 19:11:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-02-06 19:11:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 85 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2025-02-06 19:11:28,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 109 transitions. [2025-02-06 19:11:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 19:11:28,643 INFO L432 stractBuchiCegarLoop]: Abstraction has 86 states and 109 transitions. [2025-02-06 19:11:28,643 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-02-06 19:11:28,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 109 transitions. [2025-02-06 19:11:28,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:28,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:28,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:28,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:28,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:28,643 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:28,644 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:28,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1920747549, now seen corresponding path program 19 times [2025-02-06 19:11:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921216962] [2025-02-06 19:11:28,644 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:28,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 19:11:28,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 19:11:28,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:28,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 19:11:28,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 19:11:28,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:28,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 19 times [2025-02-06 19:11:28,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:28,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234721430] [2025-02-06 19:11:28,678 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:28,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:28,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:28,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:28,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:28,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:28,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:28,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash 997542978, now seen corresponding path program 9 times [2025-02-06 19:11:28,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:28,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093577098] [2025-02-06 19:11:28,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:28,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 11 equivalence classes. [2025-02-06 19:11:28,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 19:11:28,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 19:11:28,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:28,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 19:11:28,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 19:11:28,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:38,270 WARN L286 SmtUtils]: Spent 9.46s on a formula simplification. DAG size of input: 330 DAG size of output: 242 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:11:39,165 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:39,165 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:39,165 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:39,165 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:39,165 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:39,165 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:39,165 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:39,165 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:39,165 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration23_Lasso [2025-02-06 19:11:39,165 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:39,165 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:39,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:39,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:41,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:42,021 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:42,021 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:42,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,024 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-02-06 19:11:42,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,071 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-02-06 19:11:42,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-02-06 19:11:42,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,095 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-02-06 19:11:42,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-02-06 19:11:42,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,118 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-02-06 19:11:42,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-02-06 19:11:42,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,139 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-02-06 19:11:42,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,164 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-02-06 19:11:42,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,187 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-02-06 19:11:42,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,208 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-02-06 19:11:42,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,233 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-02-06 19:11:42,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,254 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-02-06 19:11:42,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,279 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-02-06 19:11:42,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,301 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-02-06 19:11:42,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,325 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-02-06 19:11:42,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:42,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:42,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:42,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,353 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-02-06 19:11:42,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-02-06 19:11:42,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,378 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-02-06 19:11:42,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,404 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-02-06 19:11:42,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,426 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-02-06 19:11:42,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,453 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-02-06 19:11:42,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,479 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-02-06 19:11:42,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,513 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-02-06 19:11:42,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,546 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-02-06 19:11:42,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:42,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-02-06 19:11:42,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,600 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-02-06 19:11:42,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:42,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:42,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:42,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:42,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:42,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:42,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:42,621 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:42,630 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-06 19:11:42,630 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:11:42,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:42,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:42,635 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:11:42,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-02-06 19:11:42,640 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:42,660 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:42,660 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:42,660 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 36))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 36))_1 Supporting invariants [] [2025-02-06 19:11:42,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:42,744 INFO L156 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed [2025-02-06 19:11:42,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:42,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:42,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:11:42,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:42,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 19:11:42,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 19:11:42,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:42,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:42,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:42,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:43,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:43,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:43,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:43,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:43,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:43,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:43,119 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-02-06 19:11:43,119 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35 Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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-02-06 19:11:43,144 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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) Result 87 states and 111 transitions. Complement of second has 4 states. [2025-02-06 19:11:43,145 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-02-06 19:11:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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-02-06 19:11:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:11:43,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 73 letters. Loop has 2 letters. [2025-02-06 19:11:43,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:43,146 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:43,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:43,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 19:11:43,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 19:11:43,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:43,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:43,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:43,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:43,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:43,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:43,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:43,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:43,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:43,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:43,400 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2025-02-06 19:11:43,401 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35 Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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-02-06 19:11:43,422 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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) Result 87 states and 111 transitions. Complement of second has 4 states. [2025-02-06 19:11:43,422 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-02-06 19:11:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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-02-06 19:11:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:11:43,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 73 letters. Loop has 2 letters. [2025-02-06 19:11:43,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:43,423 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:43,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 19:11:43,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 19:11:43,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:43,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:43,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:43,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:43,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:43,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:43,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:43,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:43,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:43,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:43,678 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-02-06 19:11:43,678 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35 Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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-02-06 19:11:43,896 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 109 transitions. cyclomatic complexity: 35. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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) Result 109 states and 144 transitions. Complement of second has 26 states. [2025-02-06 19:11:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 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-02-06 19:11:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2025-02-06 19:11:43,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 73 letters. Loop has 2 letters. [2025-02-06 19:11:43,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:43,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 75 letters. Loop has 2 letters. [2025-02-06 19:11:43,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:43,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 80 transitions. Stem has 73 letters. Loop has 4 letters. [2025-02-06 19:11:43,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:43,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 144 transitions. [2025-02-06 19:11:43,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:43,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 104 states and 137 transitions. [2025-02-06 19:11:43,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:11:43,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:11:43,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 137 transitions. [2025-02-06 19:11:43,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:43,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 137 transitions. [2025-02-06 19:11:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 137 transitions. [2025-02-06 19:11:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2025-02-06 19:11:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 90 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2025-02-06 19:11:43,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 115 transitions. [2025-02-06 19:11:43,900 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 115 transitions. [2025-02-06 19:11:43,900 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-02-06 19:11:43,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 115 transitions. [2025-02-06 19:11:43,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:43,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:43,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:43,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:43,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:43,901 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:43,901 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 861094024, now seen corresponding path program 20 times [2025-02-06 19:11:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:43,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677211677] [2025-02-06 19:11:43,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:43,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 19:11:43,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:11:43,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:43,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:43,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-02-06 19:11:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 153 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:44,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:44,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677211677] [2025-02-06 19:11:44,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677211677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:44,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135816471] [2025-02-06 19:11:44,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:44,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:44,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,208 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:11:44,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2025-02-06 19:11:44,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 19:11:44,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:11:44,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:44,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:44,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:11:44,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 190 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:44,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 190 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:44,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135816471] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:44,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:44,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2025-02-06 19:11:44,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111213896] [2025-02-06 19:11:44,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:44,823 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:44,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 20 times [2025-02-06 19:11:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722568983] [2025-02-06 19:11:44,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:44,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:44,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:44,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:44,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:44,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:44,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:44,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:44,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:44,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:44,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:44,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:44,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 19:11:44,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1017, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 19:11:44,854 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. cyclomatic complexity: 37 Second operand has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:45,018 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2025-02-06 19:11:45,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 183 transitions. [2025-02-06 19:11:45,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:45,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 96 states and 122 transitions. [2025-02-06 19:11:45,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:45,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:11:45,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 122 transitions. [2025-02-06 19:11:45,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:45,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 122 transitions. [2025-02-06 19:11:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 122 transitions. [2025-02-06 19:11:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-02-06 19:11:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 93 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2025-02-06 19:11:45,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 119 transitions. [2025-02-06 19:11:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 19:11:45,024 INFO L432 stractBuchiCegarLoop]: Abstraction has 94 states and 119 transitions. [2025-02-06 19:11:45,025 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-02-06 19:11:45,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 119 transitions. [2025-02-06 19:11:45,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:45,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:45,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:45,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:45,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:45,026 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:11:45,026 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:11:45,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:45,026 INFO L85 PathProgramCache]: Analyzing trace with hash -165458072, now seen corresponding path program 21 times [2025-02-06 19:11:45,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:45,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996709155] [2025-02-06 19:11:45,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:45,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:45,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 12 equivalence classes. [2025-02-06 19:11:45,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 19:11:45,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-06 19:11:45,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:45,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:45,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 19:11:45,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 19:11:45,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:45,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:45,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:45,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 21 times [2025-02-06 19:11:45,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:45,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276173911] [2025-02-06 19:11:45,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:45,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:45,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:45,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:45,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:11:45,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:45,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:45,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:45,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:45,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:45,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:45,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:45,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:45,101 INFO L85 PathProgramCache]: Analyzing trace with hash -91416953, now seen corresponding path program 10 times [2025-02-06 19:11:45,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:45,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452797522] [2025-02-06 19:11:45,102 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:45,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:45,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 82 statements into 2 equivalence classes. [2025-02-06 19:11:45,153 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 19:11:45,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:45,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:45,153 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:45,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 19:11:45,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 19:11:45,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:45,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:45,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:56,432 WARN L286 SmtUtils]: Spent 11.22s on a formula simplification. DAG size of input: 359 DAG size of output: 263 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:11:57,957 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:57,957 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:57,957 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:57,957 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:57,957 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:57,957 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:57,957 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:57,957 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:57,958 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration25_Lasso [2025-02-06 19:11:57,958 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:57,958 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:57,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:57,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:57,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:57,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:57,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:57,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:57,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:57,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:01,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:01,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:01,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:01,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:01,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:01,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:01,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:01,420 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:01,420 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:12:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,422 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-02-06 19:12:01,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:01,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:01,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-02-06 19:12:01,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,447 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-02-06 19:12:01,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:01,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:01,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:01,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-02-06 19:12:01,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,467 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-02-06 19:12:01,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:01,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:01,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:01,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,488 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-02-06 19:12:01,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:01,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:01,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:01,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-02-06 19:12:01,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,508 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-02-06 19:12:01,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:01,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:01,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:01,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:01,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,527 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-02-06 19:12:01,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:01,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:01,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:01,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:01,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,547 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-02-06 19:12:01,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:01,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:01,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:01,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:01,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,567 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-02-06 19:12:01,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:01,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:01,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:01,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,588 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-02-06 19:12:01,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:01,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:01,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:01,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,613 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-02-06 19:12:01,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:01,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:01,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-02-06 19:12:01,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,638 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-02-06 19:12:01,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:01,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:01,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:01,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,663 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-02-06 19:12:01,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:01,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:01,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-02-06 19:12:01,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,692 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-02-06 19:12:01,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:01,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:01,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:01,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:01,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,716 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-02-06 19:12:01,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:01,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:01,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:01,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:01,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:01,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:01,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:01,733 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:12:01,740 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-06 19:12:01,740 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-02-06 19:12:01,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:01,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:01,742 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:01,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-02-06 19:12:01,744 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:12:01,754 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:12:01,755 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:12:01,755 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 40 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 40 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2025-02-06 19:12:01,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:01,848 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2025-02-06 19:12:01,849 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:12:01,849 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:12:01,849 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:12:01,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:01,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 19:12:01,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 19:12:01,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:01,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:01,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:12:01,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:02,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:02,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:02,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:02,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:02,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:12:02,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:02,128 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-02-06 19:12:02,128 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38 Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:02,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 95 states and 121 transitions. Complement of second has 4 states. [2025-02-06 19:12:02,159 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-02-06 19:12:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:12:02,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 80 letters. Loop has 2 letters. [2025-02-06 19:12:02,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:02,159 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:12:02,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:02,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 19:12:02,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 19:12:02,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:02,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:02,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:12:02,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:02,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:02,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:02,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:02,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:02,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:12:02,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:02,426 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2025-02-06 19:12:02,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38 Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:02,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:02,476 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 95 states and 121 transitions. Complement of second has 4 states. [2025-02-06 19:12:02,477 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-02-06 19:12:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:12:02,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 80 letters. Loop has 2 letters. [2025-02-06 19:12:02,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:02,477 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:12:02,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:02,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 19:12:02,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 19:12:02,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:02,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:02,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:12:02,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:02,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:02,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:02,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:02,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:02,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:12:02,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:02,773 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-02-06 19:12:02,773 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38 Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:03,148 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 119 transitions. cyclomatic complexity: 38. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 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 118 states and 156 transitions. Complement of second has 28 states. [2025-02-06 19:12:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:12:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2025-02-06 19:12:03,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 86 transitions. Stem has 80 letters. Loop has 2 letters. [2025-02-06 19:12:03,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:03,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 86 transitions. Stem has 82 letters. Loop has 2 letters. [2025-02-06 19:12:03,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:03,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 86 transitions. Stem has 80 letters. Loop has 4 letters. [2025-02-06 19:12:03,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:03,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 156 transitions. [2025-02-06 19:12:03,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:03,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 149 transitions. [2025-02-06 19:12:03,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:12:03,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:12:03,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 149 transitions. [2025-02-06 19:12:03,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:12:03,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 149 transitions. [2025-02-06 19:12:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 149 transitions. [2025-02-06 19:12:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2025-02-06 19:12:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 98 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2025-02-06 19:12:03,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 125 transitions. [2025-02-06 19:12:03,151 INFO L432 stractBuchiCegarLoop]: Abstraction has 99 states and 125 transitions. [2025-02-06 19:12:03,155 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-02-06 19:12:03,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 125 transitions. [2025-02-06 19:12:03,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:03,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:03,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:03,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:03,156 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:12:03,156 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:12:03,157 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:12:03,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1952346739, now seen corresponding path program 22 times [2025-02-06 19:12:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341640567] [2025-02-06 19:12:03,157 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:12:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:03,163 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 84 statements into 2 equivalence classes. [2025-02-06 19:12:03,168 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 82 of 84 statements. [2025-02-06 19:12:03,168 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:12:03,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 190 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:03,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:03,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341640567] [2025-02-06 19:12:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341640567] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:03,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688433282] [2025-02-06 19:12:03,466 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:12:03,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:03,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:03,468 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:03,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2025-02-06 19:12:03,542 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 84 statements into 2 equivalence classes. [2025-02-06 19:12:03,563 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 82 of 84 statements. [2025-02-06 19:12:03,563 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:12:03,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:03,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 19:12:03,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 231 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:03,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 231 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688433282] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:04,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2025-02-06 19:12:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382724016] [2025-02-06 19:12:04,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:04,183 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:04,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 22 times [2025-02-06 19:12:04,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:04,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91623581] [2025-02-06 19:12:04,183 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:12:04,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:04,186 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:12:04,187 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:04,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:12:04,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:04,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:04,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:04,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:04,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:04,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:04,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:04,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:04,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 19:12:04,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 19:12:04,216 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. cyclomatic complexity: 40 Second operand has 40 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 40 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:04,389 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2025-02-06 19:12:04,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 199 transitions. [2025-02-06 19:12:04,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:04,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 104 states and 132 transitions. [2025-02-06 19:12:04,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:12:04,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:12:04,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 132 transitions. [2025-02-06 19:12:04,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:12:04,390 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 132 transitions. [2025-02-06 19:12:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 132 transitions. [2025-02-06 19:12:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-02-06 19:12:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 101 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-02-06 19:12:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 129 transitions. [2025-02-06 19:12:04,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 129 transitions. [2025-02-06 19:12:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 19:12:04,393 INFO L432 stractBuchiCegarLoop]: Abstraction has 102 states and 129 transitions. [2025-02-06 19:12:04,393 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-02-06 19:12:04,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 129 transitions. [2025-02-06 19:12:04,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:04,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:04,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:04,393 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:04,393 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:12:04,393 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:12:04,394 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:12:04,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash 877462189, now seen corresponding path program 23 times [2025-02-06 19:12:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:04,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949203763] [2025-02-06 19:12:04,394 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:12:04,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:04,400 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 87 statements into 13 equivalence classes. [2025-02-06 19:12:04,434 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 19:12:04,434 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-02-06 19:12:04,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:04,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:04,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 19:12:04,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 19:12:04,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:04,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:04,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:04,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:04,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 23 times [2025-02-06 19:12:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:04,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678621106] [2025-02-06 19:12:04,452 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:12:04,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:04,454 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:04,455 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:04,455 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:04,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:04,455 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:04,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:04,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:04,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:04,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:04,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:04,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1427573900, now seen corresponding path program 11 times [2025-02-06 19:12:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897536516] [2025-02-06 19:12:04,458 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:12:04,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:04,465 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 89 statements into 13 equivalence classes. [2025-02-06 19:12:04,500 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 19:12:04,500 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-02-06 19:12:04,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:04,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:04,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 19:12:04,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 19:12:04,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:04,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:04,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:23,962 WARN L286 SmtUtils]: Spent 19.42s on a formula simplification. DAG size of input: 388 DAG size of output: 281 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:12:24,494 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:24,494 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:24,494 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:24,494 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:24,494 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:12:24,494 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:24,494 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:24,494 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:24,494 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration27_Lasso [2025-02-06 19:12:24,494 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:24,494 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:24,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:24,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:24,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:24,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:26,486 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:26,486 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:12:26,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,488 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-02-06 19:12:26,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-02-06 19:12:26,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,514 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-02-06 19:12:26,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:26,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:26,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:26,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-02-06 19:12:26,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,535 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-02-06 19:12:26,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:26,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:26,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:26,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-02-06 19:12:26,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,555 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-02-06 19:12:26,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-02-06 19:12:26,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,579 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-02-06 19:12:26,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-02-06 19:12:26,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,604 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-02-06 19:12:26,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:26,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,629 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-02-06 19:12:26,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:26,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,652 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-02-06 19:12:26,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:26,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,678 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-02-06 19:12:26,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:26,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,704 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-02-06 19:12:26,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-02-06 19:12:26,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,733 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-02-06 19:12:26,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:26,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-02-06 19:12:26,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,760 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-02-06 19:12:26,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:26,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:26,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:26,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:26,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:26,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:26,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:26,779 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:12:26,791 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-02-06 19:12:26,791 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:12:26,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:26,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:26,793 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:26,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-02-06 19:12:26,798 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:12:26,812 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:12:26,812 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:12:26,812 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 44)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 44)_1 Supporting invariants [] [2025-02-06 19:12:26,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:26,916 INFO L156 tatePredicateManager]: 48 out of 49 supporting invariants were superfluous and have been removed [2025-02-06 19:12:26,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:12:26,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:12:26,917 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-06 19:12:26,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:26,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 19:12:26,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 19:12:26,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:26,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:26,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 19:12:26,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:27,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:27,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:27,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:27,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:27,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:12:27,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:27,280 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2025-02-06 19:12:27,280 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41 Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:27,310 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 103 states and 131 transitions. Complement of second has 5 states. [2025-02-06 19:12:27,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:12:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-06 19:12:27,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 87 letters. Loop has 2 letters. [2025-02-06 19:12:27,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:27,311 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:12:27,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:27,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 19:12:27,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-02-06 19:12:27,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 19:12:27,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:27,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:27,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 19:12:27,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:27,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:27,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:27,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:27,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:27,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:12:27,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:27,712 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.14 stem predicates 2 loop predicates [2025-02-06 19:12:27,712 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41 Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:27,751 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 103 states and 131 transitions. Complement of second has 5 states. [2025-02-06 19:12:27,752 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-02-06 19:12:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-06 19:12:27,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 87 letters. Loop has 2 letters. [2025-02-06 19:12:27,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:27,752 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:12:27,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:27,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 19:12:27,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 19:12:27,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:27,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:27,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 19:12:27,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:28,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:28,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:28,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:28,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:28,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:12:28,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:28,328 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2025-02-06 19:12:28,328 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41 Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:28,669 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 129 transitions. cyclomatic complexity: 41. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 127 states and 168 transitions. Complement of second has 31 states. [2025-02-06 19:12:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 14 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:12:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 92 transitions. [2025-02-06 19:12:28,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 92 transitions. Stem has 87 letters. Loop has 2 letters. [2025-02-06 19:12:28,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:28,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 92 transitions. Stem has 89 letters. Loop has 2 letters. [2025-02-06 19:12:28,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:28,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 92 transitions. Stem has 87 letters. Loop has 4 letters. [2025-02-06 19:12:28,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:28,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 168 transitions. [2025-02-06 19:12:28,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:28,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 122 states and 161 transitions. [2025-02-06 19:12:28,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:12:28,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:12:28,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 161 transitions. [2025-02-06 19:12:28,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:12:28,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 161 transitions. [2025-02-06 19:12:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 161 transitions. [2025-02-06 19:12:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2025-02-06 19:12:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 106 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 135 transitions. [2025-02-06 19:12:28,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 135 transitions. [2025-02-06 19:12:28,673 INFO L432 stractBuchiCegarLoop]: Abstraction has 107 states and 135 transitions. [2025-02-06 19:12:28,673 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-02-06 19:12:28,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 135 transitions. [2025-02-06 19:12:28,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:28,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:28,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:28,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2025-02-06 19:12:28,674 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:12:28,674 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~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~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_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < main_~length~0#1;havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;" "assume !(main_~val~0#1 < 0);" "call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#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~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;" "main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-02-06 19:12:28,678 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem6#1 > 0;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1;" [2025-02-06 19:12:28,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949650, now seen corresponding path program 24 times [2025-02-06 19:12:28,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:28,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960055557] [2025-02-06 19:12:28,678 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:12:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:28,686 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 13 equivalence classes. [2025-02-06 19:12:28,709 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 19:12:28,709 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-02-06 19:12:28,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 231 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960055557] [2025-02-06 19:12:29,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960055557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358424306] [2025-02-06 19:12:29,132 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:12:29,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:29,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:29,137 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:29,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Waiting until timeout for monitored process [2025-02-06 19:12:29,220 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 13 equivalence classes. [2025-02-06 19:12:29,380 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 19:12:29,380 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-02-06 19:12:29,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:29,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 19:12:29,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 276 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:29,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 276 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358424306] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:30,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2025-02-06 19:12:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032636944] [2025-02-06 19:12:30,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:30,074 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:30,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 24 times [2025-02-06 19:12:30,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:30,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264619923] [2025-02-06 19:12:30,074 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:12:30,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:30,079 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:30,080 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:30,080 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:12:30,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:30,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:30,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:30,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:30,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:30,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:30,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:30,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:30,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-06 19:12:30,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1383, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 19:12:30,132 INFO L87 Difference]: Start difference. First operand 107 states and 135 transitions. cyclomatic complexity: 43 Second operand has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)