./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/lis-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/lis-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 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:11:18,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:11:18,242 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:11:18,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:11:18,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:11:18,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:11:18,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:11:18,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:11:18,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:11:18,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:11:18,273 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:11:18,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:11:18,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:11:18,274 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:11:18,274 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:11:18,274 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:11:18,274 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:11:18,275 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:11:18,276 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:11:18,276 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:11:18,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:11:18,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:11:18,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:11:18,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:11:18,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:11:18,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:11:18,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:11:18,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:11:18,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:11:18,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:11:18,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:11:18,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:11:18,277 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:11:18,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:11:18,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:11:18,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:11:18,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:11:18,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:11:18,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:11:18,278 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:11:18,278 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2025-02-06 19:11:18,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:11:18,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:11:18,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:11:18,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:11:18,587 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:11:18,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2025-02-06 19:11:19,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e72d457cb/bc4553cedc1a4f49b89be5186800f8e8/FLAG1519152d0 [2025-02-06 19:11:20,265 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:11:20,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2025-02-06 19:11:20,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e72d457cb/bc4553cedc1a4f49b89be5186800f8e8/FLAG1519152d0 [2025-02-06 19:11:20,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e72d457cb/bc4553cedc1a4f49b89be5186800f8e8 [2025-02-06 19:11:20,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:11:20,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:11:20,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:11:20,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:11:20,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:11:20,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db62278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20, skipping insertion in model container [2025-02-06 19:11:20,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:11:20,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:11:20,782 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:11:20,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:11:20,854 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:11:20,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20 WrapperNode [2025-02-06 19:11:20,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:11:20,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:11:20,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:11:20,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:11:20,862 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:11:20" (1/1) ... [2025-02-06 19:11:20,876 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:11:20" (1/1) ... [2025-02-06 19:11:20,900 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-02-06 19:11:20,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:11:20,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:11:20,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:11:20,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:11:20,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,924 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [3, 7, 2]. 58 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [1, 2, 2]. [2025-02-06 19:11:20,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:11:20,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:11:20,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:11:20,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:11:20,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (1/1) ... [2025-02-06 19:11:20,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:20,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:20,970 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:11:20,972 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:11:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:11:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:11:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 19:11:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:11:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:11:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 19:11:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:11:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:11:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:11:20,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:11:21,080 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:11:21,082 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:11:21,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_#t~ret20#1;call ULTIMATE.dealloc(main_#t~malloc17#1.base, main_#t~malloc17#1.offset);havoc main_#t~malloc17#1.base, main_#t~malloc17#1.offset; [2025-02-06 19:11:21,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: call ULTIMATE.dealloc(lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset);havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call ULTIMATE.dealloc(lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset);havoc lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset; [2025-02-06 19:11:21,276 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-06 19:11:21,277 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:11:21,286 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:11:21,287 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:11:21,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:11:21 BoogieIcfgContainer [2025-02-06 19:11:21,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:11:21,289 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:11:21,289 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:11:21,293 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:11:21,293 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:11:21,293 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:11:20" (1/3) ... [2025-02-06 19:11:21,294 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c88e6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:11:21, skipping insertion in model container [2025-02-06 19:11:21,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:11:21,294 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:11:20" (2/3) ... [2025-02-06 19:11:21,294 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c88e6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:11:21, skipping insertion in model container [2025-02-06 19:11:21,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:11:21,294 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:11:21" (3/3) ... [2025-02-06 19:11:21,295 INFO L363 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2025-02-06 19:11:21,336 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:11:21,337 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:11:21,338 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:11:21,338 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:11:21,338 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:11:21,338 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:11:21,338 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:11:21,338 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:11:21,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:21,357 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:11:21,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:21,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:21,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:11:21,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:11:21,365 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:11:21,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:21,367 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:11:21,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:21,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:21,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:11:21,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:11:21,372 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" [2025-02-06 19:11:21,374 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" [2025-02-06 19:11:21,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1784446, now seen corresponding path program 1 times [2025-02-06 19:11:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:21,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634481546] [2025-02-06 19:11:21,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:21,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:11:21,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:11:21,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:21,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:11:21,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:11:21,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:21,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2025-02-06 19:11:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:21,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272433388] [2025-02-06 19:11:21,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:21,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:21,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:21,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:21,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:21,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:21,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:21,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:21,552 INFO L85 PathProgramCache]: Analyzing trace with hash 55317849, now seen corresponding path program 1 times [2025-02-06 19:11:21,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:21,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708702726] [2025-02-06 19:11:21,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:21,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:11:21,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:11:21,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:21,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:11:21,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:11:21,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:21,910 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:21,910 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:21,911 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:21,911 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:21,911 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:21,912 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:21,912 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:21,912 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:21,912 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2025-02-06 19:11:21,913 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:21,913 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:21,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:21,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:21,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:21,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:21,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:21,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:21,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:21,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:21,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:21,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:22,426 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:22,430 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:22,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,435 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:11:22,437 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:11:22,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:22,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:22,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:22,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:22,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,472 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:11:22,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,475 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:11:22,478 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:11:22,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:22,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:22,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:22,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:22,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,503 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:11:22,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,506 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:11:22,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:11:22,513 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:11:22,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:22,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:22,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,537 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:11:22,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,540 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:11:22,542 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:11:22,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:22,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:22,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:22,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:22,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:11:22,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,572 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:11:22,574 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:11:22,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:22,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:22,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:22,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:22,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:11:22,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,601 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:11:22,603 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:11:22,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:22,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:22,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:22,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:22,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,633 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:11:22,636 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:11:22,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:22,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:22,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:22,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:22,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:11:22,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,666 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:11:22,669 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:11:22,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:22,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:22,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:22,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:22,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,697 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:11:22,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,699 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:11:22,701 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:11:22,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:22,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:22,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:22,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:11:22,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,730 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:11:22,733 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:11:22,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:22,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:22,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:22,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,770 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:11:22,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,772 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:11:22,773 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:11:22,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:22,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:22,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:22,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:22,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:22,792 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:11:22,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,794 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:11:22,796 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:11:22,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:22,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:22,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:22,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:22,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:22,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:22,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:22,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:22,873 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-06 19:11:22,875 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-02-06 19:11:22,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:22,883 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:11:22,884 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:11:22,885 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:22,900 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:22,900 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:22,901 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-02-06 19:11:22,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 19:11:22,920 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-02-06 19:11:22,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:22,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:11:22,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:11:22,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:22,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:22,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:11:22,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:22,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:22,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:22,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:22,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:22,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:11:22,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:22,997 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:23,025 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:11:23,027 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:23,061 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 30 transitions. Complement of second has 3 states. [2025-02-06 19:11:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-02-06 19:11:23,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2025-02-06 19:11:23,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:23,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 5 letters. Loop has 1 letters. [2025-02-06 19:11:23,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:23,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-06 19:11:23,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:23,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2025-02-06 19:11:23,080 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-06 19:11:23,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 26 transitions. [2025-02-06 19:11:23,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-02-06 19:11:23,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:11:23,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 26 transitions. [2025-02-06 19:11:23,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:11:23,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 26 transitions. [2025-02-06 19:11:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 26 transitions. [2025-02-06 19:11:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-02-06 19:11:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2025-02-06 19:11:23,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 24 transitions. [2025-02-06 19:11:23,109 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 24 transitions. [2025-02-06 19:11:23,109 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:11:23,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 24 transitions. [2025-02-06 19:11:23,110 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-06 19:11:23,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:23,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:23,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:11:23,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:11:23,111 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" [2025-02-06 19:11:23,111 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" [2025-02-06 19:11:23,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash 55317848, now seen corresponding path program 1 times [2025-02-06 19:11:23,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:23,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619249172] [2025-02-06 19:11:23,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:23,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:23,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:11:23,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:11:23,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:23,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:23,233 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:23,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:23,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619249172] [2025-02-06 19:11:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619249172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:11:23,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:11:23,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:11:23,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505811031] [2025-02-06 19:11:23,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:11:23,236 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:23,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:23,237 INFO L85 PathProgramCache]: Analyzing trace with hash 52, now seen corresponding path program 1 times [2025-02-06 19:11:23,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:23,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038727296] [2025-02-06 19:11:23,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:23,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:23,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:23,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:23,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:23,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:23,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:23,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:23,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:23,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:23,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:23,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:11:23,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:11:23,352 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. cyclomatic complexity: 13 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:23,366 INFO L93 Difference]: Finished difference Result 15 states and 23 transitions. [2025-02-06 19:11:23,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2025-02-06 19:11:23,366 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-06 19:11:23,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 23 transitions. [2025-02-06 19:11:23,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-02-06 19:11:23,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-06 19:11:23,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 23 transitions. [2025-02-06 19:11:23,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:11:23,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-02-06 19:11:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 23 transitions. [2025-02-06 19:11:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-06 19:11:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2025-02-06 19:11:23,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-02-06 19:11:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:11:23,369 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-02-06 19:11:23,369 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:11:23,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. [2025-02-06 19:11:23,370 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-06 19:11:23,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:23,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:23,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:11:23,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:11:23,370 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" [2025-02-06 19:11:23,370 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" [2025-02-06 19:11:23,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1714853341, now seen corresponding path program 1 times [2025-02-06 19:11:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128527240] [2025-02-06 19:11:23,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:23,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:23,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:23,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:23,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:23,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:23,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:23,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:23,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:23,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:23,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:23,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash 52, now seen corresponding path program 2 times [2025-02-06 19:11:23,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:23,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630535023] [2025-02-06 19:11:23,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:23,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:23,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:23,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:23,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:23,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:23,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:23,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:23,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:23,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:23,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1620846040, now seen corresponding path program 1 times [2025-02-06 19:11:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150966096] [2025-02-06 19:11:23,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:23,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:11:23,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:11:23,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:23,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:23,475 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:23,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:11:23,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:11:23,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:23,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:23,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:23,735 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:11:24,159 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:24,160 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:24,160 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:24,160 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:24,160 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:24,160 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:24,160 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:24,160 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:24,160 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2025-02-06 19:11:24,161 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:24,161 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:24,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:24,836 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:24,837 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:24,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:24,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:24,839 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:11:24,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:24,849 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:11:24,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:24,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:24,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:24,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:24,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:24,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:24,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:24,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:24,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:24,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:24,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:24,871 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:11:24,874 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:11:24,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:24,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:24,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:24,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:24,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:24,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:24,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:24,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:24,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:24,899 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:11:24,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:24,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:24,902 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:11:24,904 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:11:24,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:24,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:24,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:24,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:24,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:24,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:24,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:24,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:24,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:24,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:24,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:24,938 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:11:24,941 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:11:24,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:24,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:24,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:24,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:24,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:24,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:24,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:24,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:24,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:24,967 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:11:24,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:24,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:24,970 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:11:24,972 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:11:24,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:24,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:24,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:24,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:24,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:24,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:24,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:25,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:25,054 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-02-06 19:11:25,054 INFO L444 ModelExtractionUtils]: 6 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-02-06 19:11:25,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,057 INFO L229 MonitoredProcess]: Starting monitored process 20 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,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:11:25,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:25,077 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:11:25,077 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:25,077 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [-1*ULTIMATE.start_lis_~N#1 + 1 >= 0] [2025-02-06 19:11:25,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:11:25,136 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2025-02-06 19:11:25,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:25,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:25,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:25,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:25,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:25,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:11:25,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:25,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:25,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:25,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:25,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:25,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:11:25,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:25,242 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:25,242 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2025-02-06 19:11:25,242 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 23 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:25,308 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 23 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 35 transitions. Complement of second has 6 states. [2025-02-06 19:11:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 0 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-02-06 19:11:25,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2025-02-06 19:11:25,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:25,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2025-02-06 19:11:25,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:25,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-06 19:11:25,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:25,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 35 transitions. [2025-02-06 19:11:25,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-06 19:11:25,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 35 transitions. [2025-02-06 19:11:25,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-06 19:11:25,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:11:25,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 35 transitions. [2025-02-06 19:11:25,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:11:25,313 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2025-02-06 19:11:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 35 transitions. [2025-02-06 19:11:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-02-06 19:11:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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:11:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2025-02-06 19:11:25,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 29 transitions. [2025-02-06 19:11:25,317 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 29 transitions. [2025-02-06 19:11:25,317 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:11:25,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 29 transitions. [2025-02-06 19:11:25,318 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-02-06 19:11:25,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:25,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:25,319 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:25,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:25,320 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" [2025-02-06 19:11:25,320 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-06 19:11:25,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:25,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1620846039, now seen corresponding path program 1 times [2025-02-06 19:11:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:25,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271335516] [2025-02-06 19:11:25,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:25,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:11:25,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:11:25,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:25,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:11:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271335516] [2025-02-06 19:11:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271335516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:11:25,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:11:25,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:11:25,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844782489] [2025-02-06 19:11:25,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:11:25,434 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:25,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1562, now seen corresponding path program 1 times [2025-02-06 19:11:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:25,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347356590] [2025-02-06 19:11:25,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:25,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:25,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:25,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:25,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:25,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:25,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:25,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:25,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:25,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:25,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:25,466 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:25,466 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:25,466 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:25,466 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:25,466 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:11:25,466 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,466 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:25,466 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:25,467 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2025-02-06 19:11:25,467 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:25,467 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:25,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,518 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:25,518 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:11:25,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,523 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:11:25,526 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:11:25,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:11:25,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:11:25,549 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:11:25,549 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:11:25,555 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:11:25,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,557 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:11:25,559 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:11:25,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:11:25,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:11:25,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 19:11:25,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,580 INFO L229 MonitoredProcess]: Starting monitored process 23 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,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:11:25,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:11:25,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:11:25,604 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:11:25,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:11:25,608 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:25,608 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:25,608 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:25,608 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:25,608 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:25,608 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,608 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:25,608 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:25,608 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2025-02-06 19:11:25,608 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:25,608 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:25,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,673 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:25,673 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:25,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,675 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:11:25,677 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:11:25,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:25,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:25,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:25,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:25,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:25,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:25,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:25,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:25,696 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:11:25,696 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:11:25,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:25,698 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:11:25,699 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:11:25,700 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:25,700 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:11:25,700 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:25,700 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2025-02-06 19:11:25,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:11:25,706 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:11:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:25,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:11:25,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:11:25,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:25,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:25,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:11:25,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:25,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:25,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:25,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:25,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:25,756 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:11:25,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:25,768 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:25,769 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:11:25,769 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 29 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:25,810 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 29 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 58 transitions. Complement of second has 7 states. [2025-02-06 19:11:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-02-06 19:11:25,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-06 19:11:25,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:25,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2025-02-06 19:11:25,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:25,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-06 19:11:25,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:25,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 58 transitions. [2025-02-06 19:11:25,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-02-06 19:11:25,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 58 transitions. [2025-02-06 19:11:25,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-06 19:11:25,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-02-06 19:11:25,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 58 transitions. [2025-02-06 19:11:25,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:25,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 58 transitions. [2025-02-06 19:11:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 58 transitions. [2025-02-06 19:11:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2025-02-06 19:11:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2025-02-06 19:11:25,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 46 transitions. [2025-02-06 19:11:25,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:25,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:11:25,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:11:25,816 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:25,845 INFO L93 Difference]: Finished difference Result 28 states and 46 transitions. [2025-02-06 19:11:25,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 46 transitions. [2025-02-06 19:11:25,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-02-06 19:11:25,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 46 transitions. [2025-02-06 19:11:25,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-06 19:11:25,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:11:25,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 46 transitions. [2025-02-06 19:11:25,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:25,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2025-02-06 19:11:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 46 transitions. [2025-02-06 19:11:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-06 19:11:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2025-02-06 19:11:25,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2025-02-06 19:11:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:11:25,849 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 46 transitions. [2025-02-06 19:11:25,849 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:11:25,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 46 transitions. [2025-02-06 19:11:25,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-02-06 19:11:25,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:25,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:25,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:25,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:11:25,850 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" [2025-02-06 19:11:25,850 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" [2025-02-06 19:11:25,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:25,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1293379299, now seen corresponding path program 2 times [2025-02-06 19:11:25,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:25,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139864794] [2025-02-06 19:11:25,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:25,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 19:11:25,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:11:25,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:25,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:25,901 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:25,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:11:25,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:11:25,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:11:25,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:25,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:25,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:25,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-06 19:11:25,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 52, now seen corresponding path program 3 times [2025-02-06 19:11:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071654964] [2025-02-06 19:11:25,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:25,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:25,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:25,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:11:25,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:25,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:25,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:25,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:25,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:25,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:25,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:25,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:25,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1440052584, now seen corresponding path program 3 times [2025-02-06 19:11:25,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:25,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247482919] [2025-02-06 19:11:25,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:25,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 2 equivalence classes. [2025-02-06 19:11:26,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:11:26,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:11:26,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:26,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:26,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:11:26,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:11:26,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:26,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:26,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:26,845 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:26,846 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:26,846 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:26,846 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:26,846 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:26,846 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,846 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:26,846 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:26,846 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration5_Lasso [2025-02-06 19:11:26,846 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:26,847 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:26,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:27,555 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:27,555 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:27,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,558 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:11:27,559 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:11:27,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,577 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:11:27,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,579 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:11:27,579 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:11:27,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:27,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,597 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:11:27,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,599 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:11:27,600 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:11:27,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:11:27,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,620 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:11:27,621 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:11:27,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-06 19:11:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,639 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:11:27,640 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:11:27,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,665 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:11:27,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,667 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:11:27,669 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:11:27,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:27,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,686 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:11:27,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,688 INFO L229 MonitoredProcess]: Starting monitored process 32 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:27,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-06 19:11:27,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-06 19:11:27,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,709 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:11:27,711 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:11:27,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:27,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-06 19:11:27,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,732 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:11:27,733 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:11:27,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-06 19:11:27,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,753 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:11:27,754 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:11:27,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:27,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,773 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:11:27,773 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:11:27,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-06 19:11:27,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,793 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:11:27,801 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:11:27,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,819 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:11:27,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,821 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:11:27,822 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:11:27,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,839 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:27,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,841 INFO L229 MonitoredProcess]: Starting monitored process 39 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:27,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-06 19:11:27,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:27,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-06 19:11:27,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,868 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:27,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,875 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:27,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,890 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:27,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,892 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:27,893 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:27,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:27,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,913 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:27,915 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:27,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:27,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-06 19:11:27,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,940 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:27,941 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:27,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:27,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:28,052 INFO L443 ModelExtractionUtils]: Simplification made 36 calls to the SMT solver. [2025-02-06 19:11:28,053 INFO L444 ModelExtractionUtils]: 6 out of 34 variables were initially zero. Simplification set additionally 22 variables to zero. [2025-02-06 19:11:28,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:28,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:28,055 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:28,056 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:28,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:28,067 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:11:28,067 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:28,067 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc17#1.base)_3) = -4*ULTIMATE.start_lis_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc17#1.base)_3 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_2 + 1*ULTIMATE.start_lis_~best~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc17#1.base)_3 >= 0] [2025-02-06 19:11:28,074 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:28,126 INFO L156 tatePredicateManager]: 17 out of 19 supporting invariants were superfluous and have been removed [2025-02-06 19:11:28,131 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:11:28,132 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:11:28,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:28,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:11:28,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:11:28,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:28,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 19:11:28,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:28,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 19:11:28,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 19:11:28,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 19:11:28,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 19:11:28,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-02-06 19:11:28,346 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-02-06 19:11:28,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-02-06 19:11:28,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:11:28,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:11:28,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:28,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:11:28,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:28,389 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:28,389 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2025-02-06 19:11:28,390 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 46 transitions. cyclomatic complexity: 24 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:28,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 46 transitions. cyclomatic complexity: 24. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 51 transitions. Complement of second has 6 states. [2025-02-06 19:11:28,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-02-06 19:11:28,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 1 letters. [2025-02-06 19:11:28,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:28,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 9 letters. Loop has 1 letters. [2025-02-06 19:11:28,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:28,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-06 19:11:28,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:28,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 51 transitions. [2025-02-06 19:11:28,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-06 19:11:28,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 51 transitions. [2025-02-06 19:11:28,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-06 19:11:28,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:11:28,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 51 transitions. [2025-02-06 19:11:28,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:28,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 51 transitions. [2025-02-06 19:11:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 51 transitions. [2025-02-06 19:11:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-02-06 19:11:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 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:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2025-02-06 19:11:28,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 48 transitions. [2025-02-06 19:11:28,462 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 48 transitions. [2025-02-06 19:11:28,462 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:11:28,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 48 transitions. [2025-02-06 19:11:28,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-06 19:11:28,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:28,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:28,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:28,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:11:28,463 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-06 19:11:28,463 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-06 19:11:28,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1440083369, now seen corresponding path program 1 times [2025-02-06 19:11:28,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:28,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109516672] [2025-02-06 19:11:28,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:28,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:28,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:11:28,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:11:28,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:11:28,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109516672] [2025-02-06 19:11:28,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109516672] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36179835] [2025-02-06 19:11:28,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:28,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:28,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:28,573 INFO L229 MonitoredProcess]: Starting monitored process 45 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:28,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-02-06 19:11:28,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:11:28,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:11:28,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:28,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:11:28,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:11:28,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:11:28,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36179835] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:28,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:28,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 19:11:28,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003947670] [2025-02-06 19:11:28,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:28,694 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:28,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 1 times [2025-02-06 19:11:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430489997] [2025-02-06 19:11:28,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:28,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:28,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:28,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:28,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:28,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:28,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:28,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:28,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:28,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:28,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 19:11:28,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 19:11:28,992 INFO L87 Difference]: Start difference. First operand 29 states and 48 transitions. cyclomatic complexity: 25 Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:29,037 INFO L93 Difference]: Finished difference Result 32 states and 50 transitions. [2025-02-06 19:11:29,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 50 transitions. [2025-02-06 19:11:29,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-06 19:11:29,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 50 transitions. [2025-02-06 19:11:29,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 19:11:29,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:11:29,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 50 transitions. [2025-02-06 19:11:29,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:29,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 50 transitions. [2025-02-06 19:11:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 50 transitions. [2025-02-06 19:11:29,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-02-06 19:11:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. [2025-02-06 19:11:29,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 46 transitions. [2025-02-06 19:11:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:11:29,042 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 46 transitions. [2025-02-06 19:11:29,042 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:11:29,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 46 transitions. [2025-02-06 19:11:29,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-02-06 19:11:29,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:29,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:29,043 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:29,043 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:11:29,044 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 0;" [2025-02-06 19:11:29,044 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;call lis_#t~mem13#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);" "assume lis_~max~0#1 < lis_#t~mem13#1;havoc lis_#t~mem13#1;call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem14#1;" "lis_#t~post15#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post15#1;havoc lis_#t~post15#1;" [2025-02-06 19:11:29,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1440083377, now seen corresponding path program 1 times [2025-02-06 19:11:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:29,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038032062] [2025-02-06 19:11:29,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:29,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:29,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:11:29,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:11:29,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:29,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:11:29,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:11:29,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 39656, now seen corresponding path program 1 times [2025-02-06 19:11:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643332192] [2025-02-06 19:11:29,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:29,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:11:29,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:11:29,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:29,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:11:29,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:11:29,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:29,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 904445402, now seen corresponding path program 1 times [2025-02-06 19:11:29,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:29,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487132201] [2025-02-06 19:11:29,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:29,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:11:29,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:11:29,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:29,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:11:29,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:11:29,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:29,877 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:29,877 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:29,877 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:29,877 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:29,877 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:29,877 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:29,877 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:29,877 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:29,877 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration7_Lasso [2025-02-06 19:11:29,877 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:29,877 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:29,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:29,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:30,413 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:30,413 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:30,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,417 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:30,418 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:30,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,439 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:30,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,441 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:30,442 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:30,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-06 19:11:30,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,469 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:30,471 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:30,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-06 19:11:30,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,489 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:30,491 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:30,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:30,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-06 19:11:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,510 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:30,511 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:30,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,528 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:30,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,530 INFO L229 MonitoredProcess]: Starting monitored process 51 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:30,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-02-06 19:11:30,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-02-06 19:11:30,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,550 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:30,551 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:30,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:30,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-02-06 19:11:30,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,572 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:30,573 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:30,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:30,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:30,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-06 19:11:30,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,595 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:30,595 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:30,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-02-06 19:11:30,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,615 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:30,616 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:30,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:11:30,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,637 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:30,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,640 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:30,642 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:30,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,662 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:30,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,664 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:30,665 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:30,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:30,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-02-06 19:11:30,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,686 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:30,686 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:30,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:30,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-02-06 19:11:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,712 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:30,714 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:30,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:30,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,733 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:30,734 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:30,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:30,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,751 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:30,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,753 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:30,754 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:30,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-02-06 19:11:30,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,775 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:30,775 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:30,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-02-06 19:11:30,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,795 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:30,796 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:30,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:30,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:30,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:30,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,813 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:30,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,816 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:30,817 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:30,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:30,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:30,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-02-06 19:11:30,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,839 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:30,840 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:30,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:30,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:30,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,862 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:30,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,864 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:30,865 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:30,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:30,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:30,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:30,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:30,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-02-06 19:11:30,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,887 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:30,888 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:30,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:30,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:30,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:30,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:30,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:30,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:30,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:30,916 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:30,940 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-02-06 19:11:30,940 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-02-06 19:11:30,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:30,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:30,942 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:30,944 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:30,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:30,958 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:30,958 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:30,958 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2025-02-06 19:11:30,967 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:30,993 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-02-06 19:11:31,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:11:31,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:11:31,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:31,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:11:31,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:31,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:11:31,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:11:31,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:31,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:31,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:11:31,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:31,062 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:31,063 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:11:31,063 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 46 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:11:31,076 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 46 transitions. cyclomatic complexity: 23. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 32 states and 51 transitions. Complement of second has 4 states. [2025-02-06 19:11:31,077 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:11:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:11:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2025-02-06 19:11:31,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 9 letters. Loop has 3 letters. [2025-02-06 19:11:31,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:31,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 12 letters. Loop has 3 letters. [2025-02-06 19:11:31,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:31,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 9 letters. Loop has 6 letters. [2025-02-06 19:11:31,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:31,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 51 transitions. [2025-02-06 19:11:31,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:11:31,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 35 transitions. [2025-02-06 19:11:31,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-06 19:11:31,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-02-06 19:11:31,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2025-02-06 19:11:31,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:31,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 35 transitions. [2025-02-06 19:11:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2025-02-06 19:11:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-06 19:11:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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:11:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2025-02-06 19:11:31,084 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 35 transitions. [2025-02-06 19:11:31,084 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2025-02-06 19:11:31,084 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:11:31,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2025-02-06 19:11:31,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:11:31,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:31,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:31,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:31,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:11:31,085 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-06 19:11:31,085 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-06 19:11:31,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1691957156, now seen corresponding path program 2 times [2025-02-06 19:11:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:31,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638767002] [2025-02-06 19:11:31,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:31,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:31,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 19:11:31,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:11:31,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:31,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:11:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638767002] [2025-02-06 19:11:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638767002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27088550] [2025-02-06 19:11:31,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:31,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:31,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:31,166 INFO L229 MonitoredProcess]: Starting monitored process 69 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:31,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-02-06 19:11:31,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 19:11:31,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:11:31,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:31,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:31,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:11:31,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:11:31,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:11:31,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27088550] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:31,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 19:11:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442606177] [2025-02-06 19:11:31,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:31,279 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:31,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 2 times [2025-02-06 19:11:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222829364] [2025-02-06 19:11:31,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:31,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:31,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-06 19:11:31,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:31,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:31,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:31,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:31,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:31,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:31,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:31,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:31,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:31,582 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:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:31,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:11:31,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:11:31,583 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 16 Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:31,619 INFO L93 Difference]: Finished difference Result 35 states and 54 transitions. [2025-02-06 19:11:31,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 54 transitions. [2025-02-06 19:11:31,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:11:31,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 53 transitions. [2025-02-06 19:11:31,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-06 19:11:31,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:11:31,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 53 transitions. [2025-02-06 19:11:31,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:31,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 53 transitions. [2025-02-06 19:11:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 53 transitions. [2025-02-06 19:11:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2025-02-06 19:11:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2025-02-06 19:11:31,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 34 transitions. [2025-02-06 19:11:31,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:11:31,623 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2025-02-06 19:11:31,623 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:11:31,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 34 transitions. [2025-02-06 19:11:31,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:11:31,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:31,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:31,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:31,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:11:31,624 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-06 19:11:31,624 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-06 19:11:31,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:31,625 INFO L85 PathProgramCache]: Analyzing trace with hash -911063273, now seen corresponding path program 3 times [2025-02-06 19:11:31,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:31,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751156109] [2025-02-06 19:11:31,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:31,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:31,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 2 equivalence classes. [2025-02-06 19:11:31,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:11:31,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:11:31,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:31,659 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:31,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:11:31,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:11:31,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:31,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:31,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:31,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 3 times [2025-02-06 19:11:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:31,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538038747] [2025-02-06 19:11:31,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:31,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 2 equivalence classes. [2025-02-06 19:11:31,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:31,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:11:31,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:31,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:31,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:31,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:31,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:31,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:31,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:31,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash -152068965, now seen corresponding path program 1 times [2025-02-06 19:11:31,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:31,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646866802] [2025-02-06 19:11:31,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:31,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:31,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:11:31,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:11:31,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:31,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 19:11:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646866802] [2025-02-06 19:11:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646866802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408729391] [2025-02-06 19:11:31,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:31,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:31,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:31,867 INFO L229 MonitoredProcess]: Starting monitored process 70 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:31,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-02-06 19:11:31,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:11:31,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:11:31,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:31,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:31,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:11:31,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 19:11:32,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 19:11:32,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408729391] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:32,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:32,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-06 19:11:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834720225] [2025-02-06 19:11:32,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:32,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:32,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:11:32,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:11:32,335 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. cyclomatic complexity: 15 Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:32,395 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2025-02-06 19:11:32,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2025-02-06 19:11:32,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:11:32,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 33 states and 48 transitions. [2025-02-06 19:11:32,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-06 19:11:32,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:11:32,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2025-02-06 19:11:32,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:32,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2025-02-06 19:11:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2025-02-06 19:11:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-02-06 19:11:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.46875) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2025-02-06 19:11:32,398 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 47 transitions. [2025-02-06 19:11:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:11:32,400 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2025-02-06 19:11:32,400 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:11:32,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 47 transitions. [2025-02-06 19:11:32,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-06 19:11:32,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:32,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:32,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:32,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:11:32,401 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-06 19:11:32,401 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" [2025-02-06 19:11:32,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash -911063273, now seen corresponding path program 4 times [2025-02-06 19:11:32,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:32,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721146702] [2025-02-06 19:11:32,402 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:32,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-02-06 19:11:32,417 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:11:32,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:32,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:32,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:32,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:11:32,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:11:32,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:32,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:32,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:32,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1475582, now seen corresponding path program 1 times [2025-02-06 19:11:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673114094] [2025-02-06 19:11:32,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:32,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:11:32,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:11:32,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:32,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:32,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:11:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:11:32,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:32,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:32,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:32,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1971105772, now seen corresponding path program 1 times [2025-02-06 19:11:32,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:32,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057005980] [2025-02-06 19:11:32,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:32,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:32,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:11:32,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:11:32,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:32,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:32,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:32,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:11:32,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:11:32,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:32,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:32,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:33,755 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:33,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:33,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:33,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:33,756 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:33,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:33,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:33,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:33,756 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration10_Lasso [2025-02-06 19:11:33,756 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:33,756 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:33,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:33,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:34,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:34,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:34,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:34,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:34,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:34,750 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:34,750 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:34,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,755 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:34,756 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:34,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:34,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:34,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:34,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:34,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,784 INFO L229 MonitoredProcess]: Starting monitored process 72 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:34,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-02-06 19:11:34,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:34,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:34,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:34,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:34,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-02-06 19:11:34,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,806 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:34,807 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:34,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:34,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:34,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:34,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:34,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-02-06 19:11:34,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,827 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:34,828 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:34,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:34,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:34,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:34,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:34,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,846 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:34,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,849 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:34,849 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:34,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:34,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:34,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:34,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:34,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-02-06 19:11:34,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,869 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:34,870 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:34,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:34,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:34,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:34,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-02-06 19:11:34,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,891 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:34,892 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:34,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:34,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:34,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:34,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:34,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,909 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:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,911 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:34,912 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:34,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:34,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:34,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:34,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:34,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,929 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:34,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,932 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:34,934 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:34,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:34,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:34,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:34,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:34,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-02-06 19:11:34,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,962 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:34,964 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:34,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:34,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:34,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:34,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:34,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:34,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:34,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:34,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:34,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:34,989 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:34,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:34,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:34,992 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:34,994 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:34,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:35,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:35,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,020 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:35,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,023 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:35,025 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:35,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:35,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:35,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-02-06 19:11:35,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,055 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:35,057 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:35,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:35,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,076 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:35,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,078 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:35,079 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:35,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,097 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:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,099 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:35,100 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:35,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-02-06 19:11:35,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,121 INFO L229 MonitoredProcess]: Starting monitored process 86 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:35,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-02-06 19:11:35,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-02-06 19:11:35,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,144 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:35,145 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:35,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,163 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:35,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,165 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:35,166 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:35,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-02-06 19:11:35,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,185 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:35,186 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:35,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,203 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:35,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,205 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:35,206 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:35,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,224 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:35,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,226 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:35,227 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:35,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:35,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-02-06 19:11:35,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,247 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:35,248 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:35,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:35,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,265 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:35,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,267 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:35,268 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:35,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:35,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:35,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:35,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:35,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:35,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-02-06 19:11:35,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,288 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:35,289 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:35,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:35,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:35,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:35,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:35,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:35,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:35,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:35,322 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:35,348 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-06 19:11:35,348 INFO L444 ModelExtractionUtils]: 4 out of 40 variables were initially zero. Simplification set additionally 32 variables to zero. [2025-02-06 19:11:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:35,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,350 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:35,351 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:35,351 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:35,361 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:35,362 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:35,362 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~best~0#1.offset, v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_4, ULTIMATE.start_lis_~j~0#1) = -1*ULTIMATE.start_lis_~best~0#1.offset + 2*v_rep(select #length ULTIMATE.start_lis_~best~0#1.base)_4 - 4*ULTIMATE.start_lis_~j~0#1 Supporting invariants [] [2025-02-06 19:11:35,368 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:35,435 INFO L156 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2025-02-06 19:11:35,436 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:11:35,436 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:11:35,437 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~best~0!offset [2025-02-06 19:11:35,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:35,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:11:35,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:11:35,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:35,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:35,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:11:35,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:35,491 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:35,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:11:35,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:11:35,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:35,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:35,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:11:35,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:35,546 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:35,546 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-06 19:11:35,547 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 47 transitions. cyclomatic complexity: 21 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:35,592 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 47 transitions. cyclomatic complexity: 21. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 116 transitions. Complement of second has 9 states. [2025-02-06 19:11:35,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2025-02-06 19:11:35,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-06 19:11:35,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:35,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2025-02-06 19:11:35,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:35,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 11 letters. Loop has 8 letters. [2025-02-06 19:11:35,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:35,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 116 transitions. [2025-02-06 19:11:35,595 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2025-02-06 19:11:35,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 102 transitions. [2025-02-06 19:11:35,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:11:35,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-06 19:11:35,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 102 transitions. [2025-02-06 19:11:35,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:35,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 102 transitions. [2025-02-06 19:11:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 102 transitions. [2025-02-06 19:11:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2025-02-06 19:11:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.523076923076923) internal successors, (99), 64 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:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2025-02-06 19:11:35,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 99 transitions. [2025-02-06 19:11:35,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 99 transitions. [2025-02-06 19:11:35,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:11:35,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 99 transitions. [2025-02-06 19:11:35,600 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2025-02-06 19:11:35,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:35,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:35,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:35,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:11:35,601 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" [2025-02-06 19:11:35,601 INFO L754 eck$LassoCheckResult]: Loop: "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" [2025-02-06 19:11:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1821809627, now seen corresponding path program 1 times [2025-02-06 19:11:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:35,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820434153] [2025-02-06 19:11:35,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:35,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:11:35,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:11:35,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:35,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:35,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:35,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:11:35,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:11:35,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:35,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:35,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:35,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1444804, now seen corresponding path program 1 times [2025-02-06 19:11:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71163906] [2025-02-06 19:11:35,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:35,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:11:35,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:11:35,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:35,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:35,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:35,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:11:35,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:11:35,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:35,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:35,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:35,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash -974706018, now seen corresponding path program 1 times [2025-02-06 19:11:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:35,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389177939] [2025-02-06 19:11:35,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:35,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:11:35,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:11:35,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:35,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:11:35,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:35,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389177939] [2025-02-06 19:11:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389177939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91994816] [2025-02-06 19:11:35,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:35,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:35,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:35,752 INFO L229 MonitoredProcess]: Starting monitored process 96 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:35,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-02-06 19:11:35,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:11:35,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:11:35,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:35,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:35,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:11:35,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:11:35,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:11:35,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91994816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:11:35,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:11:35,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-06 19:11:35,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440364527] [2025-02-06 19:11:35,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:11:35,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:35,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:11:35,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:11:35,957 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. cyclomatic complexity: 45 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:35,988 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2025-02-06 19:11:35,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2025-02-06 19:11:35,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:11:35,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 45 states and 64 transitions. [2025-02-06 19:11:35,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-06 19:11:35,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-06 19:11:35,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 64 transitions. [2025-02-06 19:11:35,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:35,989 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-02-06 19:11:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 64 transitions. [2025-02-06 19:11:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-02-06 19:11:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 40 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-02-06 19:11:35,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-02-06 19:11:35,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:11:35,995 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-02-06 19:11:35,995 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:11:35,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 60 transitions. [2025-02-06 19:11:35,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:11:35,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:35,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:35,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:35,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:11:35,998 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-06 19:11:35,998 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" [2025-02-06 19:11:35,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:35,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1043663459, now seen corresponding path program 1 times [2025-02-06 19:11:35,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:35,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346524370] [2025-02-06 19:11:35,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:36,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:11:36,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:11:36,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:36,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 19:11:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:36,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346524370] [2025-02-06 19:11:36,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346524370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:11:36,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:11:36,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:11:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505300588] [2025-02-06 19:11:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:11:36,055 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:36,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:36,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1418034693, now seen corresponding path program 4 times [2025-02-06 19:11:36,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:36,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989191859] [2025-02-06 19:11:36,056 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:36,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:36,060 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-02-06 19:11:36,064 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:36,064 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:36,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:36,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:36,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:36,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:36,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:36,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:36,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:36,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:36,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:11:36,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:11:36,321 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:36,337 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2025-02-06 19:11:36,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2025-02-06 19:11:36,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:11:36,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 59 transitions. [2025-02-06 19:11:36,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 19:11:36,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:11:36,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 59 transitions. [2025-02-06 19:11:36,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:36,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-02-06 19:11:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 59 transitions. [2025-02-06 19:11:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-06 19:11:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 40 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:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-02-06 19:11:36,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-02-06 19:11:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:11:36,341 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-02-06 19:11:36,341 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:11:36,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 59 transitions. [2025-02-06 19:11:36,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:11:36,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:36,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:36,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:36,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:11:36,344 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-06 19:11:36,344 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-06 19:11:36,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 515317908, now seen corresponding path program 1 times [2025-02-06 19:11:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:36,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56437158] [2025-02-06 19:11:36,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:36,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:11:36,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:11:36,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:36,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:11:36,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:36,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56437158] [2025-02-06 19:11:36,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56437158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:36,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168172313] [2025-02-06 19:11:36,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:36,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:36,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:36,469 INFO L229 MonitoredProcess]: Starting monitored process 97 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:36,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-02-06 19:11:36,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:11:36,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:11:36,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:36,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:36,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:11:36,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:11:36,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:11:36,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168172313] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:36,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:36,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-06 19:11:36,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833665875] [2025-02-06 19:11:36,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:36,667 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:36,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571453, now seen corresponding path program 5 times [2025-02-06 19:11:36,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207635060] [2025-02-06 19:11:36,667 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:36,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:36,671 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-06 19:11:36,675 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:36,675 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:36,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:36,675 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:36,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:36,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:36,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:36,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:36,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:36,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 19:11:36,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-06 19:11:36,948 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. cyclomatic complexity: 22 Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:36,993 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2025-02-06 19:11:36,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 60 transitions. [2025-02-06 19:11:36,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:11:36,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 60 transitions. [2025-02-06 19:11:36,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 19:11:36,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:11:36,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 60 transitions. [2025-02-06 19:11:36,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:36,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2025-02-06 19:11:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 60 transitions. [2025-02-06 19:11:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-06 19:11:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 41 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2025-02-06 19:11:36,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2025-02-06 19:11:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:11:36,998 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 60 transitions. [2025-02-06 19:11:36,998 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-06 19:11:36,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 60 transitions. [2025-02-06 19:11:36,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:11:36,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:36,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:36,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:36,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:11:36,999 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume !lis_#t~short9#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-06 19:11:36,999 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-06 19:11:36,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1455837720, now seen corresponding path program 1 times [2025-02-06 19:11:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:37,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841863618] [2025-02-06 19:11:37,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:37,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:11:37,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:11:37,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:37,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:37,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:37,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:11:37,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:11:37,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:37,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:37,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:37,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:37,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1448571453, now seen corresponding path program 6 times [2025-02-06 19:11:37,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:37,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487665691] [2025-02-06 19:11:37,053 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:37,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:37,059 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 6 statements into 2 equivalence classes. [2025-02-06 19:11:37,062 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:37,062 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-06 19:11:37,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:37,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:37,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:11:37,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:11:37,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:37,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:37,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:37,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2142791916, now seen corresponding path program 1 times [2025-02-06 19:11:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:37,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471912665] [2025-02-06 19:11:37,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:37,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:37,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:11:37,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:11:37,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:37,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 19:11:37,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471912665] [2025-02-06 19:11:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471912665] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468867349] [2025-02-06 19:11:37,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:11:37,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:37,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:37,190 INFO L229 MonitoredProcess]: Starting monitored process 98 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:37,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2025-02-06 19:11:37,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:11:37,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:11:37,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:37,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:37,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:11:37,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 19:11:37,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 19:11:37,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468867349] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:37,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:37,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-02-06 19:11:37,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353667874] [2025-02-06 19:11:37,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:37,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:37,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 19:11:37,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 19:11:37,595 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. cyclomatic complexity: 22 Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:37,652 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2025-02-06 19:11:37,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 79 transitions. [2025-02-06 19:11:37,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:11:37,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 34 states and 47 transitions. [2025-02-06 19:11:37,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-02-06 19:11:37,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-06 19:11:37,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 47 transitions. [2025-02-06 19:11:37,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:37,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 47 transitions. [2025-02-06 19:11:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 47 transitions. [2025-02-06 19:11:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2025-02-06 19:11:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-02-06 19:11:37,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-02-06 19:11:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:11:37,659 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-02-06 19:11:37,659 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-06 19:11:37,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2025-02-06 19:11:37,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-02-06 19:11:37,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:37,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:37,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:11:37,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2025-02-06 19:11:37,661 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~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet18#1;call write~int#0(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1;main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume lis_~i~0#1 < lis_~N#1;call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1;" "assume !(lis_~i~0#1 < lis_~N#1);lis_~i~0#1 := 1;" "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-06 19:11:37,661 INFO L754 eck$LassoCheckResult]: Loop: "assume lis_~i~0#1 < lis_~N#1;lis_~j~0#1 := 0;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume lis_~j~0#1 < lis_~i~0#1;call lis_#t~mem5#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#0(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1;" "assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1;" "assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4);" "lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1;" "assume !(lis_~j~0#1 < lis_~i~0#1);lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1;" [2025-02-06 19:11:37,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1455807929, now seen corresponding path program 2 times [2025-02-06 19:11:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:37,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503429843] [2025-02-06 19:11:37,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:37,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 19:11:37,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:11:37,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:37,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503429843] [2025-02-06 19:11:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503429843] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657468893] [2025-02-06 19:11:38,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:38,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:38,433 INFO L229 MonitoredProcess]: Starting monitored process 99 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:38,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2025-02-06 19:11:38,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 19:11:38,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:11:38,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:38,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:38,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 19:11:38,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:38,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 19:11:38,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 19:11:38,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 19:11:38,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 19:11:38,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:11:38,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2025-02-06 19:11:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:11:50,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:51,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2025-02-06 19:11:51,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:11:51,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 428 treesize of output 380 [2025-02-06 19:11:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:11:51,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657468893] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:51,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:51,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 27 [2025-02-06 19:11:51,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676343426] [2025-02-06 19:11:51,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:51,197 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:51,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1660545824, now seen corresponding path program 7 times [2025-02-06 19:11:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:51,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849156976] [2025-02-06 19:11:51,198 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:51,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:51,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:11:51,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:11:51,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:51,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:51,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:51,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:11:51,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:11:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:51,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:51,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 19:11:51,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=598, Unknown=1, NotChecked=0, Total=702 [2025-02-06 19:11:51,873 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 14 Second operand has 27 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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:12:04,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 19:12:16,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 19:12:25,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 19:12:37,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 19:12:49,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]