./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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/bubblesort-alloca-2.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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78'] 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/bubblesort-alloca-2.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 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 23:57:35,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 23:57:35,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-07 23:57:35,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 23:57:35,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 23:57:35,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 23:57:35,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 23:57:35,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 23:57:35,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 23:57:35,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 23:57:35,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 23:57:35,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 23:57:35,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 23:57:35,153 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-07 23:57:35,154 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-07 23:57:35,154 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-07 23:57:35,154 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-07 23:57:35,154 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-07 23:57:35,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 23:57:35,155 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 23:57:35,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 23:57:35,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 23:57:35,156 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-07 23:57:35,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 23:57:35,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 23:57:35,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 23:57:35,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 23:57:35,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 23:57:35,157 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-07 23:57:35,157 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 -> 71daa4447a811360729951159d42c752715aafb50c3ad4dcb2ed5d242a4f4a78 [2024-11-07 23:57:35,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 23:57:35,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 23:57:35,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 23:57:35,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 23:57:35,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 23:57:35,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2024-11-07 23:57:36,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 23:57:36,697 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 23:57:36,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2024-11-07 23:57:36,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e64775c88/ab40c595d41e4e7f93df339daa6ea966/FLAG4a94ba10b [2024-11-07 23:57:36,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e64775c88/ab40c595d41e4e7f93df339daa6ea966 [2024-11-07 23:57:36,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 23:57:36,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 23:57:36,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 23:57:36,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 23:57:36,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 23:57:36,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac149ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36, skipping insertion in model container [2024-11-07 23:57:36,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 23:57:36,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:57:36,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 23:57:36,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:57:36,947 INFO L204 MainTranslator]: Completed translation [2024-11-07 23:57:36,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36 WrapperNode [2024-11-07 23:57:36,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 23:57:36,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 23:57:36,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 23:57:36,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 23:57:36,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,973 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-11-07 23:57:36,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 23:57:36,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 23:57:36,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 23:57:36,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 23:57:36,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,988 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-11-07 23:57:36,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:36,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 23:57:36,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 23:57:36,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 23:57:36,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 23:57:37,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (1/1) ... [2024-11-07 23:57:37,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:37,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:37,026 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) [2024-11-07 23:57:37,028 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 [2024-11-07 23:57:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 23:57:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 23:57:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 23:57:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 23:57:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 23:57:37,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 23:57:37,119 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 23:57:37,121 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 23:57:37,225 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 23:57:37,225 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 23:57:37,230 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 23:57:37,231 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 23:57:37,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:57:37 BoogieIcfgContainer [2024-11-07 23:57:37,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 23:57:37,232 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-07 23:57:37,232 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-07 23:57:37,237 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-07 23:57:37,237 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:57:37,237 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 11:57:36" (1/3) ... [2024-11-07 23:57:37,238 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aa27544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:57:37, skipping insertion in model container [2024-11-07 23:57:37,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:57:37,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:57:36" (2/3) ... [2024-11-07 23:57:37,239 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aa27544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 11:57:37, skipping insertion in model container [2024-11-07 23:57:37,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-07 23:57:37,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:57:37" (3/3) ... [2024-11-07 23:57:37,240 INFO L332 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2024-11-07 23:57:37,278 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-07 23:57:37,279 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-07 23:57:37,279 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-07 23:57:37,279 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-07 23:57:37,279 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-07 23:57:37,279 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-07 23:57:37,280 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-07 23:57:37,280 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-07 23:57:37,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) [2024-11-07 23:57:37,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-07 23:57:37,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:37,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:37,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-07 23:57:37,298 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-07 23:57:37,298 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-07 23:57:37,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) [2024-11-07 23:57:37,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-07 23:57:37,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:37,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:37,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-07 23:57:37,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-07 23:57:37,304 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 9#L527true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 11#L527-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 15#L532-3true [2024-11-07 23:57:37,304 INFO L747 eck$LassoCheckResult]: Loop: 15#L532-3true assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3#L532-2true main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 15#L532-3true [2024-11-07 23:57:37,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-07 23:57:37,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:37,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457077142] [2024-11-07 23:57:37,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:37,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:37,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:37,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-11-07 23:57:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550816058] [2024-11-07 23:57:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:37,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:37,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:37,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-11-07 23:57:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70213905] [2024-11-07 23:57:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:37,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:37,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:37,700 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:57:37,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:57:37,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:57:37,702 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:57:37,702 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-07 23:57:37,702 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:37,702 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:57:37,702 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:57:37,702 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2024-11-07 23:57:37,702 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:57:37,703 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:57:37,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:37,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:37,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:37,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:37,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:37,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:37,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:37,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:37,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,099 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:57:38,102 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-07 23:57:38,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,105 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) [2024-11-07 23:57:38,106 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 [2024-11-07 23:57:38,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:38,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:38,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:38,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:38,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:38,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:38,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:38,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:38,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:38,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:38,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,139 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) [2024-11-07 23:57:38,140 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 [2024-11-07 23:57:38,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:38,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:38,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:38,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:38,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:38,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:38,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:38,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:38,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:38,164 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 [2024-11-07 23:57:38,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,166 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) [2024-11-07 23:57:38,166 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 [2024-11-07 23:57:38,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:38,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:38,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:38,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:38,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:38,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:38,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:38,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:38,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:38,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,201 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) [2024-11-07 23:57:38,202 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 [2024-11-07 23:57:38,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:38,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:38,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:38,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:38,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:38,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:38,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:38,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:38,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:38,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:38,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,227 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) [2024-11-07 23:57:38,228 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 [2024-11-07 23:57:38,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:38,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:38,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:38,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:38,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:38,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:38,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:38,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:38,255 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 [2024-11-07 23:57:38,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,257 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) [2024-11-07 23:57:38,258 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 [2024-11-07 23:57:38,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:38,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:38,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:38,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:38,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:38,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:38,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:38,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:38,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:38,281 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 [2024-11-07 23:57:38,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,283 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) [2024-11-07 23:57:38,301 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 [2024-11-07 23:57:38,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:38,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:38,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:38,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:38,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:38,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:38,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:38,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:38,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:38,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:38,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,325 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) [2024-11-07 23:57:38,326 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 [2024-11-07 23:57:38,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:38,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:38,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:38,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:38,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:38,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:38,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:38,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:38,352 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 [2024-11-07 23:57:38,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,354 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) [2024-11-07 23:57:38,355 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 [2024-11-07 23:57:38,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:38,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:38,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:38,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:38,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:38,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:38,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:38,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-07 23:57:38,405 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-07 23:57:38,407 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-07 23:57:38,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,413 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) [2024-11-07 23:57:38,414 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 [2024-11-07 23:57:38,416 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-07 23:57:38,427 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-07 23:57:38,428 INFO L474 LassoAnalysis]: Proved termination. [2024-11-07 23:57:38,428 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2024-11-07 23:57:38,439 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 [2024-11-07 23:57:38,446 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-07 23:57:38,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:38,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 23:57:38,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:38,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 23:57:38,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:38,536 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 [2024-11-07 23:57:38,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:38,571 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 42 transitions. Complement of second has 6 states. [2024-11-07 23:57:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-07 23:57:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-07 23:57:38,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-07 23:57:38,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:38,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-07 23:57:38,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:38,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-07 23:57:38,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:38,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2024-11-07 23:57:38,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-07 23:57:38,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 13 states and 19 transitions. [2024-11-07 23:57:38,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-07 23:57:38,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-07 23:57:38,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2024-11-07 23:57:38,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:57:38,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-11-07 23:57:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2024-11-07 23:57:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-07 23:57:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2024-11-07 23:57:38,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-11-07 23:57:38,608 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2024-11-07 23:57:38,608 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-07 23:57:38,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2024-11-07 23:57:38,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-07 23:57:38,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:38,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:38,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-07 23:57:38,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:57:38,610 INFO L745 eck$LassoCheckResult]: Stem: 108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 98#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 99#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 100#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 103#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 104#L515-3 [2024-11-07 23:57:38,611 INFO L747 eck$LassoCheckResult]: Loop: 104#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 105#L516-3 assume !true; 106#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 104#L515-3 [2024-11-07 23:57:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-11-07 23:57:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:38,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749635174] [2024-11-07 23:57:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:57:38,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749635174] [2024-11-07 23:57:38,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749635174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:57:38,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:57:38,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:57:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163546004] [2024-11-07 23:57:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:57:38,692 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:57:38,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash 61120, now seen corresponding path program 1 times [2024-11-07 23:57:38,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:38,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247468707] [2024-11-07 23:57:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:38,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:57:38,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247468707] [2024-11-07 23:57:38,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247468707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:57:38,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:57:38,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 23:57:38,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325314066] [2024-11-07 23:57:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:57:38,698 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-07 23:57:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:57:38,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 23:57:38,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 23:57:38,701 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:57:38,705 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2024-11-07 23:57:38,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2024-11-07 23:57:38,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-07 23:57:38,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2024-11-07 23:57:38,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-07 23:57:38,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-07 23:57:38,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-11-07 23:57:38,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:57:38,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-07 23:57:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-11-07 23:57:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-07 23:57:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-07 23:57:38,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-07 23:57:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 23:57:38,707 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-07 23:57:38,707 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-07 23:57:38,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-07 23:57:38,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-07 23:57:38,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:38,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:38,709 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-07 23:57:38,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:57:38,709 INFO L745 eck$LassoCheckResult]: Stem: 141#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 142#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 131#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 132#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 133#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 136#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 137#L515-3 [2024-11-07 23:57:38,709 INFO L747 eck$LassoCheckResult]: Loop: 137#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 138#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 139#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 137#L515-3 [2024-11-07 23:57:38,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:38,710 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2024-11-07 23:57:38,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:38,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72480457] [2024-11-07 23:57:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:57:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72480457] [2024-11-07 23:57:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72480457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:57:38,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:57:38,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:57:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054055251] [2024-11-07 23:57:38,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:57:38,775 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:57:38,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2024-11-07 23:57:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:38,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139843033] [2024-11-07 23:57:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:38,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:38,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:38,799 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:57:38,799 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:57:38,799 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:57:38,799 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:57:38,800 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-07 23:57:38,800 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,800 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:57:38,800 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:57:38,800 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration3_Loop [2024-11-07 23:57:38,800 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:57:38,800 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:57:38,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,857 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:57:38,858 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-07 23:57:38,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,861 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) [2024-11-07 23:57:38,862 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 [2024-11-07 23:57:38,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-07 23:57:38,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-07 23:57:38,875 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-07 23:57:38,876 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post7#1=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-07 23:57:38,886 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 [2024-11-07 23:57:38,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,887 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) [2024-11-07 23:57:38,888 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 [2024-11-07 23:57:38,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-07 23:57:38,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-07 23:57:38,901 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-07 23:57:38,901 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_~j~0#1=0} Honda state: {ULTIMATE.start_bubbleSort_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-07 23:57:38,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:38,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,913 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) [2024-11-07 23:57:38,913 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 [2024-11-07 23:57:38,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-07 23:57:38,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-07 23:57:38,935 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 [2024-11-07 23:57:38,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:38,938 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) [2024-11-07 23:57:38,939 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 [2024-11-07 23:57:38,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-07 23:57:38,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-07 23:57:38,957 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-07 23:57:38,970 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 [2024-11-07 23:57:38,970 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:57:38,970 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:57:38,970 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:57:38,970 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:57:38,970 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-07 23:57:38,970 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:38,970 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:57:38,970 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:57:38,970 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration3_Loop [2024-11-07 23:57:38,970 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:57:38,970 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:57:38,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:38,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:39,036 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:57:39,036 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-07 23:57:39,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:39,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:39,039 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) [2024-11-07 23:57:39,040 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 [2024-11-07 23:57:39,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:39,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:39,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:39,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:39,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:39,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:39,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:39,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:39,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:39,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:39,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:39,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:39,066 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) [2024-11-07 23:57:39,067 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 [2024-11-07 23:57:39,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:39,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:39,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:39,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:39,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:39,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:39,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:39,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:39,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:39,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-07 23:57:39,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:39,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:39,092 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) [2024-11-07 23:57:39,092 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 [2024-11-07 23:57:39,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:39,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:39,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:39,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:39,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:39,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:39,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:39,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:39,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-07 23:57:39,109 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-07 23:57:39,109 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-07 23:57:39,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:39,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:39,111 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) [2024-11-07 23:57:39,112 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 [2024-11-07 23:57:39,113 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-07 23:57:39,113 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-07 23:57:39,113 INFO L474 LassoAnalysis]: Proved termination. [2024-11-07 23:57:39,113 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1) = 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2024-11-07 23:57:39,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:39,124 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-07 23:57:39,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:39,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 23:57:39,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:39,156 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 23:57:39,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:39,171 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 [2024-11-07 23:57:39,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 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) [2024-11-07 23:57:39,184 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. 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 19 states and 28 transitions. Complement of second has 4 states. [2024-11-07 23:57:39,185 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 [2024-11-07 23:57:39,185 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) [2024-11-07 23:57:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-11-07 23:57:39,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2024-11-07 23:57:39,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:39,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-07 23:57:39,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:39,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2024-11-07 23:57:39,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:39,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2024-11-07 23:57:39,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:39,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2024-11-07 23:57:39,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-07 23:57:39,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-07 23:57:39,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2024-11-07 23:57:39,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:57:39,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2024-11-07 23:57:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2024-11-07 23:57:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-07 23:57:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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) [2024-11-07 23:57:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2024-11-07 23:57:39,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2024-11-07 23:57:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:57:39,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:57:39,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:57:39,189 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:57:39,204 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2024-11-07 23:57:39,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2024-11-07 23:57:39,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:39,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2024-11-07 23:57:39,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-07 23:57:39,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-07 23:57:39,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2024-11-07 23:57:39,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:57:39,206 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-07 23:57:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2024-11-07 23:57:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-07 23:57:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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) [2024-11-07 23:57:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2024-11-07 23:57:39,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2024-11-07 23:57:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:57:39,209 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2024-11-07 23:57:39,210 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-07 23:57:39,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2024-11-07 23:57:39,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:39,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:39,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:39,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:57:39,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:57:39,212 INFO L745 eck$LassoCheckResult]: Stem: 256#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 244#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 245#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 246#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 247#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 248#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 249#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 250#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 251#L516-3 [2024-11-07 23:57:39,212 INFO L747 eck$LassoCheckResult]: Loop: 251#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 252#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 259#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 251#L516-3 [2024-11-07 23:57:39,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2024-11-07 23:57:39,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:39,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303520651] [2024-11-07 23:57:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:39,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:39,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:39,243 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2024-11-07 23:57:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:39,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114943947] [2024-11-07 23:57:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:39,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2024-11-07 23:57:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:39,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062331597] [2024-11-07 23:57:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:39,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:57:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062331597] [2024-11-07 23:57:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062331597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:57:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107943893] [2024-11-07 23:57:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:39,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:57:39,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:39,382 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:57:39,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-07 23:57:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:39,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 23:57:39,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:39,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:57:39,497 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 [2024-11-07 23:57:39,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107943893] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:57:39,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:57:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-07 23:57:39,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092689600] [2024-11-07 23:57:39,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:57:39,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:57:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 23:57:39,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:57:39,601 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:57:39,673 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2024-11-07 23:57:39,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-11-07 23:57:39,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:39,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2024-11-07 23:57:39,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-07 23:57:39,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-07 23:57:39,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-11-07 23:57:39,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:57:39,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-07 23:57:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-11-07 23:57:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-07 23:57:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-07 23:57:39,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-07 23:57:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 23:57:39,678 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-07 23:57:39,678 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-07 23:57:39,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2024-11-07 23:57:39,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:39,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:39,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:39,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:57:39,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:57:39,679 INFO L745 eck$LassoCheckResult]: Stem: 392#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 379#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 380#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 383#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 381#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 382#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 396#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 397#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 384#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 385#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 386#L516-3 [2024-11-07 23:57:39,679 INFO L747 eck$LassoCheckResult]: Loop: 386#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 387#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 394#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 386#L516-3 [2024-11-07 23:57:39,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2024-11-07 23:57:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100267507] [2024-11-07 23:57:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:39,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2024-11-07 23:57:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:39,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694832583] [2024-11-07 23:57:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:39,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2024-11-07 23:57:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886291856] [2024-11-07 23:57:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:39,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:40,023 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:57:40,024 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:57:40,024 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:57:40,024 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:57:40,024 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-07 23:57:40,024 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,024 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:57:40,024 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:57:40,024 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration5_Lasso [2024-11-07 23:57:40,024 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:57:40,024 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:57:40,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:40,331 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:57:40,331 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-07 23:57:40,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,333 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) [2024-11-07 23:57:40,334 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 [2024-11-07 23:57:40,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:40,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:40,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:40,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:40,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:40,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:40,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:40,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:40,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:40,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:40,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,362 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) [2024-11-07 23:57:40,362 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 [2024-11-07 23:57:40,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:40,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:40,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:40,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:40,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:40,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:40,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:40,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:40,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:40,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:40,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,387 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) [2024-11-07 23:57:40,387 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 [2024-11-07 23:57:40,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:40,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:40,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:40,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:40,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:40,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:40,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:40,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:40,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:40,410 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 [2024-11-07 23:57:40,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,411 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) [2024-11-07 23:57:40,412 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 [2024-11-07 23:57:40,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:40,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:40,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:40,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:40,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:40,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:40,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:40,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:40,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:40,433 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 [2024-11-07 23:57:40,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,435 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) [2024-11-07 23:57:40,436 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 [2024-11-07 23:57:40,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 [2024-11-07 23:57:40,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:40,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:40,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:40,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:40,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:40,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:40,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:40,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:40,458 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 [2024-11-07 23:57:40,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,460 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) [2024-11-07 23:57:40,460 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 [2024-11-07 23:57:40,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:40,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:40,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:40,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:40,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:40,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:40,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:40,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:40,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:40,482 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 [2024-11-07 23:57:40,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,484 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) [2024-11-07 23:57:40,485 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 [2024-11-07 23:57:40,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:40,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:40,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:40,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:40,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:40,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:40,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:40,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:40,512 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 [2024-11-07 23:57:40,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,522 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) [2024-11-07 23:57:40,523 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 [2024-11-07 23:57:40,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:40,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:40,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:40,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:40,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:40,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:40,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:40,544 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-07 23:57:40,553 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-07 23:57:40,554 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-07 23:57:40,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:40,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,555 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) [2024-11-07 23:57:40,556 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 [2024-11-07 23:57:40,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-07 23:57:40,567 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-07 23:57:40,568 INFO L474 LassoAnalysis]: Proved termination. [2024-11-07 23:57:40,568 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~j~0#1, ULTIMATE.start_bubbleSort_~i~0#1) = -2*ULTIMATE.start_bubbleSort_~j~0#1 + 2*ULTIMATE.start_bubbleSort_~i~0#1 + 1 Supporting invariants [] [2024-11-07 23:57:40,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:40,586 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-07 23:57:40,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:40,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 23:57:40,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:40,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 23:57:40,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:40,640 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 [2024-11-07 23:57:40,640 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 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) [2024-11-07 23:57:40,657 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. 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 30 states and 42 transitions. Complement of second has 5 states. [2024-11-07 23:57:40,657 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 [2024-11-07 23:57:40,658 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) [2024-11-07 23:57:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-07 23:57:40,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-07 23:57:40,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:40,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-07 23:57:40,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:40,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-07 23:57:40,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:40,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 42 transitions. [2024-11-07 23:57:40,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:40,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 29 transitions. [2024-11-07 23:57:40,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-07 23:57:40,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-07 23:57:40,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2024-11-07 23:57:40,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:57:40,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-07 23:57:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2024-11-07 23:57:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-07 23:57:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 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) [2024-11-07 23:57:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-11-07 23:57:40,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-07 23:57:40,661 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-07 23:57:40,661 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-07 23:57:40,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2024-11-07 23:57:40,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:40,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:40,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:40,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:57:40,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:57:40,661 INFO L745 eck$LassoCheckResult]: Stem: 523#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 524#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 510#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 511#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 514#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 527#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 528#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 512#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 513#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 515#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 516#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 519#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 520#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 522#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 517#L516-3 [2024-11-07 23:57:40,662 INFO L747 eck$LassoCheckResult]: Loop: 517#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 518#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 525#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 517#L516-3 [2024-11-07 23:57:40,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:40,662 INFO L85 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2024-11-07 23:57:40,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:40,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951264508] [2024-11-07 23:57:40,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:40,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:57:40,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951264508] [2024-11-07 23:57:40,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951264508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:57:40,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87233431] [2024-11-07 23:57:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:40,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:57:40,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:40,727 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:57:40,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-07 23:57:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:40,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 23:57:40,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:40,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:57:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87233431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:57:40,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:57:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-07 23:57:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170645050] [2024-11-07 23:57:40,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:57:40,831 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:57:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2024-11-07 23:57:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746894928] [2024-11-07 23:57:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:40,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:40,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:40,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:57:40,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 23:57:40,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:57:40,909 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:57:40,983 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2024-11-07 23:57:40,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2024-11-07 23:57:40,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:40,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2024-11-07 23:57:40,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-07 23:57:40,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-07 23:57:40,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2024-11-07 23:57:40,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:57:40,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-11-07 23:57:40,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2024-11-07 23:57:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2024-11-07 23:57:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-07 23:57:40,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-07 23:57:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 23:57:40,986 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-07 23:57:40,986 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-07 23:57:40,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2024-11-07 23:57:40,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:40,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:40,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:40,987 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:57:40,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:57:40,987 INFO L745 eck$LassoCheckResult]: Stem: 664#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 650#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 651#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 652#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 653#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 654#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 668#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 669#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 655#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 656#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 659#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 660#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 667#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 662#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 663#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 661#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 657#L516-3 [2024-11-07 23:57:40,987 INFO L747 eck$LassoCheckResult]: Loop: 657#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 658#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 666#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 657#L516-3 [2024-11-07 23:57:40,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:40,987 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2024-11-07 23:57:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813190132] [2024-11-07 23:57:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:41,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2024-11-07 23:57:41,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:41,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548141644] [2024-11-07 23:57:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:41,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2024-11-07 23:57:41,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:41,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359197991] [2024-11-07 23:57:41,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:41,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:41,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 23:57:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:57:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359197991] [2024-11-07 23:57:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359197991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:57:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112246647] [2024-11-07 23:57:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:41,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:57:41,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:41,157 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:57:41,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-07 23:57:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:41,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 23:57:41,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 23:57:41,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:57:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 23:57:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112246647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:57:41,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:57:41,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-07 23:57:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211216405] [2024-11-07 23:57:41,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:57:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:57:41,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 23:57:41,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 23:57:41,360 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:57:41,414 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-07 23:57:41,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-11-07 23:57:41,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:41,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 23 states and 28 transitions. [2024-11-07 23:57:41,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-07 23:57:41,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-07 23:57:41,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-11-07 23:57:41,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:57:41,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-07 23:57:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-11-07 23:57:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-07 23:57:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-07 23:57:41,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-07 23:57:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 23:57:41,418 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-07 23:57:41,418 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-07 23:57:41,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-11-07 23:57:41,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:41,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:41,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:41,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:57:41,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:57:41,418 INFO L745 eck$LassoCheckResult]: Stem: 846#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 847#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 835#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 836#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 837#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 853#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 854#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 838#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 839#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 856#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 855#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 840#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 841#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 844#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 845#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 852#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 849#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 850#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 848#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 842#L516-3 [2024-11-07 23:57:41,418 INFO L747 eck$LassoCheckResult]: Loop: 842#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 843#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 851#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 842#L516-3 [2024-11-07 23:57:41,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2024-11-07 23:57:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070551804] [2024-11-07 23:57:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:41,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:57:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070551804] [2024-11-07 23:57:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070551804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:57:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935993270] [2024-11-07 23:57:41,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 23:57:41,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:57:41,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:41,507 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:57:41,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-07 23:57:41,555 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 23:57:41,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:57:41,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 23:57:41,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:41,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:57:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935993270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:57:41,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:57:41,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-07 23:57:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846416417] [2024-11-07 23:57:41,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:57:41,638 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-07 23:57:41,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2024-11-07 23:57:41,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:41,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574085392] [2024-11-07 23:57:41,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:41,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:57:41,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 23:57:41,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-07 23:57:41,718 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:57:41,787 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-07 23:57:41,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2024-11-07 23:57:41,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:41,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2024-11-07 23:57:41,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-07 23:57:41,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-07 23:57:41,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2024-11-07 23:57:41,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:57:41,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-11-07 23:57:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2024-11-07 23:57:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2024-11-07 23:57:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-07 23:57:41,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-07 23:57:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 23:57:41,790 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-07 23:57:41,790 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-07 23:57:41,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2024-11-07 23:57:41,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:41,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:41,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:41,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:57:41,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:57:41,793 INFO L745 eck$LassoCheckResult]: Stem: 1027#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1028#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1016#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1017#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 1018#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1019#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1020#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1035#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1038#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1037#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1036#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1021#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 1022#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1029#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1040#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1039#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1025#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1026#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1034#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1031#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 1032#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 1030#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1023#L516-3 [2024-11-07 23:57:41,793 INFO L747 eck$LassoCheckResult]: Loop: 1023#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1024#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1033#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1023#L516-3 [2024-11-07 23:57:41,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:41,793 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2024-11-07 23:57:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:41,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575735807] [2024-11-07 23:57:41,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:41,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:41,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2024-11-07 23:57:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:41,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113164718] [2024-11-07 23:57:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:41,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:41,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:41,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2024-11-07 23:57:41,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:41,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867033925] [2024-11-07 23:57:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 23:57:42,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:57:42,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867033925] [2024-11-07 23:57:42,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867033925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:57:42,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575287197] [2024-11-07 23:57:42,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 23:57:42,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:57:42,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:42,248 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:57:42,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-07 23:57:42,305 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 23:57:42,305 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:57:42,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 23:57:42,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:42,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 23:57:42,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-07 23:57:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 23:57:42,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:57:42,455 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-07 23:57:42,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 28 [2024-11-07 23:57:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 23:57:42,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575287197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:57:42,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:57:42,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 17 [2024-11-07 23:57:42,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907070530] [2024-11-07 23:57:42,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:57:42,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:57:42,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 23:57:42,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-07 23:57:42,546 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:57:42,623 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-07 23:57:42,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2024-11-07 23:57:42,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-07 23:57:42,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 57 transitions. [2024-11-07 23:57:42,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-07 23:57:42,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-07 23:57:42,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2024-11-07 23:57:42,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-07 23:57:42,634 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-07 23:57:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2024-11-07 23:57:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-07 23:57:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 35 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) [2024-11-07 23:57:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-07 23:57:42,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-07 23:57:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 23:57:42,640 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-07 23:57:42,640 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-07 23:57:42,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2024-11-07 23:57:42,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-07 23:57:42,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-07 23:57:42,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-07 23:57:42,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:57:42,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-07 23:57:42,641 INFO L745 eck$LassoCheckResult]: Stem: 1269#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1252#L527 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1253#L527-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~k~0#1 := 0; 1256#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1254#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1255#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1274#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1279#L532-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1278#L532-2 main_#t~post11#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1277#L532-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1257#L532-4 havoc main_~k~0#1;assume { :begin_inline_bubbleSort } true;bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset, bubbleSort_#in~array_size#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc bubbleSort_#t~mem2#1, bubbleSort_#t~mem3#1, bubbleSort_#t~mem4#1, bubbleSort_#t~mem5#1, bubbleSort_#t~post6#1, bubbleSort_#t~post7#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset, bubbleSort_~array_size#1, bubbleSort_~i~0#1, bubbleSort_~j~0#1, bubbleSort_~temp~0#1;bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset := bubbleSort_#in~numbers#1.base, bubbleSort_#in~numbers#1.offset;bubbleSort_~array_size#1 := bubbleSort_#in~array_size#1;havoc bubbleSort_~i~0#1;havoc bubbleSort_~j~0#1;havoc bubbleSort_~temp~0#1;bubbleSort_~i~0#1 := bubbleSort_~array_size#1 - 1; 1258#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1263#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1283#L517 assume !(bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1);havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1; 1282#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1261#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1262#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1272#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1273#L516-3 assume !(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1); 1286#L515-2 bubbleSort_#t~post7#1 := bubbleSort_~i~0#1;bubbleSort_~i~0#1 := bubbleSort_#t~post7#1 - 1;havoc bubbleSort_#t~post7#1; 1264#L515-3 assume !!(bubbleSort_~i~0#1 >= 0);bubbleSort_~j~0#1 := 1; 1266#L516-3 [2024-11-07 23:57:42,641 INFO L747 eck$LassoCheckResult]: Loop: 1266#L516-3 assume !!(bubbleSort_~j~0#1 <= bubbleSort_~i~0#1);call bubbleSort_#t~mem2#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);call bubbleSort_#t~mem3#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1281#L517 assume bubbleSort_#t~mem2#1 > bubbleSort_#t~mem3#1;havoc bubbleSort_#t~mem2#1;havoc bubbleSort_#t~mem3#1;call bubbleSort_#t~mem4#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);bubbleSort_~temp~0#1 := bubbleSort_#t~mem4#1;havoc bubbleSort_#t~mem4#1;call bubbleSort_#t~mem5#1 := read~int#0(bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4);call write~int#0(bubbleSort_#t~mem5#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * (bubbleSort_~j~0#1 - 1), 4);havoc bubbleSort_#t~mem5#1;call write~int#0(bubbleSort_~temp~0#1, bubbleSort_~numbers#1.base, bubbleSort_~numbers#1.offset + 4 * bubbleSort_~j~0#1, 4); 1271#L516-2 bubbleSort_#t~post6#1 := bubbleSort_~j~0#1;bubbleSort_~j~0#1 := 1 + bubbleSort_#t~post6#1;havoc bubbleSort_#t~post6#1; 1266#L516-3 [2024-11-07 23:57:42,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2024-11-07 23:57:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:42,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673056514] [2024-11-07 23:57:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:42,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:42,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:42,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:42,664 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2024-11-07 23:57:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:42,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235124577] [2024-11-07 23:57:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:42,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:42,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:42,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:42,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2024-11-07 23:57:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:57:42,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076773382] [2024-11-07 23:57:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:57:42,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:57:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:42,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 23:57:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 23:57:42,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 23:57:44,327 INFO L204 LassoAnalysis]: Preferences: [2024-11-07 23:57:44,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-07 23:57:44,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-07 23:57:44,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-07 23:57:44,327 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-07 23:57:44,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:44,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-07 23:57:44,327 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-07 23:57:44,327 INFO L132 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration10_Lasso [2024-11-07 23:57:44,327 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-07 23:57:44,327 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-07 23:57:44,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-07 23:57:44,837 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-07 23:57:44,837 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-07 23:57:44,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:44,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:44,839 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) [2024-11-07 23:57:44,840 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 [2024-11-07 23:57:44,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 [2024-11-07 23:57:44,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:44,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:44,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:44,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:44,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:44,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:44,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:44,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:44,862 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 [2024-11-07 23:57:44,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:44,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:44,863 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) [2024-11-07 23:57:44,864 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 [2024-11-07 23:57:44,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:44,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:44,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:44,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:44,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:44,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:44,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:44,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:44,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:44,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-07 23:57:44,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:44,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:44,887 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) [2024-11-07 23:57:44,887 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 [2024-11-07 23:57:44,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:44,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:44,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:44,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:44,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:44,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:44,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:44,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:44,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:44,909 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 [2024-11-07 23:57:44,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:44,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:44,911 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) [2024-11-07 23:57:44,912 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 [2024-11-07 23:57:44,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 [2024-11-07 23:57:44,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:44,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:44,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:44,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:44,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:44,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:44,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:44,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:44,934 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 [2024-11-07 23:57:44,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:44,935 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) [2024-11-07 23:57:44,936 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 [2024-11-07 23:57:44,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:44,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:44,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:44,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:44,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:44,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:44,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:44,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:44,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:44,957 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 [2024-11-07 23:57:44,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:44,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:44,959 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) [2024-11-07 23:57:44,960 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 [2024-11-07 23:57:44,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:44,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:44,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:44,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:44,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:44,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:44,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:44,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:44,982 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 [2024-11-07 23:57:44,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:44,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:44,984 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) [2024-11-07 23:57:44,985 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 [2024-11-07 23:57:44,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:44,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:44,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:44,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:44,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:44,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:44,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:44,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:44,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:45,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-07 23:57:45,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:45,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:45,008 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) [2024-11-07 23:57:45,009 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 [2024-11-07 23:57:45,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:45,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:45,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:45,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:45,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:45,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:45,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:45,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:45,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:45,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-07 23:57:45,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:45,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:45,033 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) [2024-11-07 23:57:45,033 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 [2024-11-07 23:57:45,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:45,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:45,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:45,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:45,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:45,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:45,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:45,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:45,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:45,055 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 [2024-11-07 23:57:45,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:45,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:45,057 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) [2024-11-07 23:57:45,058 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 [2024-11-07 23:57:45,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 [2024-11-07 23:57:45,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:45,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:45,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:45,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:45,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:45,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:45,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:45,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:45,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-07 23:57:45,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:45,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:45,085 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) [2024-11-07 23:57:45,086 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 [2024-11-07 23:57:45,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:45,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:45,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:45,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:45,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:45,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:45,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:45,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:45,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:45,107 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 [2024-11-07 23:57:45,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:45,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:45,109 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-07 23:57:45,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-07 23:57:45,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:45,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:45,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-07 23:57:45,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:45,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:45,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:45,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-07 23:57:45,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-07 23:57:45,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:45,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-07 23:57:45,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:45,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:45,134 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) [2024-11-07 23:57:45,135 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 [2024-11-07 23:57:45,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:45,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:45,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:45,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:45,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:45,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:45,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:45,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:45,158 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 [2024-11-07 23:57:45,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:45,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:45,160 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) [2024-11-07 23:57:45,160 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 [2024-11-07 23:57:45,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:45,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:45,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:45,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:45,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:45,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:45,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:45,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-07 23:57:45,195 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 [2024-11-07 23:57:45,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:45,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:45,197 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) [2024-11-07 23:57:45,198 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 [2024-11-07 23:57:45,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-07 23:57:45,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-07 23:57:45,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-07 23:57:45,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-07 23:57:45,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-07 23:57:45,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-07 23:57:45,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-07 23:57:45,223 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-07 23:57:45,264 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-11-07 23:57:45,264 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-07 23:57:45,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-07 23:57:45,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:57:45,266 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) [2024-11-07 23:57:45,268 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 [2024-11-07 23:57:45,268 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-07 23:57:45,279 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-07 23:57:45,279 INFO L474 LassoAnalysis]: Proved termination. [2024-11-07 23:57:45,279 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0#1, ULTIMATE.start_bubbleSort_~j~0#1) = 2147483647*ULTIMATE.start_bubbleSort_~i~0#1 - 1*ULTIMATE.start_bubbleSort_~j~0#1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers#1.base)_2 + 4294967292*ULTIMATE.start_bubbleSort_~j~0#1 >= 0] [2024-11-07 23:57:45,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:45,301 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2024-11-07 23:57:45,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:45,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 23:57:45,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:45,352 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 [2024-11-07 23:57:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:45,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 23:57:45,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:45,439 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-07 23:57:45,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:45,482 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 68 transitions. Complement of second has 7 states. [2024-11-07 23:57:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-07 23:57:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-07 23:57:45,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 22 letters. Loop has 3 letters. [2024-11-07 23:57:45,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:45,484 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-07 23:57:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:45,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 23:57:45,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:45,536 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 [2024-11-07 23:57:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:45,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 23:57:45,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:45,631 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-07 23:57:45,632 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:45,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 68 transitions. Complement of second has 7 states. [2024-11-07 23:57:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-07 23:57:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-07 23:57:45,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 22 letters. Loop has 3 letters. [2024-11-07 23:57:45,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:45,673 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-07 23:57:45,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:57:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:45,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 23:57:45,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:45,720 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 [2024-11-07 23:57:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:57:45,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 23:57:45,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:57:45,822 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 [2024-11-07 23:57:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 23:57:45,827 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-07 23:57:45,827 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:45,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 48 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 70 transitions. Complement of second has 6 states. [2024-11-07 23:57:45,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-07 23:57:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 23:57:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2024-11-07 23:57:45,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 22 letters. Loop has 3 letters. [2024-11-07 23:57:45,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:45,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 25 letters. Loop has 3 letters. [2024-11-07 23:57:45,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:45,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 22 letters. Loop has 6 letters. [2024-11-07 23:57:45,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-07 23:57:45,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 70 transitions. [2024-11-07 23:57:45,875 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-07 23:57:45,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2024-11-07 23:57:45,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-07 23:57:45,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-07 23:57:45,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-07 23:57:45,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-07 23:57:45,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 23:57:45,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 23:57:45,875 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 23:57:45,875 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-07 23:57:45,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-07 23:57:45,875 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-07 23:57:45,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-07 23:57:45,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.11 11:57:45 BoogieIcfgContainer [2024-11-07 23:57:45,882 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-07 23:57:45,882 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 23:57:45,882 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 23:57:45,883 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 23:57:45,883 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:57:37" (3/4) ... [2024-11-07 23:57:45,884 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 23:57:45,885 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 23:57:45,885 INFO L158 Benchmark]: Toolchain (without parser) took 9170.08ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 91.3MB in the beginning and 147.8MB in the end (delta: -56.5MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-11-07 23:57:45,885 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 23:57:45,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.66ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 74.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 23:57:45,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.73ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 73.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 23:57:45,885 INFO L158 Benchmark]: Boogie Preprocessor took 22.60ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 71.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 23:57:45,885 INFO L158 Benchmark]: RCFGBuilder took 234.10ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 60.6MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 23:57:45,886 INFO L158 Benchmark]: BuchiAutomizer took 8650.23ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 60.5MB in the beginning and 147.9MB in the end (delta: -87.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 23:57:45,886 INFO L158 Benchmark]: Witness Printer took 2.19ms. Allocated memory is still 192.9MB. Free memory was 147.9MB in the beginning and 147.8MB in the end (delta: 63.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 23:57:45,887 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.66ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 74.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.73ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 73.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.60ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 71.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.10ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 60.6MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8650.23ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 60.5MB in the beginning and 147.9MB in the end (delta: -87.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.19ms. Allocated memory is still 192.9MB. Free memory was 147.9MB in the beginning and 147.8MB in the end (delta: 63.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (array_size + ((long long) -1 * k)) and consists of 4 locations. One deterministic module has affine ranking function (((long long) 2 * i) + 1) and consists of 3 locations. One deterministic module has affine ranking function ((((long long) 2 * i) + ((long long) -2 * j)) + 1) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -1 * j) + ((long long) 2147483647 * i)) and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 7.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 26 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 544 IncrementalHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 119 mSDtfsCounter, 544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI1 SILT1 lasso3 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax178 hnf100 lsp68 ukn75 mio100 lsp72 div127 bol100 ite100 ukn100 eq170 hnf92 smp90 dnf100 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-07 23:57:45,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-07 23:57:46,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:46,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-11-07 23:57:46,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-07 23:57:46,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-07 23:57:46,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE