./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:18:53,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:18:53,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:18:53,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:18:53,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:18:53,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:18:53,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:18:53,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:18:53,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:18:53,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:18:53,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:18:53,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:18:53,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:18:53,188 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:18:53,188 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:18:53,188 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:18:53,189 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:18:53,189 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:18:53,189 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:18:53,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:18:53,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:18:53,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:18:53,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:18:53,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:18:53,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:18:53,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:18:53,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:18:53,196 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:18:53,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:18:53,197 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:18:53,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:18:53,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:18:53,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:18:53,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:18:53,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:18:53,202 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:18:53,203 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2024-10-15 00:18:53,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:18:53,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:18:53,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:18:53,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:18:53,540 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:18:53,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-10-15 00:18:55,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:18:55,339 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:18:55,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-10-15 00:18:55,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4807c5d/6ef08bb5d3fb44e2a86aeff7531c87a0/FLAG5983849c7 [2024-10-15 00:18:55,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4807c5d/6ef08bb5d3fb44e2a86aeff7531c87a0 [2024-10-15 00:18:55,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:18:55,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:18:55,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:18:55,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:18:55,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:18:55,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e52f989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55, skipping insertion in model container [2024-10-15 00:18:55,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:18:55,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:18:55,623 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:18:55,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:18:55,665 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:18:55,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55 WrapperNode [2024-10-15 00:18:55,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:18:55,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:18:55,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:18:55,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:18:55,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,698 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2024-10-15 00:18:55,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:18:55,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:18:55,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:18:55,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:18:55,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,734 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-15 00:18:55,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:18:55,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:18:55,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:18:55,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:18:55,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (1/1) ... [2024-10-15 00:18:55,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:18:55,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:18:55,789 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-10-15 00:18:55,792 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-10-15 00:18:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:18:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 00:18:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2024-10-15 00:18:55,849 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2024-10-15 00:18:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:18:55,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:18:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:18:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:18:55,928 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:18:55,930 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:18:56,134 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-15 00:18:56,135 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:18:56,151 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:18:56,151 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 00:18:56,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:18:56 BoogieIcfgContainer [2024-10-15 00:18:56,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:18:56,154 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:18:56,154 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:18:56,158 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:18:56,161 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:18:56,161 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:18:55" (1/3) ... [2024-10-15 00:18:56,162 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f0718cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:18:56, skipping insertion in model container [2024-10-15 00:18:56,162 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:18:56,162 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:18:55" (2/3) ... [2024-10-15 00:18:56,163 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f0718cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:18:56, skipping insertion in model container [2024-10-15 00:18:56,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:18:56,163 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:18:56" (3/3) ... [2024-10-15 00:18:56,165 INFO L332 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2024-10-15 00:18:56,226 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:18:56,226 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:18:56,227 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:18:56,227 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:18:56,227 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:18:56,227 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:18:56,227 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:18:56,228 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:18:56,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 00:18:56,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-15 00:18:56,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:56,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:56,262 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:18:56,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:18:56,263 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:18:56,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 00:18:56,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-15 00:18:56,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:56,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:56,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:18:56,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:18:56,278 INFO L745 eck$LassoCheckResult]: Stem: 18#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 17#L28true assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 20#L33-3true [2024-10-15 00:18:56,279 INFO L747 eck$LassoCheckResult]: Loop: 20#L33-3true assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 7#L33-2true main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 20#L33-3true [2024-10-15 00:18:56,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2024-10-15 00:18:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976011669] [2024-10-15 00:18:56,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:56,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:56,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:56,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2024-10-15 00:18:56,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:56,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128801313] [2024-10-15 00:18:56,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:56,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:56,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:56,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:56,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:56,474 INFO L85 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2024-10-15 00:18:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838706407] [2024-10-15 00:18:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:56,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:56,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:56,848 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:18:56,849 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:18:56,849 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:18:56,849 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:18:56,849 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:18:56,850 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:18:56,850 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:18:56,850 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:18:56,850 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2024-10-15 00:18:56,850 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:18:56,850 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:18:56,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:18:56,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:18:56,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:18:56,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:18:56,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:18:56,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:18:56,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:18:57,257 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:18:57,261 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:18:57,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:18:57,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:18:57,266 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-10-15 00:18:57,268 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-10-15 00:18:57,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:18:57,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:18:57,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:18:57,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:18:57,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:18:57,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:18:57,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:18:57,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:18:57,349 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-15 00:18:57,349 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-15 00:18:57,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:18:57,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:18:57,370 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-10-15 00:18:57,374 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-10-15 00:18:57,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:18:57,391 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:18:57,392 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:18:57,393 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-10-15 00:18:57,412 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-10-15 00:18:57,419 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-10-15 00:18:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:57,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:18:57,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:18:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:57,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:18:57,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:18:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:57,558 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-10-15 00:18:57,560 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-10-15 00:18:57,615 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). 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) Result 44 states and 57 transitions. Complement of second has 7 states. [2024-10-15 00:18:57,618 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-10-15 00:18:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. 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-10-15 00:18:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-10-15 00:18:57,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2024-10-15 00:18:57,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:18:57,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-15 00:18:57,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:18:57,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-15 00:18:57,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:18:57,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2024-10-15 00:18:57,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:18:57,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 16 states and 21 transitions. [2024-10-15 00:18:57,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-15 00:18:57,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:18:57,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-10-15 00:18:57,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:18:57,639 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-15 00:18:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-10-15 00:18:57,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-15 00:18:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:18:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-10-15 00:18:57,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-15 00:18:57,670 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-15 00:18:57,670 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:18:57,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2024-10-15 00:18:57,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:18:57,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:57,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:57,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:18:57,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:18:57,672 INFO L745 eck$LassoCheckResult]: Stem: 125#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 120#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 124#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 110#L33-4 havoc main_~i~0#1; 111#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 112#$Ultimate##0 [2024-10-15 00:18:57,674 INFO L747 eck$LassoCheckResult]: Loop: 112#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 114#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 116#L15-6 assume !true; 121#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 113#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 112#$Ultimate##0 [2024-10-15 00:18:57,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1806659569, now seen corresponding path program 1 times [2024-10-15 00:18:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:57,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959048774] [2024-10-15 00:18:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:57,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-10-15 00:18:57,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:57,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959048774] [2024-10-15 00:18:57,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959048774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:18:57,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:18:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:18:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263129428] [2024-10-15 00:18:57,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:18:57,794 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:18:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 28740468, now seen corresponding path program 1 times [2024-10-15 00:18:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:57,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85586153] [2024-10-15 00:18:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:57,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85586153] [2024-10-15 00:18:57,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85586153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:18:57,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:18:57,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:18:57,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047884243] [2024-10-15 00:18:57,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:18:57,827 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:18:57,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:18:57,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 00:18:57,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 00:18:57,835 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:18:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:18:57,843 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2024-10-15 00:18:57,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2024-10-15 00:18:57,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:18:57,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2024-10-15 00:18:57,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:18:57,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:18:57,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-10-15 00:18:57,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:18:57,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-15 00:18:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-10-15 00:18:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-15 00:18:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:18:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-15 00:18:57,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-15 00:18:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:18:57,849 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-15 00:18:57,849 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:18:57,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-10-15 00:18:57,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:18:57,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:57,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:57,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:18:57,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:57,853 INFO L745 eck$LassoCheckResult]: Stem: 163#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 158#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 162#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 148#L33-4 havoc main_~i~0#1; 149#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 150#$Ultimate##0 [2024-10-15 00:18:57,853 INFO L747 eck$LassoCheckResult]: Loop: 150#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 152#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 154#L15-6 #t~short3 := ~j~0 > 0; 159#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 160#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 161#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 151#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 150#$Ultimate##0 [2024-10-15 00:18:57,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1806659569, now seen corresponding path program 2 times [2024-10-15 00:18:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:57,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341712682] [2024-10-15 00:18:57,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:57,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:57,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:57,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341712682] [2024-10-15 00:18:57,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341712682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:18:57,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:18:57,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:18:57,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363219382] [2024-10-15 00:18:57,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:18:57,935 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:18:57,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 1 times [2024-10-15 00:18:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:57,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220157606] [2024-10-15 00:18:57,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:57,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:57,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:57,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:58,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:18:58,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:18:58,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:18:58,397 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:18:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:18:58,413 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-15 00:18:58,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-10-15 00:18:58,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:18:58,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2024-10-15 00:18:58,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-15 00:18:58,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:18:58,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-10-15 00:18:58,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:18:58,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-15 00:18:58,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-10-15 00:18:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-15 00:18:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:18:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-15 00:18:58,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-15 00:18:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:18:58,418 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-15 00:18:58,418 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:18:58,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-10-15 00:18:58,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:18:58,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:58,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:58,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:58,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:58,419 INFO L745 eck$LassoCheckResult]: Stem: 202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 196#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 197#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 201#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 194#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 195#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 187#L33-4 havoc main_~i~0#1; 188#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 189#$Ultimate##0 [2024-10-15 00:18:58,419 INFO L747 eck$LassoCheckResult]: Loop: 189#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 191#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 193#L15-6 #t~short3 := ~j~0 > 0; 198#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 199#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 200#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 190#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 189#$Ultimate##0 [2024-10-15 00:18:58,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1034772399, now seen corresponding path program 1 times [2024-10-15 00:18:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:58,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011402248] [2024-10-15 00:18:58,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:58,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:58,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:58,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 2 times [2024-10-15 00:18:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030231133] [2024-10-15 00:18:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:58,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:58,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:58,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash 231564989, now seen corresponding path program 1 times [2024-10-15 00:18:58,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066414943] [2024-10-15 00:18:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:18:58,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066414943] [2024-10-15 00:18:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066414943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:18:58,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:18:58,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 00:18:58,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973235130] [2024-10-15 00:18:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:18:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:18:59,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 00:18:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 00:18:59,020 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:18:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:18:59,084 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-10-15 00:18:59,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2024-10-15 00:18:59,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:18:59,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2024-10-15 00:18:59,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-15 00:18:59,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-15 00:18:59,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2024-10-15 00:18:59,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:18:59,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-15 00:18:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2024-10-15 00:18:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-15 00:18:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:18:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-15 00:18:59,089 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-15 00:18:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:18:59,090 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-15 00:18:59,090 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:18:59,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2024-10-15 00:18:59,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:18:59,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:18:59,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:18:59,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:59,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:18:59,092 INFO L745 eck$LassoCheckResult]: Stem: 257#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 251#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 256#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 248#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 249#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 244#L33-4 havoc main_~i~0#1; 242#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 241#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 243#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 258#L15-6 #t~short3 := ~j~0 > 0; 252#L15-1 assume !#t~short3; 253#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 254#L15-7 [2024-10-15 00:18:59,092 INFO L747 eck$LassoCheckResult]: Loop: 254#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 246#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 255#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 261#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 247#L15-6 #t~short3 := ~j~0 > 0; 260#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 259#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 254#L15-7 [2024-10-15 00:18:59,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1921544551, now seen corresponding path program 1 times [2024-10-15 00:18:59,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:59,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979727503] [2024-10-15 00:18:59,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:59,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:59,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:59,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:59,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 3 times [2024-10-15 00:18:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:59,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9353895] [2024-10-15 00:18:59,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:59,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:18:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:18:59,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:18:59,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:18:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash 61906447, now seen corresponding path program 1 times [2024-10-15 00:18:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:18:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370435384] [2024-10-15 00:18:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:18:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:59,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:18:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:59,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:18:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370435384] [2024-10-15 00:18:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370435384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:18:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142168524] [2024-10-15 00:18:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:18:59,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:18:59,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:18:59,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:18:59,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 00:18:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:18:59,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:18:59,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:18:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:59,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:18:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:18:59,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142168524] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:18:59,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:18:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-10-15 00:18:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244640625] [2024-10-15 00:18:59,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 00:19:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-10-15 00:19:00,280 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:00,420 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-10-15 00:19:00,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2024-10-15 00:19:00,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:19:00,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 24 states and 27 transitions. [2024-10-15 00:19:00,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-15 00:19:00,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-15 00:19:00,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2024-10-15 00:19:00,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:00,423 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-15 00:19:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2024-10-15 00:19:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-10-15 00:19:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-10-15 00:19:00,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-15 00:19:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 00:19:00,427 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-15 00:19:00,427 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:19:00,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2024-10-15 00:19:00,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-15 00:19:00,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:00,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:00,429 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:00,429 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:00,429 INFO L745 eck$LassoCheckResult]: Stem: 456#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 449#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 450#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 455#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 457#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 458#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 447#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 448#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 443#L33-4 havoc main_~i~0#1; 441#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 440#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 442#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 459#L15-6 #t~short3 := ~j~0 > 0; 451#L15-1 assume !#t~short3; 452#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 453#L15-7 [2024-10-15 00:19:00,429 INFO L747 eck$LassoCheckResult]: Loop: 453#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 445#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 454#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 462#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 446#L15-6 #t~short3 := ~j~0 > 0; 461#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 460#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 453#L15-7 [2024-10-15 00:19:00,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1188957467, now seen corresponding path program 2 times [2024-10-15 00:19:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:00,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514250225] [2024-10-15 00:19:00,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:00,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:00,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:00,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:00,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 4 times [2024-10-15 00:19:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69745884] [2024-10-15 00:19:00,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:00,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:00,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:00,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1611060915, now seen corresponding path program 2 times [2024-10-15 00:19:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:00,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694063449] [2024-10-15 00:19:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:00,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:00,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:01,613 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:01,614 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:01,614 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:01,614 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:01,614 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:01,614 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:01,614 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:01,614 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:01,614 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2024-10-15 00:19:01,614 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:01,615 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:01,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:01,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:02,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:02,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:02,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:02,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:02,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:02,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:02,960 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:02,960 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:02,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:02,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:02,962 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-10-15 00:19:02,964 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-10-15 00:19:02,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:02,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:02,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:02,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:02,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:02,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:02,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:02,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:02,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:02,997 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-10-15 00:19:02,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:02,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,000 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-10-15 00:19:03,001 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-10-15 00:19:03,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:03,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:03,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:03,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:03,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 00:19:03,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,040 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-10-15 00:19:03,041 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-10-15 00:19:03,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:03,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:03,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:03,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:03,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,076 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-10-15 00:19:03,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,079 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-10-15 00:19:03,080 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-10-15 00:19:03,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:03,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:03,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:03,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:03,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,118 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-10-15 00:19:03,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,121 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-10-15 00:19:03,124 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-10-15 00:19:03,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:03,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:03,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:03,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:03,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,159 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-10-15 00:19:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,162 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-10-15 00:19:03,164 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-10-15 00:19:03,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:03,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:03,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:03,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:03,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,198 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-10-15 00:19:03,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,201 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:03,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:19:03,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:03,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:03,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:03,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:03,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-15 00:19:03,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,238 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-10-15 00:19:03,240 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-10-15 00:19:03,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:03,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:03,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:03,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:03,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-15 00:19:03,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,274 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-10-15 00:19:03,275 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-10-15 00:19:03,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:03,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:03,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:03,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-15 00:19:03,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,312 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-10-15 00:19:03,313 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-10-15 00:19:03,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:03,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:03,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:03,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,346 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-10-15 00:19:03,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,348 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-10-15 00:19:03,350 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-10-15 00:19:03,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:03,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,364 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-15 00:19:03,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,368 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-15 00:19:03,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:03,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,392 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-10-15 00:19:03,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,395 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-10-15 00:19:03,398 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-10-15 00:19:03,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:03,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:03,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:03,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:03,436 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-10-15 00:19:03,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,439 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-10-15 00:19:03,440 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-10-15 00:19:03,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:03,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:03,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:03,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:03,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:03,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:03,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:03,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:03,535 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-10-15 00:19:03,535 INFO L444 ModelExtractionUtils]: 1 out of 31 variables were initially zero. Simplification set additionally 24 variables to zero. [2024-10-15 00:19:03,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:03,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:03,538 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-10-15 00:19:03,539 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-10-15 00:19:03,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:03,551 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:19:03,552 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:03,552 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~i) = -2*insertionSort_~i + 1 Supporting invariants [1*insertionSort_~array.offset - 1*v_rep(select #length insertionSort_#in~array.base)_1 + 8 >= 0] [2024-10-15 00:19:03,564 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-10-15 00:19:03,582 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:19:03,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:03,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-15 00:19:03,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:03,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-15 00:19:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:03,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-15 00:19:03,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:04,031 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 5 loop predicates [2024-10-15 00:19:04,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:04,242 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 66 transitions. Complement of second has 23 states. [2024-10-15 00:19:04,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 8 stem states 4 non-accepting loop states 2 accepting loop states [2024-10-15 00:19:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2024-10-15 00:19:04,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 15 letters. Loop has 7 letters. [2024-10-15 00:19:04,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:04,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 22 letters. Loop has 7 letters. [2024-10-15 00:19:04,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:04,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 15 letters. Loop has 14 letters. [2024-10-15 00:19:04,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:04,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 66 transitions. [2024-10-15 00:19:04,251 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-15 00:19:04,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 51 states and 60 transitions. [2024-10-15 00:19:04,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-10-15 00:19:04,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-15 00:19:04,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 60 transitions. [2024-10-15 00:19:04,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:04,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-10-15 00:19:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 60 transitions. [2024-10-15 00:19:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-10-15 00:19:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-15 00:19:04,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-15 00:19:04,260 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-15 00:19:04,261 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:19:04,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-10-15 00:19:04,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-15 00:19:04,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:04,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:04,262 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:04,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:04,263 INFO L745 eck$LassoCheckResult]: Stem: 704#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 692#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 693#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 703#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 690#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 691#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 705#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 717#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 718#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 719#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 716#L33-4 havoc main_~i~0#1; 678#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 677#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 679#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 722#L15-6 #t~short3 := ~j~0 > 0; 721#L15-1 assume !#t~short3; 720#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 694#L15-7 [2024-10-15 00:19:04,263 INFO L747 eck$LassoCheckResult]: Loop: 694#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 686#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 696#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 706#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 687#L15-6 #t~short3 := ~j~0 > 0; 697#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 698#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 694#L15-7 [2024-10-15 00:19:04,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:04,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1084158749, now seen corresponding path program 3 times [2024-10-15 00:19:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:04,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068180968] [2024-10-15 00:19:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:04,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:04,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:04,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 5 times [2024-10-15 00:19:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:04,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256635282] [2024-10-15 00:19:04,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:04,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:04,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:04,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1280040203, now seen corresponding path program 3 times [2024-10-15 00:19:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:04,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544010847] [2024-10-15 00:19:04,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:04,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:04,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:04,612 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-10-15 00:19:05,581 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:05,581 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:05,581 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:05,581 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:05,582 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:05,582 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:05,582 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:05,582 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:05,582 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration7_Lasso [2024-10-15 00:19:05,582 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:05,582 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:05,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:05,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:06,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:06,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:06,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:06,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:06,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:06,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:06,628 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:06,629 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:06,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,631 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-10-15 00:19:06,633 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-10-15 00:19:06,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:06,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:06,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:06,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:06,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,660 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-10-15 00:19:06,662 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-10-15 00:19:06,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:06,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:06,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:06,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:06,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,691 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-10-15 00:19:06,692 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-10-15 00:19:06,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:06,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:06,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:06,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:06,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:06,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,720 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-10-15 00:19:06,721 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-10-15 00:19:06,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:06,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:06,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:06,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,748 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-10-15 00:19:06,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,750 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-10-15 00:19:06,751 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-10-15 00:19:06,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:06,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:06,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:06,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,775 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-10-15 00:19:06,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,777 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-10-15 00:19:06,778 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-10-15 00:19:06,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:06,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:06,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:06,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:06,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,802 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-10-15 00:19:06,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,805 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-10-15 00:19:06,806 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-10-15 00:19:06,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:06,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:06,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:06,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,830 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-10-15 00:19:06,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,832 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-10-15 00:19:06,834 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-10-15 00:19:06,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:06,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:06,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:06,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-15 00:19:06,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,861 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-10-15 00:19:06,862 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-10-15 00:19:06,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:06,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:06,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,892 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-10-15 00:19:06,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,894 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-10-15 00:19:06,895 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-10-15 00:19:06,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:06,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:06,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-15 00:19:06,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,924 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-10-15 00:19:06,925 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-10-15 00:19:06,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:06,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:06,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:06,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:06,974 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-10-15 00:19:06,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:06,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:06,976 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-10-15 00:19:06,977 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-10-15 00:19:06,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:06,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:06,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:06,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:06,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:07,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:07,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:07,019 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:07,056 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-15 00:19:07,056 INFO L444 ModelExtractionUtils]: 17 out of 31 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-15 00:19:07,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:07,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:07,059 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:07,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-15 00:19:07,061 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:07,076 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-15 00:19:07,076 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:07,076 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_#in~array.base)_2, insertionSort_~j~0) = 1*v_rep(select #length insertionSort_#in~array.base)_2 - 2*insertionSort_~j~0 Supporting invariants [1*insertionSort_~array.offset >= 0] [2024-10-15 00:19:07,097 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-10-15 00:19:07,117 INFO L156 tatePredicateManager]: 3 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:19:07,122 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:19:07,123 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:19:07,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:07,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 00:19:07,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:07,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-15 00:19:07,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:07,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-15 00:19:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:07,415 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 5 loop predicates [2024-10-15 00:19:07,415 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 54 transitions. cyclomatic complexity: 12 Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:07,547 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 54 transitions. cyclomatic complexity: 12. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 87 states and 106 transitions. Complement of second has 18 states. [2024-10-15 00:19:07,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-15 00:19:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2024-10-15 00:19:07,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 17 letters. Loop has 7 letters. [2024-10-15 00:19:07,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:07,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 24 letters. Loop has 7 letters. [2024-10-15 00:19:07,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:07,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 17 letters. Loop has 14 letters. [2024-10-15 00:19:07,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:07,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 106 transitions. [2024-10-15 00:19:07,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-15 00:19:07,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 72 states and 88 transitions. [2024-10-15 00:19:07,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-15 00:19:07,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-15 00:19:07,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 88 transitions. [2024-10-15 00:19:07,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:07,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 88 transitions. [2024-10-15 00:19:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 88 transitions. [2024-10-15 00:19:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-10-15 00:19:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 58 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-10-15 00:19:07,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-10-15 00:19:07,562 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-10-15 00:19:07,562 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:19:07,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2024-10-15 00:19:07,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-15 00:19:07,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:07,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:07,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:07,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-15 00:19:07,564 INFO L745 eck$LassoCheckResult]: Stem: 990#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 974#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 975#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 989#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 972#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 973#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 991#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1020#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 1019#L33-4 havoc main_~i~0#1; 984#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1018#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 992#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 993#L15-6 #t~short3 := ~j~0 > 0; 1023#L15-1 assume !#t~short3; 986#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 983#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 968#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1017#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1016#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1014#L15-6 #t~short3 := ~j~0 > 0; 979#L15-1 [2024-10-15 00:19:07,564 INFO L747 eck$LassoCheckResult]: Loop: 979#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 980#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 967#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 969#L15-6 #t~short3 := ~j~0 > 0; 979#L15-1 [2024-10-15 00:19:07,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1302233657, now seen corresponding path program 1 times [2024-10-15 00:19:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657564384] [2024-10-15 00:19:07,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:07,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:07,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:07,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2024-10-15 00:19:07,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:07,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798591473] [2024-10-15 00:19:07,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:07,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:07,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:07,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:07,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2041310206, now seen corresponding path program 1 times [2024-10-15 00:19:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:07,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469253061] [2024-10-15 00:19:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:07,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:07,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:08,796 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:08,796 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:08,796 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:08,796 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:08,796 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:08,796 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:08,796 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:08,796 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:08,797 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration8_Lasso [2024-10-15 00:19:08,797 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:08,797 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:08,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:08,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:08,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:08,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:08,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:08,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:09,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:09,493 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:09,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,495 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:09,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-15 00:19:09,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:09,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:09,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:09,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:09,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,528 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:09,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-15 00:19:09,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:09,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:09,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:09,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-15 00:19:09,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,555 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-10-15 00:19:09,556 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-10-15 00:19:09,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:09,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:09,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:09,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-15 00:19:09,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,582 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-10-15 00:19:09,584 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-10-15 00:19:09,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:09,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:09,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:09,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,608 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-10-15 00:19:09,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,609 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-10-15 00:19:09,610 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-10-15 00:19:09,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:09,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:09,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,636 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-10-15 00:19:09,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,637 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-10-15 00:19:09,638 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-10-15 00:19:09,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,649 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-15 00:19:09,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,651 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-15 00:19:09,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:09,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,670 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-10-15 00:19:09,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,672 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:09,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-15 00:19:09,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:09,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:09,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-15 00:19:09,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,700 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:09,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-15 00:19:09,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:09,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:09,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-10-15 00:19:09,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,737 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:09,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-15 00:19:09,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:09,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:09,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-15 00:19:09,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,767 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:09,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-15 00:19:09,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:09,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:09,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-15 00:19:09,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,807 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:09,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-15 00:19:09,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:09,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:09,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:09,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:09,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-15 00:19:09,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,838 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:09,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-15 00:19:09,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:09,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:09,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:09,849 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:19:09,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:09,873 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-15 00:19:09,873 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-15 00:19:09,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:09,941 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-10-15 00:19:09,941 INFO L444 ModelExtractionUtils]: 18 out of 36 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-10-15 00:19:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:09,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:09,942 INFO L229 MonitoredProcess]: Starting monitored process 44 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-10-15 00:19:09,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-15 00:19:09,944 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:09,956 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-10-15 00:19:09,957 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:09,957 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0) = 1*insertionSort_~j~0 Supporting invariants [] [2024-10-15 00:19:09,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-15 00:19:09,977 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:19:09,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:10,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:19:10,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:10,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:19:10,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:10,129 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-10-15 00:19:10,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:10,169 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 84 transitions. Complement of second has 8 states. [2024-10-15 00:19:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:19:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-10-15 00:19:10,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-15 00:19:10,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:10,171 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:19:10,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:10,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:19:10,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:10,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:19:10,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:10,355 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2024-10-15 00:19:10,356 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:10,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 84 transitions. Complement of second has 8 states. [2024-10-15 00:19:10,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:19:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-10-15 00:19:10,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-15 00:19:10,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:10,396 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:19:10,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:10,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:19:10,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:10,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:19:10,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:10,572 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-10-15 00:19:10,573 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:10,646 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 21. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 118 states and 153 transitions. Complement of second has 16 states. [2024-10-15 00:19:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:19:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2024-10-15 00:19:10,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-15 00:19:10,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:10,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 24 letters. Loop has 4 letters. [2024-10-15 00:19:10,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:10,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 8 letters. [2024-10-15 00:19:10,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:10,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 153 transitions. [2024-10-15 00:19:10,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-15 00:19:10,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 48 states and 58 transitions. [2024-10-15 00:19:10,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-15 00:19:10,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-15 00:19:10,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2024-10-15 00:19:10,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:10,653 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-10-15 00:19:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2024-10-15 00:19:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2024-10-15 00:19:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-10-15 00:19:10,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-15 00:19:10,656 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-15 00:19:10,656 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:19:10,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2024-10-15 00:19:10,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:19:10,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:10,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:10,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:10,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:10,658 INFO L745 eck$LassoCheckResult]: Stem: 1622#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1611#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1612#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 1621#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1623#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1624#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1609#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1610#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1631#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1630#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 1599#L33-4 havoc main_~i~0#1; 1600#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1601#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1602#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1635#L15-6 #t~short3 := ~j~0 > 0; 1634#L15-1 assume !#t~short3; 1619#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 1616#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1604#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1603#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1605#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1627#L15-6 #t~short3 := ~j~0 > 0; 1613#L15-1 assume !#t~short3; 1614#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 1606#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 1608#L15-6 #t~short3 := ~j~0 > 0; 1636#L15-1 [2024-10-15 00:19:10,658 INFO L747 eck$LassoCheckResult]: Loop: 1636#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1633#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 1632#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1607#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1618#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1625#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1626#L15-6 #t~short3 := ~j~0 > 0; 1628#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1614#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 1606#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 1608#L15-6 #t~short3 := ~j~0 > 0; 1636#L15-1 [2024-10-15 00:19:10,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1758050558, now seen corresponding path program 1 times [2024-10-15 00:19:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:10,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656791158] [2024-10-15 00:19:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-15 00:19:10,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656791158] [2024-10-15 00:19:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656791158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:19:10,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:19:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:19:10,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535456122] [2024-10-15 00:19:10,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:19:10,714 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:19:10,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1842592362, now seen corresponding path program 1 times [2024-10-15 00:19:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:10,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354170567] [2024-10-15 00:19:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:10,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:10,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:10,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:11,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-15 00:19:11,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:11,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:19:11,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:19:11,455 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:11,462 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-10-15 00:19:11,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2024-10-15 00:19:11,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-15 00:19:11,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 47 transitions. [2024-10-15 00:19:11,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-15 00:19:11,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-10-15 00:19:11,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2024-10-15 00:19:11,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:11,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-10-15 00:19:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2024-10-15 00:19:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-15 00:19:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-15 00:19:11,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-15 00:19:11,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:19:11,467 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-15 00:19:11,467 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:19:11,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2024-10-15 00:19:11,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:19:11,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:11,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:11,468 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:11,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:11,469 INFO L745 eck$LassoCheckResult]: Stem: 1707#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1696#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1697#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 1706#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1694#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1695#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1708#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1718#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 1717#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1716#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 1690#L33-4 havoc main_~i~0#1; 1691#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1704#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1721#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1720#L15-6 #t~short3 := ~j~0 > 0; 1719#L15-1 assume !#t~short3; 1705#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 1702#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1688#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1687#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1689#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1710#L15-6 #t~short3 := ~j~0 > 0; 1712#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1713#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 1692#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 1693#L15-6 #t~short3 := ~j~0 > 0; 1698#L15-1 [2024-10-15 00:19:11,469 INFO L747 eck$LassoCheckResult]: Loop: 1698#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1699#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 1715#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1685#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1684#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1686#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1709#L15-6 #t~short3 := ~j~0 > 0; 1711#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 1713#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 1692#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 1693#L15-6 #t~short3 := ~j~0 > 0; 1698#L15-1 [2024-10-15 00:19:11,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1757990976, now seen corresponding path program 2 times [2024-10-15 00:19:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:11,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762197530] [2024-10-15 00:19:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:11,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:11,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:11,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:11,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1842592362, now seen corresponding path program 2 times [2024-10-15 00:19:11,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:11,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533047664] [2024-10-15 00:19:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:11,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:11,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:11,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1753667593, now seen corresponding path program 3 times [2024-10-15 00:19:11,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:11,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167833687] [2024-10-15 00:19:11,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-15 00:19:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:19:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167833687] [2024-10-15 00:19:11,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167833687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:19:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946005763] [2024-10-15 00:19:11,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:19:11,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:19:11,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:11,733 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:19:11,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-10-15 00:19:11,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-15 00:19:11,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:19:11,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:19:11,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-15 00:19:11,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:19:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-15 00:19:11,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946005763] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:19:11,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:19:11,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2024-10-15 00:19:11,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373671462] [2024-10-15 00:19:11,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:19:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:19:12,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 00:19:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-15 00:19:12,635 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 10 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:19:12,757 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-10-15 00:19:12,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2024-10-15 00:19:12,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-15 00:19:12,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 66 transitions. [2024-10-15 00:19:12,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-10-15 00:19:12,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-15 00:19:12,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2024-10-15 00:19:12,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:19:12,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-10-15 00:19:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2024-10-15 00:19:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2024-10-15 00:19:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-15 00:19:12,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-15 00:19:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 00:19:12,766 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-15 00:19:12,766 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:19:12,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2024-10-15 00:19:12,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:19:12,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:19:12,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:19:12,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:12,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:19:12,768 INFO L745 eck$LassoCheckResult]: Stem: 2056#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2046#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2047#L28 assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0; 2055#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 2057#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2058#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 2044#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2045#L33-3 assume !!(main_~i~0#1 < main_~n~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1; 2064#L33-2 main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2063#L33-3 assume !(main_~i~0#1 < main_~n~0#1); 2031#L33-4 havoc main_~i~0#1; 2032#L37 call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2033#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2034#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2059#L15-6 #t~short3 := ~j~0 > 0; 2077#L15-1 assume !#t~short3; 2076#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 2075#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2036#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2035#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2037#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2060#L15-6 #t~short3 := ~j~0 > 0; 2069#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 2065#L15-3 assume !!#t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4); 2038#L15-5 #t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5; 2039#L15-6 #t~short3 := ~j~0 > 0; 2048#L15-1 assume !#t~short3; 2049#L15-3 [2024-10-15 00:19:12,768 INFO L747 eck$LassoCheckResult]: Loop: 2049#L15-3 assume !#t~short3;havoc #t~mem2;havoc #t~short3; 2052#L15-7 call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2042#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2054#$Ultimate##0 ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2074#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2072#L15-6 #t~short3 := ~j~0 > 0; 2073#L15-1 assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0; 2049#L15-3 [2024-10-15 00:19:12,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:12,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1336854580, now seen corresponding path program 4 times [2024-10-15 00:19:12,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889013998] [2024-10-15 00:19:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:12,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:12,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:12,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash -496333001, now seen corresponding path program 6 times [2024-10-15 00:19:12,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:12,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308275363] [2024-10-15 00:19:12,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:12,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:12,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:12,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:12,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash 623643916, now seen corresponding path program 5 times [2024-10-15 00:19:12,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:19:12,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744408443] [2024-10-15 00:19:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:19:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:19:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:12,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:19:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:19:12,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:19:14,422 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:19:14,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:19:14,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:19:14,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:19:14,422 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:19:14,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:14,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:19:14,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:19:14,422 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration11_Lasso [2024-10-15 00:19:14,422 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:19:14,422 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:19:14,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:14,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:19:16,128 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:19:16,129 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:19:16,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,132 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-15 00:19:16,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-10-15 00:19:16,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:16,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,160 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-15 00:19:16,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:16,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-15 00:19:16,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,186 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-15 00:19:16,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:16,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-15 00:19:16,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,212 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-15 00:19:16,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:16,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-15 00:19:16,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,241 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-15 00:19:16,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:16,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-15 00:19:16,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,267 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-15 00:19:16,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:16,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:16,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,299 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-15 00:19:16,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:16,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,325 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-15 00:19:16,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:16,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,353 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-15 00:19:16,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:16,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-15 00:19:16,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,380 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-15 00:19:16,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:16,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-15 00:19:16,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,406 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-15 00:19:16,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:16,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-15 00:19:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,431 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-15 00:19:16,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:16,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-15 00:19:16,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,457 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-15 00:19:16,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:16,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:19:16,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:19:16,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:19:16,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-15 00:19:16,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,484 INFO L229 MonitoredProcess]: Starting monitored process 59 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-10-15 00:19:16,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-15 00:19:16,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-15 00:19:16,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:16,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:16,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-15 00:19:16,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,514 INFO L229 MonitoredProcess]: Starting monitored process 60 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-10-15 00:19:16,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-15 00:19:16,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:16,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,527 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-15 00:19:16,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,565 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-15 00:19:16,565 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-15 00:19:16,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-15 00:19:16,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,650 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-15 00:19:16,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:16,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:16,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:16,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:19:16,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-15 00:19:16,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,687 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-15 00:19:16,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:19:16,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:19:16,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:19:16,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:19:16,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:19:16,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:19:16,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:19:16,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:19:16,792 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-10-15 00:19:16,793 INFO L444 ModelExtractionUtils]: 14 out of 31 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-15 00:19:16,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:19:16,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:19:16,795 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:19:16,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-15 00:19:16,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:19:16,811 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:19:16,811 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:19:16,811 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~size, insertionSort_~i) = 1*insertionSort_~size - 1*insertionSort_~i Supporting invariants [] [2024-10-15 00:19:16,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:16,842 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-15 00:19:16,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:19:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:16,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:19:16,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:19:16,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:19:16,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:19:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:19:16,998 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-15 00:19:16,998 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 55 transitions. cyclomatic complexity: 11 Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:17,031 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 55 transitions. cyclomatic complexity: 11. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 90 transitions. Complement of second has 16 states. [2024-10-15 00:19:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-15 00:19:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:19:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-15 00:19:17,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2024-10-15 00:19:17,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:17,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2024-10-15 00:19:17,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:17,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2024-10-15 00:19:17,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:19:17,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 90 transitions. [2024-10-15 00:19:17,037 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:19:17,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2024-10-15 00:19:17,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:19:17,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:19:17,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:19:17,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:19:17,037 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:19:17,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:19:17,037 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:19:17,038 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:19:17,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:19:17,038 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:19:17,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:19:17,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:19:17 BoogieIcfgContainer [2024-10-15 00:19:17,046 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:19:17,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:19:17,047 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:19:17,047 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:19:17,048 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:18:56" (3/4) ... [2024-10-15 00:19:17,049 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:19:17,050 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:19:17,051 INFO L158 Benchmark]: Toolchain (without parser) took 21678.05ms. Allocated memory was 169.9MB in the beginning and 348.1MB in the end (delta: 178.3MB). Free memory was 111.3MB in the beginning and 118.1MB in the end (delta: -6.8MB). Peak memory consumption was 175.6MB. Max. memory is 16.1GB. [2024-10-15 00:19:17,051 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 169.9MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:19:17,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.84ms. Allocated memory is still 169.9MB. Free memory was 111.2MB in the beginning and 100.2MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:19:17,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.33ms. Allocated memory is still 169.9MB. Free memory was 100.2MB in the beginning and 98.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:19:17,052 INFO L158 Benchmark]: Boogie Preprocessor took 50.23ms. Allocated memory is still 169.9MB. Free memory was 98.7MB in the beginning and 96.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:19:17,052 INFO L158 Benchmark]: RCFGBuilder took 402.36ms. Allocated memory is still 169.9MB. Free memory was 96.7MB in the beginning and 84.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 00:19:17,052 INFO L158 Benchmark]: BuchiAutomizer took 20892.18ms. Allocated memory was 169.9MB in the beginning and 348.1MB in the end (delta: 178.3MB). Free memory was 84.1MB in the beginning and 118.1MB in the end (delta: -33.9MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. [2024-10-15 00:19:17,053 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 348.1MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:19:17,054 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.76ms. Allocated memory is still 169.9MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.84ms. Allocated memory is still 169.9MB. Free memory was 111.2MB in the beginning and 100.2MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.33ms. Allocated memory is still 169.9MB. Free memory was 100.2MB in the beginning and 98.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.23ms. Allocated memory is still 169.9MB. Free memory was 98.7MB in the beginning and 96.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 402.36ms. Allocated memory is still 169.9MB. Free memory was 96.7MB in the beginning and 84.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 20892.18ms. Allocated memory was 169.9MB in the beginning and 348.1MB in the end (delta: 178.3MB). Free memory was 84.1MB in the beginning and 118.1MB in the end (delta: -33.9MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 348.1MB. Free memory is still 118.1MB. 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long) -1 * i) + n) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 14 locations. One deterministic module has affine ranking function null and consists of 10 locations. One deterministic module has affine ranking function (size + ((long) -1 * i)) and consists of 6 locations. One nondeterministic module has affine ranking function j and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.8s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 18.1s. Construction of modules took 0.3s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 38 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 579 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 409 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 462 IncrementalHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 170 mSDtfsCounter, 462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp101 ukn85 mio100 lsp47 div143 bol101 ite100 ukn100 eq163 hnf92 smp80 dnf151 smp83 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 120ms VariablesStem: 8 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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-10-15 00:19:17,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:17,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2024-10-15 00:19:17,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 00:19:17,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE