./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:13:38,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:13:38,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:13:38,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:13:38,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:13:38,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:13:38,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:13:38,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:13:38,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:13:38,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:13:38,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:13:38,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:13:38,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:13:38,418 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:13:38,419 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:13:38,419 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:13:38,421 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:13:38,421 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:13:38,424 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:13:38,424 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:13:38,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:13:38,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:13:38,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:13:38,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:13:38,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:13:38,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:13:38,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:13:38,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:13:38,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:13:38,428 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:13:38,428 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:13:38,429 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:13:38,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:13:38,429 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:13:38,429 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:13:38,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:13:38,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:13:38,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:13:38,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:13:38,431 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:13:38,431 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2024-11-17 08:13:38,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:13:38,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:13:38,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:13:38,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:13:38,732 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:13:38,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2024-11-17 08:13:40,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:13:40,384 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:13:40,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2024-11-17 08:13:40,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174d87fda/9e379cf05ffe4781b0cbc96520d10cc9/FLAG6f9c96902 [2024-11-17 08:13:40,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/174d87fda/9e379cf05ffe4781b0cbc96520d10cc9 [2024-11-17 08:13:40,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:13:40,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:13:40,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:13:40,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:13:40,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:13:40,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:13:40" (1/1) ... [2024-11-17 08:13:40,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241436cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:40, skipping insertion in model container [2024-11-17 08:13:40,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:13:40" (1/1) ... [2024-11-17 08:13:40,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:13:41,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:13:41,032 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:13:41,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:13:41,094 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:13:41,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41 WrapperNode [2024-11-17 08:13:41,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:13:41,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:13:41,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:13:41,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:13:41,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,130 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-17 08:13:41,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:13:41,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:13:41,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:13:41,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:13:41,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,163 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-17 08:13:41,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:13:41,174 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:13:41,174 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:13:41,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:13:41,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (1/1) ... [2024-11-17 08:13:41,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:41,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:41,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:41,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:13:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:13:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:13:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:13:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:13:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:13:41,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:13:41,434 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:13:41,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:13:41,594 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L526: call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2024-11-17 08:13:41,606 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-17 08:13:41,606 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:13:41,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:13:41,622 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:13:41,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:13:41 BoogieIcfgContainer [2024-11-17 08:13:41,623 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:13:41,624 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:13:41,625 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:13:41,629 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:13:41,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:13:41,630 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:13:40" (1/3) ... [2024-11-17 08:13:41,630 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c35853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:13:41, skipping insertion in model container [2024-11-17 08:13:41,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:13:41,631 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:13:41" (2/3) ... [2024-11-17 08:13:41,631 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c35853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:13:41, skipping insertion in model container [2024-11-17 08:13:41,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:13:41,632 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:13:41" (3/3) ... [2024-11-17 08:13:41,633 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2024-11-17 08:13:41,686 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:13:41,686 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:13:41,687 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:13:41,687 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:13:41,687 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:13:41,687 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:13:41,688 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:13:41,689 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:13:41,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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-17 08:13:41,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-17 08:13:41,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:41,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:41,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:13:41,716 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:13:41,716 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:13:41,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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-17 08:13:41,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-17 08:13:41,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:41,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:41,719 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-17 08:13:41,719 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:13:41,725 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12#ULTIMATE.init_returnLabel#1true assume true;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_~i~1#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; 13#L523true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 14#L526-1true 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_~i~1#1 := 0; 17#L528-1true [2024-11-17 08:13:41,726 INFO L747 eck$LassoCheckResult]: Loop: 17#L528-1true assume true; 6#L528-2true assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 17#L528-1true [2024-11-17 08:13:41,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1876798, now seen corresponding path program 1 times [2024-11-17 08:13:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:41,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416106618] [2024-11-17 08:13:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:41,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:41,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:41,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1760, now seen corresponding path program 1 times [2024-11-17 08:13:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:41,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131046100] [2024-11-17 08:13:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:41,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:41,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1803603677, now seen corresponding path program 1 times [2024-11-17 08:13:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:41,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939537597] [2024-11-17 08:13:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:41,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:41,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:42,270 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:42,271 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:42,271 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:42,271 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:42,271 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:13:42,271 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:42,271 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:42,271 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:42,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2024-11-17 08:13:42,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:42,272 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:42,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:42,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:42,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:42,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:42,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:42,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:42,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:42,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:42,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:42,834 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:42,838 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:13:42,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:42,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:42,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:42,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:13:42,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:42,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:42,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:42,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:42,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:42,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:42,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:42,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:42,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:42,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:13:42,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:42,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:42,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:42,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:42,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:13:42,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:42,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:42,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:42,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:42,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:42,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:42,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:42,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:42,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:42,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:42,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:42,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:42,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:13:42,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:42,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:42,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:42,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:42,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:42,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:42,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:42,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:42,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:42,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:42,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:42,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:42,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:13:42,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:42,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:42,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:42,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:42,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:42,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:42,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:42,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:43,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-17 08:13:43,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:43,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:43,017 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:43,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:13:43,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:13:43,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:43,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:43,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:43,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:43,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:43,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:43,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:43,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:43,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:43,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:43,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:43,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:43,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:13:43,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:13:43,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:43,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:43,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:43,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:43,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:43,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:43,069 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:43,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-17 08:13:43,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:43,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:43,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:43,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:13:43,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:43,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:43,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:43,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:43,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:43,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:43,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:43,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:43,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-17 08:13:43,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:43,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:43,136 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:43,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:13:43,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:43,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:43,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:43,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:43,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:43,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:43,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:43,176 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:13:43,213 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-17 08:13:43,213 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-17 08:13:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:43,237 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:43,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:13:43,240 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:13:43,254 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:13:43,254 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:13:43,255 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-11-17 08:13:43,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:13:43,283 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-17 08:13:43,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:43,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:43,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:43,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:13:43,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:43,369 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-17 08:13:43,401 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-17 08:13:43,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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) 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-17 08:13:43,440 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 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). 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 32 states and 45 transitions. Complement of second has 6 states. [2024-11-17 08:13:43,443 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-17 08:13:43,448 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-17 08:13:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-17 08:13:43,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-17 08:13:43,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:43,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-17 08:13:43,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:43,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-17 08:13:43,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:43,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2024-11-17 08:13:43,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:13:43,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 16 states and 22 transitions. [2024-11-17 08:13:43,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:13:43,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:13:43,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2024-11-17 08:13:43,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:43,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-17 08:13:43,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2024-11-17 08:13:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-17 08:13:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2024-11-17 08:13:43,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-17 08:13:43,487 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-17 08:13:43,487 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:13:43,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2024-11-17 08:13:43,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:13:43,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:43,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:43,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:43,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:43,491 INFO L745 eck$LassoCheckResult]: Stem: 103#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 104#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 114#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 115#L526-1 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_~i~1#1 := 0; 116#L528-1 assume true; 109#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 110#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 106#L515 [2024-11-17 08:13:43,491 INFO L747 eck$LassoCheckResult]: Loop: 106#L515 assume true; 107#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 108#L516 assume !true; 105#L515-1 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 106#L515 [2024-11-17 08:13:43,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash 77139097, now seen corresponding path program 1 times [2024-11-17 08:13:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:43,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473669308] [2024-11-17 08:13:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:43,600 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-17 08:13:43,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473669308] [2024-11-17 08:13:43,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473669308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:13:43,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:13:43,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:13:43,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318365977] [2024-11-17 08:13:43,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:13:43,605 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:13:43,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1476503, now seen corresponding path program 1 times [2024-11-17 08:13:43,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:43,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372606272] [2024-11-17 08:13:43,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:43,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:43,619 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-17 08:13:43,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372606272] [2024-11-17 08:13:43,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372606272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:13:43,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:13:43,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:13:43,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829846947] [2024-11-17 08:13:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:13:43,622 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:13:43,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:13:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:13:43,626 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-17 08:13:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:43,632 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2024-11-17 08:13:43,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2024-11-17 08:13:43,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:13:43,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2024-11-17 08:13:43,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-17 08:13:43,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:13:43,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-11-17 08:13:43,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:43,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-17 08:13:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-11-17 08:13:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-17 08:13:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-11-17 08:13:43,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-17 08:13:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:13:43,640 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-17 08:13:43,640 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:13:43,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2024-11-17 08:13:43,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:13:43,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:43,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:43,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:43,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:13:43,643 INFO L745 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 143#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 153#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 154#L526-1 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_~i~1#1 := 0; 155#L528-1 assume true; 148#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 149#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 145#L515 [2024-11-17 08:13:43,643 INFO L747 eck$LassoCheckResult]: Loop: 145#L515 assume true; 146#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 147#L516 assume true; 156#L516-2 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 144#L515-1 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 145#L515 [2024-11-17 08:13:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash 77139097, now seen corresponding path program 2 times [2024-11-17 08:13:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976435587] [2024-11-17 08:13:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:43,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:13:43,749 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-17 08:13:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976435587] [2024-11-17 08:13:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976435587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:13:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:13:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:13:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804790161] [2024-11-17 08:13:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:13:43,751 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:13:43,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 45770791, now seen corresponding path program 1 times [2024-11-17 08:13:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12256584] [2024-11-17 08:13:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:43,786 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-17 08:13:43,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:43,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12256584] [2024-11-17 08:13:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12256584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:13:43,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:13:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:13:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450387103] [2024-11-17 08:13:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:13:43,788 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:13:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:13:43,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:13:43,789 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:43,803 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-17 08:13:43,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2024-11-17 08:13:43,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:13:43,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2024-11-17 08:13:43,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-17 08:13:43,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-17 08:13:43,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2024-11-17 08:13:43,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:43,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-17 08:13:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2024-11-17 08:13:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-17 08:13:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 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-17 08:13:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-11-17 08:13:43,810 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-17 08:13:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:13:43,812 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-17 08:13:43,812 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:13:43,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2024-11-17 08:13:43,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:13:43,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:43,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:43,814 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:43,814 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:43,814 INFO L745 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 185#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 196#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 197#L526-1 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_~i~1#1 := 0; 198#L528-1 assume true; 190#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 191#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 187#L515 [2024-11-17 08:13:43,814 INFO L747 eck$LassoCheckResult]: Loop: 187#L515 assume true; 188#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 189#L516 assume true; 199#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 200#L517 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 194#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 195#L516 assume true; 201#L516-2 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 186#L515-1 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 187#L515 [2024-11-17 08:13:43,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:43,815 INFO L85 PathProgramCache]: Analyzing trace with hash 77139097, now seen corresponding path program 3 times [2024-11-17 08:13:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:43,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14291846] [2024-11-17 08:13:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:43,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:43,866 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-17 08:13:43,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:43,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14291846] [2024-11-17 08:13:43,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14291846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:13:43,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:13:43,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:13:43,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142429222] [2024-11-17 08:13:43,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:13:43,868 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:13:43,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash -722186007, now seen corresponding path program 1 times [2024-11-17 08:13:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:43,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545590867] [2024-11-17 08:13:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:43,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:43,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:44,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:44,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:13:44,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:13:44,017 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:44,033 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-17 08:13:44,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-11-17 08:13:44,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:13:44,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 23 transitions. [2024-11-17 08:13:44,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-17 08:13:44,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-17 08:13:44,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2024-11-17 08:13:44,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:44,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-17 08:13:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2024-11-17 08:13:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-17 08:13:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-17 08:13:44,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-17 08:13:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:13:44,041 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-17 08:13:44,042 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:13:44,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2024-11-17 08:13:44,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:13:44,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:44,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:44,045 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:44,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:44,045 INFO L745 eck$LassoCheckResult]: Stem: 229#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 230#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 241#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 242#L526-1 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_~i~1#1 := 0; 243#L528-1 assume true; 237#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 238#L528-1 assume true; 235#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 236#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 232#L515 [2024-11-17 08:13:44,045 INFO L747 eck$LassoCheckResult]: Loop: 232#L515 assume true; 233#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 234#L516 assume true; 244#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 245#L517 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 239#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 240#L516 assume true; 246#L516-2 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 231#L515-1 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 232#L515 [2024-11-17 08:13:44,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:44,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1116293274, now seen corresponding path program 1 times [2024-11-17 08:13:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:44,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263007359] [2024-11-17 08:13:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:44,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash -722186007, now seen corresponding path program 2 times [2024-11-17 08:13:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749744586] [2024-11-17 08:13:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:44,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash 71345264, now seen corresponding path program 1 times [2024-11-17 08:13:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:44,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345054336] [2024-11-17 08:13:44,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:44,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:44,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345054336] [2024-11-17 08:13:44,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345054336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:13:44,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587949387] [2024-11-17 08:13:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:44,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:13:44,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:44,281 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:13:44,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 08:13:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:44,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:13:44,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:44,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:13:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:44,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587949387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:13:44,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:13:44,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-17 08:13:44,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776875380] [2024-11-17 08:13:44,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:13:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:44,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 08:13:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 08:13:44,574 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:44,629 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-17 08:13:44,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2024-11-17 08:13:44,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:13:44,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 24 transitions. [2024-11-17 08:13:44,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-17 08:13:44,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-17 08:13:44,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2024-11-17 08:13:44,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:44,631 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-17 08:13:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2024-11-17 08:13:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-17 08:13:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 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-17 08:13:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-17 08:13:44,633 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-17 08:13:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 08:13:44,634 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-17 08:13:44,634 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:13:44,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2024-11-17 08:13:44,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:13:44,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:44,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:44,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:44,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:44,636 INFO L745 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 399#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 410#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 411#L526-1 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_~i~1#1 := 0; 412#L528-1 assume true; 406#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 407#L528-1 assume true; 415#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 417#L528-1 assume true; 404#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 405#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 401#L515 [2024-11-17 08:13:44,636 INFO L747 eck$LassoCheckResult]: Loop: 401#L515 assume true; 402#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 403#L516 assume true; 413#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 414#L517 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 408#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 409#L516 assume true; 416#L516-2 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 400#L515-1 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 401#L515 [2024-11-17 08:13:44,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:44,636 INFO L85 PathProgramCache]: Analyzing trace with hash -983922597, now seen corresponding path program 2 times [2024-11-17 08:13:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:44,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956610203] [2024-11-17 08:13:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:44,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:44,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:44,658 INFO L85 PathProgramCache]: Analyzing trace with hash -722186007, now seen corresponding path program 3 times [2024-11-17 08:13:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:44,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223376907] [2024-11-17 08:13:44,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:44,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:44,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:44,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1522830799, now seen corresponding path program 2 times [2024-11-17 08:13:44,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:44,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382351927] [2024-11-17 08:13:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:44,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:45,049 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:45,050 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:45,050 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:45,050 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:45,050 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:13:45,050 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,050 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:45,050 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:45,050 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration6_Lasso [2024-11-17 08:13:45,050 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:45,050 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:45,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:45,549 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:45,549 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:13:45,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:45,552 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:45,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:13:45,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:45,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:45,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:45,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:45,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:45,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:45,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:45,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:45,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:45,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:45,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:45,580 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:45,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:13:45,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:13:45,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:45,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:45,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:45,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:45,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:45,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:45,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:45,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:45,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:45,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:45,606 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:45,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:13:45,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:45,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:45,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:45,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:45,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:45,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:45,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:45,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:45,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:45,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:45,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:45,630 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:45,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:13:45,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:45,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:45,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:45,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:45,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:45,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:45,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:45,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:45,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:45,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:13:45,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:45,661 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:45,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:13:45,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:13:45,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:45,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:45,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:45,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:45,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:45,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:45,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:45,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-17 08:13:45,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:45,701 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:45,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:13:45,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:13:45,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:45,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:45,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:45,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:45,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:45,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:45,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:45,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:45,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:45,741 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:45,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:13:45,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:45,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:45,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:45,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:45,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:45,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:45,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:45,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:45,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:13:45,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:45,784 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:45,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:13:45,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:45,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:45,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:45,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:45,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:45,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:45,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:45,818 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:13:45,852 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-17 08:13:45,853 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-17 08:13:45,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:45,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:45,855 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:45,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:13:45,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:13:45,872 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:13:45,872 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:13:45,872 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1, ULTIMATE.start_sort_~n#1) = -1*ULTIMATE.start_sort_~pass~0#1 + 1*ULTIMATE.start_sort_~n#1 Supporting invariants [] [2024-11-17 08:13:45,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-17 08:13:45,903 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-17 08:13:45,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:45,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:45,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:45,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:13:45,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:46,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-17 08:13:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:46,058 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-17 08:13:46,058 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:46,076 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 35 transitions. Complement of second has 6 states. [2024-11-17 08:13:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:13:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-17 08:13:46,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 9 letters. [2024-11-17 08:13:46,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:46,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 20 letters. Loop has 9 letters. [2024-11-17 08:13:46,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:46,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 18 letters. [2024-11-17 08:13:46,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:46,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2024-11-17 08:13:46,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:46,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 34 transitions. [2024-11-17 08:13:46,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-17 08:13:46,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-17 08:13:46,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2024-11-17 08:13:46,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:46,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-17 08:13:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2024-11-17 08:13:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-17 08:13:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-17 08:13:46,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-17 08:13:46,082 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-17 08:13:46,082 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:13:46,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2024-11-17 08:13:46,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:46,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:46,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:46,083 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:46,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:46,083 INFO L745 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 558#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 573#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 574#L526-1 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_~i~1#1 := 0; 575#L528-1 assume true; 567#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 568#L528-1 assume true; 580#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 582#L528-1 assume true; 565#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 566#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 569#L515 assume true; 561#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 562#L516 [2024-11-17 08:13:46,083 INFO L747 eck$LassoCheckResult]: Loop: 562#L516 assume true; 576#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 577#L517 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 570#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 562#L516 [2024-11-17 08:13:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -656810022, now seen corresponding path program 1 times [2024-11-17 08:13:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374106740] [2024-11-17 08:13:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:46,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:46,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:46,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 1 times [2024-11-17 08:13:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:46,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985792252] [2024-11-17 08:13:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:46,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:46,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:46,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:46,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:46,111 INFO L85 PathProgramCache]: Analyzing trace with hash 383254872, now seen corresponding path program 1 times [2024-11-17 08:13:46,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:46,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427098805] [2024-11-17 08:13:46,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:46,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:46,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:46,451 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:46,451 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:46,451 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:46,451 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:46,451 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:13:46,451 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:46,451 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:46,451 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:46,451 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration7_Lasso [2024-11-17 08:13:46,451 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:46,451 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:46,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:46,935 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:46,935 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:13:46,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:46,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:46,937 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:46,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-17 08:13:46,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:46,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:46,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:46,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:46,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:46,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:46,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:46,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:46,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:46,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-17 08:13:46,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:46,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:46,982 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:46,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:13:46,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:46,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:46,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:46,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:46,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:46,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:46,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:46,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:46,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:47,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:47,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:47,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:47,007 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:47,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:13:47,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-17 08:13:47,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:47,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:47,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:47,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:47,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:47,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:47,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:47,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:47,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:47,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:47,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:47,031 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:47,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:13:47,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:47,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:47,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:47,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:47,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:47,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:47,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:47,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:47,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:47,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:47,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:47,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:47,057 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:47,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:13:47,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:47,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:47,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:47,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:47,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:47,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:47,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:47,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:47,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:47,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:47,091 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:47,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-17 08:13:47,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-17 08:13:47,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:47,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:47,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:47,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:47,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:47,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:47,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:47,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:47,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:47,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:47,132 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:47,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-17 08:13:47,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:13:47,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:47,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:47,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:47,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:47,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:47,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:47,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:47,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-17 08:13:47,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:47,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:47,169 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:47,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-17 08:13:47,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-17 08:13:47,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:47,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:47,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:47,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:47,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:47,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:47,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:47,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:47,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:47,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:47,206 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:47,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-17 08:13:47,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:47,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:47,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:47,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:47,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:47,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:47,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:47,235 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:13:47,266 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-17 08:13:47,267 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2024-11-17 08:13:47,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:47,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:47,269 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:47,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-17 08:13:47,271 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:13:47,286 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:13:47,286 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:13:47,286 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, v_rep(select #length ULTIMATE.start_sort_~x#1.base)_2) = -4*ULTIMATE.start_sort_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_2 Supporting invariants [1*ULTIMATE.start_sort_~x#1.offset >= 0] [2024-11-17 08:13:47,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:13:47,319 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2024-11-17 08:13:47,321 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:13:47,322 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:13:47,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:47,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:13:47,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:47,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:13:47,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:47,476 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-17 08:13:47,477 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-17 08:13:47,477 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:47,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 32 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 59 transitions. Complement of second has 9 states. [2024-11-17 08:13:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:13:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2024-11-17 08:13:47,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 13 letters. Loop has 4 letters. [2024-11-17 08:13:47,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:47,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 17 letters. Loop has 4 letters. [2024-11-17 08:13:47,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:47,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 13 letters. Loop has 8 letters. [2024-11-17 08:13:47,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:47,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 59 transitions. [2024-11-17 08:13:47,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:47,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 34 states and 41 transitions. [2024-11-17 08:13:47,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:13:47,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:13:47,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2024-11-17 08:13:47,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:47,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-17 08:13:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2024-11-17 08:13:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-17 08:13:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-17 08:13:47,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-17 08:13:47,531 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-17 08:13:47,531 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:13:47,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2024-11-17 08:13:47,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:47,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:47,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:47,533 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:47,533 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:47,533 INFO L745 eck$LassoCheckResult]: Stem: 733#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 734#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 750#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 751#L526-1 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_~i~1#1 := 0; 752#L528-1 assume true; 743#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 744#L528-1 assume true; 758#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 760#L528-1 assume true; 741#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 742#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 745#L515 assume true; 746#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 757#L516 assume true; 755#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 756#L517 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 748#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 749#L516 assume true; 759#L516-2 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 735#L515-1 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 736#L515 assume true; 737#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 738#L516 [2024-11-17 08:13:47,533 INFO L747 eck$LassoCheckResult]: Loop: 738#L516 assume true; 753#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 754#L517 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 747#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 738#L516 [2024-11-17 08:13:47,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash -255945841, now seen corresponding path program 1 times [2024-11-17 08:13:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:47,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133134605] [2024-11-17 08:13:47,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133134605] [2024-11-17 08:13:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133134605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:13:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309194814] [2024-11-17 08:13:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:47,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:13:47,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:47,698 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:13:47,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-17 08:13:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:47,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:13:47,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:47,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:13:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:13:47,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309194814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:13:47,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:13:47,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-17 08:13:47,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105121724] [2024-11-17 08:13:47,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:13:47,892 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:13:47,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 2 times [2024-11-17 08:13:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318758946] [2024-11-17 08:13:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:47,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:47,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:47,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:47,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:47,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 08:13:47,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-17 08:13:47,982 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 11 Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:48,034 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-11-17 08:13:48,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 59 transitions. [2024-11-17 08:13:48,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:48,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 43 transitions. [2024-11-17 08:13:48,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:13:48,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:13:48,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2024-11-17 08:13:48,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:48,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-17 08:13:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2024-11-17 08:13:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-17 08:13:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-17 08:13:48,041 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-17 08:13:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 08:13:48,043 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-17 08:13:48,043 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:13:48,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2024-11-17 08:13:48,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:48,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:48,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:48,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:48,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:48,045 INFO L745 eck$LassoCheckResult]: Stem: 956#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 957#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 973#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 974#L526-1 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_~i~1#1 := 0; 975#L528-1 assume true; 980#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 981#L528-1 assume true; 966#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 967#L528-1 assume true; 984#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 983#L528-1 assume true; 964#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 965#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 968#L515 assume true; 969#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 990#L516 assume true; 987#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 989#L517 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 988#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 986#L516 assume true; 982#L516-2 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 958#L515-1 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 959#L515 assume true; 960#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 961#L516 [2024-11-17 08:13:48,045 INFO L747 eck$LassoCheckResult]: Loop: 961#L516 assume true; 976#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 977#L517 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 970#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 961#L516 [2024-11-17 08:13:48,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash 643872110, now seen corresponding path program 2 times [2024-11-17 08:13:48,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390336308] [2024-11-17 08:13:48,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:48,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:48,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:48,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390336308] [2024-11-17 08:13:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390336308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:13:48,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323668733] [2024-11-17 08:13:48,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:13:48,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:13:48,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:48,213 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:13:48,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-17 08:13:48,278 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:13:48,278 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:13:48,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:13:48,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:48,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:13:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:13:48,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323668733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:13:48,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:13:48,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-17 08:13:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275891160] [2024-11-17 08:13:48,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:13:48,470 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:13:48,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:48,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 3 times [2024-11-17 08:13:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:48,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580469639] [2024-11-17 08:13:48,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:48,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:48,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:48,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 08:13:48,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-17 08:13:48,554 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 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-17 08:13:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:48,661 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2024-11-17 08:13:48,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2024-11-17 08:13:48,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:48,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 46 states and 55 transitions. [2024-11-17 08:13:48,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-17 08:13:48,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-17 08:13:48,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 55 transitions. [2024-11-17 08:13:48,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:48,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-11-17 08:13:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 55 transitions. [2024-11-17 08:13:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-11-17 08:13:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-17 08:13:48,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-17 08:13:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:13:48,667 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-17 08:13:48,667 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:13:48,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 47 transitions. [2024-11-17 08:13:48,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:48,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:48,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:48,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:48,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:48,669 INFO L745 eck$LassoCheckResult]: Stem: 1201#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1202#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 1218#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1219#L526-1 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_~i~1#1 := 0; 1220#L528-1 assume true; 1225#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1226#L528-1 assume true; 1211#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1212#L528-1 assume true; 1229#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1228#L528-1 assume true; 1209#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 1210#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1213#L515 assume true; 1214#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1236#L516 assume true; 1235#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1227#L517 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 1216#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1217#L516 assume true; 1223#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1224#L517 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 1233#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1234#L516 assume true; 1230#L516-2 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1203#L515-1 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 1204#L515 assume true; 1205#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1206#L516 [2024-11-17 08:13:48,669 INFO L747 eck$LassoCheckResult]: Loop: 1206#L516 assume true; 1221#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1222#L517 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1215#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1206#L516 [2024-11-17 08:13:48,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1259343089, now seen corresponding path program 3 times [2024-11-17 08:13:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:48,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144991811] [2024-11-17 08:13:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:48,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:48,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:48,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 4 times [2024-11-17 08:13:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:48,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213207203] [2024-11-17 08:13:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:48,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:48,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:48,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash -109851921, now seen corresponding path program 1 times [2024-11-17 08:13:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:48,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575150540] [2024-11-17 08:13:48,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 08:13:49,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:13:49,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575150540] [2024-11-17 08:13:49,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575150540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:13:49,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742685651] [2024-11-17 08:13:49,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:49,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:13:49,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:49,275 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:13:49,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-17 08:13:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:49,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:13:49,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:49,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:13:49,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2024-11-17 08:13:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 08:13:49,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:13:49,567 INFO L349 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2024-11-17 08:13:49,567 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 30 [2024-11-17 08:13:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 08:13:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742685651] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:13:49,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:13:49,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 18 [2024-11-17 08:13:49,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386668268] [2024-11-17 08:13:49,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:13:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:13:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 08:13:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-17 08:13:49,669 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. cyclomatic complexity: 12 Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:13:49,782 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2024-11-17 08:13:49,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 84 transitions. [2024-11-17 08:13:49,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-17 08:13:49,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 84 transitions. [2024-11-17 08:13:49,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-17 08:13:49,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-17 08:13:49,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 84 transitions. [2024-11-17 08:13:49,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:13:49,784 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 84 transitions. [2024-11-17 08:13:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 84 transitions. [2024-11-17 08:13:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-11-17 08:13:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 58 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-11-17 08:13:49,788 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-11-17 08:13:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 08:13:49,790 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-11-17 08:13:49,790 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:13:49,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 73 transitions. [2024-11-17 08:13:49,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-17 08:13:49,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:13:49,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:13:49,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:13:49,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:13:49,791 INFO L745 eck$LassoCheckResult]: Stem: 1519#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1520#ULTIMATE.init_returnLabel#1 assume true;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_~i~1#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; 1539#L523 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1540#L526-1 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_~i~1#1 := 0; 1541#L528-1 assume true; 1529#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1530#L528-1 assume true; 1548#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1554#L528-1 assume true; 1553#L528-2 assume !!(main_~i~1#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_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1552#L528-1 assume true; 1527#L528-2 assume !(main_~i~1#1 < main_~array_size~0#1); 1528#L528 havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1531#L515 assume true; 1532#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1577#L516 assume true; 1576#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1575#L517 assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1; 1537#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1538#L516 assume true; 1573#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1571#L517 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1570#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1569#L516 assume true; 1559#L516-2 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1521#L515-1 sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1; 1522#L515 assume true; 1523#L515-2 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1524#L516 [2024-11-17 08:13:49,791 INFO L747 eck$LassoCheckResult]: Loop: 1524#L516 assume true; 1542#L516-2 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1543#L517 assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1; 1536#L516-1 sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1; 1524#L516 [2024-11-17 08:13:49,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash 371839408, now seen corresponding path program 2 times [2024-11-17 08:13:49,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:49,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473406232] [2024-11-17 08:13:49,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:49,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:49,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:49,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:49,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1291775, now seen corresponding path program 5 times [2024-11-17 08:13:49,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:49,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733771362] [2024-11-17 08:13:49,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:49,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:49,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:49,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:49,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1687099438, now seen corresponding path program 3 times [2024-11-17 08:13:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:13:49,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903392106] [2024-11-17 08:13:49,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:13:49,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:13:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:49,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:13:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:13:49,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:50,823 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:13:50,823 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:13:50,823 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:13:50,823 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:13:50,823 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:13:50,823 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:50,823 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:13:50,823 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:13:50,823 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration11_Lasso [2024-11-17 08:13:50,823 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:13:50,824 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:13:50,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:50,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:50,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:13:51,467 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:13:51,467 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:13:51,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:51,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:51,470 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:51,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-17 08:13:51,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:51,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:51,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:51,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:51,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:51,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:51,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:51,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:51,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:51,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:51,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:51,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:51,494 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:51,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-17 08:13:51,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:51,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:51,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:13:51,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:51,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:51,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:51,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:13:51,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:13:51,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:13:51,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:51,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:51,518 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:51,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-17 08:13:51,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-17 08:13:51,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:13:51,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:13:51,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:13:51,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:13:51,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:13:51,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:13:51,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:13:51,558 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-17 08:13:51,558 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2024-11-17 08:13:51,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:13:51,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:13:51,559 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:13:51,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-17 08:13:51,560 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:13:51,572 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:13:51,573 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:13:51,573 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x#1.base)_3, ULTIMATE.start_sort_~x#1.offset, ULTIMATE.start_sort_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_3 - 1*ULTIMATE.start_sort_~x#1.offset - 4*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2024-11-17 08:13:51,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-17 08:13:51,591 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-17 08:13:51,592 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x!offset [2024-11-17 08:13:51,592 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:13:51,592 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:13:51,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:51,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:51,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:51,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:13:51,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:51,680 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-17 08:13:51,681 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-17 08:13:51,681 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:51,699 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 19. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 88 transitions. Complement of second has 7 states. [2024-11-17 08:13:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:13:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-17 08:13:51,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-17 08:13:51,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:51,700 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:13:51,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:51,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:51,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:51,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:13:51,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:51,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-17 08:13:51,834 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-17 08:13:51,834 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:13:51,834 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:51,853 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 19. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 88 transitions. Complement of second has 7 states. [2024-11-17 08:13:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:13:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-17 08:13:51,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-17 08:13:51,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:51,854 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:13:51,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:13:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:51,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:13:51,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:13:51,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:13:51,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:13:51,962 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-17 08:13:51,962 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:13:51,962 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:51,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 73 transitions. cyclomatic complexity: 19. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 86 states and 112 transitions. Complement of second has 6 states. [2024-11-17 08:13:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:13:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:13:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-17 08:13:51,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-17 08:13:51,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:51,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 32 letters. Loop has 4 letters. [2024-11-17 08:13:51,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:51,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 28 letters. Loop has 8 letters. [2024-11-17 08:13:51,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:13:51,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 112 transitions. [2024-11-17 08:13:51,994 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:13:51,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2024-11-17 08:13:51,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:13:51,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:13:51,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:13:51,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:13:51,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:13:51,995 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:13:51,995 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:13:51,995 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:13:51,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:13:51,995 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:13:51,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:13:52,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:13:52 BoogieIcfgContainer [2024-11-17 08:13:52,002 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:13:52,003 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:13:52,003 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:13:52,003 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:13:52,004 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:13:41" (3/4) ... [2024-11-17 08:13:52,007 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:13:52,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:13:52,009 INFO L158 Benchmark]: Toolchain (without parser) took 11324.61ms. Allocated memory was 142.6MB in the beginning and 257.9MB in the end (delta: 115.3MB). Free memory was 65.3MB in the beginning and 200.3MB in the end (delta: -135.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:13:52,009 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 142.6MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:13:52,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.61ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 98.6MB in the end (delta: -33.3MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-17 08:13:52,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.51ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:13:52,010 INFO L158 Benchmark]: Boogie Preprocessor took 41.97ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:13:52,010 INFO L158 Benchmark]: IcfgBuilder took 449.14ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 106.9MB in the end (delta: -12.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 08:13:52,011 INFO L158 Benchmark]: BuchiAutomizer took 10378.39ms. Allocated memory was 142.6MB in the beginning and 257.9MB in the end (delta: 115.3MB). Free memory was 106.9MB in the beginning and 200.3MB in the end (delta: -93.5MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-17 08:13:52,011 INFO L158 Benchmark]: Witness Printer took 5.15ms. Allocated memory is still 257.9MB. Free memory is still 200.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:13:52,012 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.24ms. Allocated memory is still 142.6MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.61ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 98.6MB in the end (delta: -33.3MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.51ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.97ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 449.14ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 106.9MB in the end (delta: -12.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10378.39ms. Allocated memory was 142.6MB in the beginning and 257.9MB in the end (delta: 115.3MB). Free memory was 106.9MB in the beginning and 200.3MB in the end (delta: -93.5MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Witness Printer took 5.15ms. Allocated memory is still 257.9MB. Free memory is still 200.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * 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 * i)) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -1 * pass) + n) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.3s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 8.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 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: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 599 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 425 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 174 mSDtfsCounter, 427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI2 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax111 hnf100 lsp90 ukn65 mio100 lsp52 div168 bol100 ite100 ukn100 eq152 hnf93 smp72 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 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-17 08:13:52,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-17 08:13:52,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-17 08:13:52,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-17 08:13:52,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-17 08:13:52,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE