./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:05:10,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:05:10,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 17:05:10,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:05:10,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:05:10,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:05:10,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:05:10,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:05:10,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:05:10,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:05:10,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:05:10,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:05:10,607 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:05:10,608 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:05:10,608 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:05:10,608 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:05:10,609 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:05:10,609 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:05:10,609 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:05:10,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:05:10,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:05:10,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:05:10,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:05:10,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:05:10,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:05:10,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:05:10,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:05:10,613 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:05:10,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:05:10,614 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:05:10,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:05:10,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:05:10,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:05:10,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:05:10,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:05:10,617 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:05:10,617 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-13 17:05:10,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:05:10,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:05:10,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:05:10,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:05:10,933 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:05:10,934 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-13 17:05:12,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:05:12,776 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:05:12,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-10-13 17:05:12,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27297869d/ee516fdb810143f2b22faf57827dd001/FLAG164e89245 [2024-10-13 17:05:13,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27297869d/ee516fdb810143f2b22faf57827dd001 [2024-10-13 17:05:13,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:05:13,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:05:13,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:05:13,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:05:13,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:05:13,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48270387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13, skipping insertion in model container [2024-10-13 17:05:13,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:05:13,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:05:13,372 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:05:13,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:05:13,405 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:05:13,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13 WrapperNode [2024-10-13 17:05:13,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:05:13,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:05:13,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:05:13,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:05:13,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,438 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2024-10-13 17:05:13,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:05:13,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:05:13,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:05:13,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:05:13,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,467 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-13 17:05:13,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:05:13,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:05:13,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:05:13,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:05:13,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (1/1) ... [2024-10-13 17:05:13,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:13,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:13,531 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-13 17:05:13,536 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-13 17:05:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:05:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 17:05:13,579 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2024-10-13 17:05:13,579 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2024-10-13 17:05:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:05:13,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:05:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:05:13,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:05:13,644 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:05:13,645 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:05:13,813 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 17:05:13,813 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:05:13,830 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:05:13,831 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 17:05:13,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:05:13 BoogieIcfgContainer [2024-10-13 17:05:13,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:05:13,832 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:05:13,832 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:05:13,835 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:05:13,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:05:13,836 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:05:13" (1/3) ... [2024-10-13 17:05:13,837 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20096acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:05:13, skipping insertion in model container [2024-10-13 17:05:13,837 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:05:13,837 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:05:13" (2/3) ... [2024-10-13 17:05:13,838 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20096acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:05:13, skipping insertion in model container [2024-10-13 17:05:13,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:05:13,838 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:05:13" (3/3) ... [2024-10-13 17:05:13,840 INFO L332 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2024-10-13 17:05:13,898 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:05:13,899 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:05:13,899 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:05:13,899 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:05:13,899 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:05:13,899 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:05:13,899 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:05:13,899 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:05:13,903 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-13 17:05:13,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:05:13,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:13,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:13,929 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 17:05:13,929 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:05:13,930 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:05:13,930 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-13 17:05:13,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:05:13,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:13,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:13,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 17:05:13,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:05:13,941 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-13 17:05:13,942 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-13 17:05:13,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2024-10-13 17:05:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:13,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222275601] [2024-10-13 17:05:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:14,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:14,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:14,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:14,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2024-10-13 17:05:14,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:14,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135885057] [2024-10-13 17:05:14,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:14,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:14,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:14,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:14,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2024-10-13 17:05:14,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325586598] [2024-10-13 17:05:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:14,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:14,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:14,573 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:14,574 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:14,574 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:14,574 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:14,574 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:14,574 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:14,574 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:14,574 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:14,575 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2024-10-13 17:05:14,575 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:14,575 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:14,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:14,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:14,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:14,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:14,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:14,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:14,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:14,940 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:14,944 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:14,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:14,950 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-13 17:05:14,952 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-13 17:05:14,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:14,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:14,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:14,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:14,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:14,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:14,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:14,992 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:15,034 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-13 17:05:15,034 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-13 17:05:15,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:15,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:15,057 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-13 17:05:15,060 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-13 17:05:15,061 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:15,077 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:05:15,078 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:15,079 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-13 17:05:15,094 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-13 17:05:15,104 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-10-13 17:05:15,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:15,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:05:15,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:15,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:05:15,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:15,205 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-13 17:05:15,238 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-13 17:05:15,240 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-13 17:05:15,293 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-13 17:05:15,295 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-13 17:05:15,301 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-13 17:05:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-10-13 17:05:15,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2024-10-13 17:05:15,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:15,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-13 17:05:15,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:15,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-13 17:05:15,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:15,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2024-10-13 17:05:15,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:15,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 16 states and 21 transitions. [2024-10-13 17:05:15,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-13 17:05:15,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:05:15,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-10-13 17:05:15,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:15,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-13 17:05:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-10-13 17:05:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-13 17:05:15,340 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-13 17:05:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-10-13 17:05:15,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-13 17:05:15,345 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-13 17:05:15,345 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:05:15,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2024-10-13 17:05:15,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:15,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:15,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:15,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:05:15,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:05:15,347 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-13 17:05:15,347 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-13 17:05:15,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:15,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1806659569, now seen corresponding path program 1 times [2024-10-13 17:05:15,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:15,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116043184] [2024-10-13 17:05:15,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:15,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:15,465 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-13 17:05:15,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116043184] [2024-10-13 17:05:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116043184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:15,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:05:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760292023] [2024-10-13 17:05:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:15,469 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:15,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash 28740468, now seen corresponding path program 1 times [2024-10-13 17:05:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:15,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107376052] [2024-10-13 17:05:15,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:15,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:15,482 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-13 17:05:15,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:15,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107376052] [2024-10-13 17:05:15,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107376052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:05:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416678181] [2024-10-13 17:05:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:15,483 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:05:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 17:05:15,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 17:05:15,487 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-13 17:05:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:15,491 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2024-10-13 17:05:15,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2024-10-13 17:05:15,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:15,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2024-10-13 17:05:15,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:05:15,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:05:15,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-10-13 17:05:15,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:15,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-13 17:05:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-10-13 17:05:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-13 17:05:15,495 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-13 17:05:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-13 17:05:15,495 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-13 17:05:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 17:05:15,496 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-13 17:05:15,496 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:05:15,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-10-13 17:05:15,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:15,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:15,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:15,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:05:15,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:15,499 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-13 17:05:15,499 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-13 17:05:15,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1806659569, now seen corresponding path program 2 times [2024-10-13 17:05:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379532004] [2024-10-13 17:05:15,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:15,568 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-13 17:05:15,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:15,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379532004] [2024-10-13 17:05:15,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379532004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:15,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:15,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:05:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772029046] [2024-10-13 17:05:15,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:15,570 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:15,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 1 times [2024-10-13 17:05:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:15,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717468076] [2024-10-13 17:05:15,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:15,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:15,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:15,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:16,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:16,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:05:16,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:05:16,031 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-13 17:05:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:16,045 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-13 17:05:16,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-10-13 17:05:16,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:16,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2024-10-13 17:05:16,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:05:16,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:05:16,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-10-13 17:05:16,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:16,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-13 17:05:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-10-13 17:05:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-13 17:05:16,051 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-13 17:05:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-13 17:05:16,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-13 17:05:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:05:16,053 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-13 17:05:16,053 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:05:16,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-10-13 17:05:16,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:16,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:16,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:16,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:16,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:16,054 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-13 17:05:16,055 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-13 17:05:16,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1034772399, now seen corresponding path program 1 times [2024-10-13 17:05:16,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:16,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859448585] [2024-10-13 17:05:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:16,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:16,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:16,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:16,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:16,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 2 times [2024-10-13 17:05:16,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:16,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331032503] [2024-10-13 17:05:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:16,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:16,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:16,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:16,126 INFO L85 PathProgramCache]: Analyzing trace with hash 231564989, now seen corresponding path program 1 times [2024-10-13 17:05:16,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:16,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727394750] [2024-10-13 17:05:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:16,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:16,299 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-13 17:05:16,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727394750] [2024-10-13 17:05:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727394750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:16,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 17:05:16,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647504418] [2024-10-13 17:05:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:16,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:16,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 17:05:16,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 17:05:16,627 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-13 17:05:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:16,690 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-10-13 17:05:16,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2024-10-13 17:05:16,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:16,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2024-10-13 17:05:16,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-13 17:05:16,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-13 17:05:16,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2024-10-13 17:05:16,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:16,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-13 17:05:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2024-10-13 17:05:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-13 17:05:16,695 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-13 17:05:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-13 17:05:16,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-13 17:05:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 17:05:16,696 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-13 17:05:16,697 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:05:16,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2024-10-13 17:05:16,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:16,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:16,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:16,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:16,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:16,698 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-13 17:05:16,698 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-13 17:05:16,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1921544551, now seen corresponding path program 1 times [2024-10-13 17:05:16,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:16,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048979449] [2024-10-13 17:05:16,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:16,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:16,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:16,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 3 times [2024-10-13 17:05:16,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:16,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098644898] [2024-10-13 17:05:16,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:16,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:16,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:16,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:16,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash 61906447, now seen corresponding path program 1 times [2024-10-13 17:05:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:16,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059651047] [2024-10-13 17:05:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:16,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:16,955 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-13 17:05:16,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059651047] [2024-10-13 17:05:16,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059651047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753844937] [2024-10-13 17:05:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:16,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:16,959 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-13 17:05:16,961 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-13 17:05:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:17,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 17:05:17,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:17,197 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-13 17:05:17,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:05:17,303 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-13 17:05:17,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753844937] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:05:17,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:05:17,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-10-13 17:05:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493959813] [2024-10-13 17:05:17,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:05:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 17:05:17,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-10-13 17:05:17,871 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-13 17:05:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:17,991 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-10-13 17:05:17,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2024-10-13 17:05:17,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:17,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 24 states and 27 transitions. [2024-10-13 17:05:17,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-13 17:05:17,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-13 17:05:17,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2024-10-13 17:05:17,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:17,994 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-13 17:05:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2024-10-13 17:05:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-10-13 17:05:17,995 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-13 17:05:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-10-13 17:05:17,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-13 17:05:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 17:05:17,997 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-13 17:05:17,997 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:05:17,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2024-10-13 17:05:17,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 17:05:17,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:17,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:17,998 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:17,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:17,999 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-13 17:05:17,999 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-13 17:05:17,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1188957467, now seen corresponding path program 2 times [2024-10-13 17:05:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:18,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440718518] [2024-10-13 17:05:18,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:18,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:18,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 4 times [2024-10-13 17:05:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:18,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821111282] [2024-10-13 17:05:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:18,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:18,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:18,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1611060915, now seen corresponding path program 2 times [2024-10-13 17:05:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:18,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327962965] [2024-10-13 17:05:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:18,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:18,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:18,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:19,185 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:19,186 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:19,186 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:19,186 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:19,186 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:19,186 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:19,186 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:19,186 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:19,186 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2024-10-13 17:05:19,186 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:19,186 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:19,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:19,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:20,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:20,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:20,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:20,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:20,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:20,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:20,453 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:20,453 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:20,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,456 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-13 17:05:20,458 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-13 17:05:20,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:20,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:20,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:20,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:20,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,482 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-13 17:05:20,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,484 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-13 17:05:20,485 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-13 17:05:20,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:20,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:20,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:20,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:20,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,515 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-13 17:05:20,517 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-13 17:05:20,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:20,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:20,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:20,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:20,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:20,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,542 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-13 17:05:20,543 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-13 17:05:20,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:20,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:20,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:20,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:20,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:20,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,570 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-13 17:05:20,572 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-13 17:05:20,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:20,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:20,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:20,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:20,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,597 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-13 17:05:20,598 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-13 17:05:20,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:20,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:20,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:20,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:20,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:20,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,622 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-13 17:05:20,623 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-13 17:05:20,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:20,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:20,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:20,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:20,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:20,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,650 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-13 17:05:20,650 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-13 17:05:20,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-13 17:05:20,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:20,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:20,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:20,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:20,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,676 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-13 17:05:20,678 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-13 17:05:20,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:20,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:20,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:20,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:20,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,711 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-13 17:05:20,712 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-13 17:05:20,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:20,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:20,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:20,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-13 17:05:20,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,746 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-13 17:05:20,747 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-13 17:05:20,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:20,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,761 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-13 17:05:20,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,765 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-13 17:05:20,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:20,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,787 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-13 17:05:20,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,789 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-13 17:05:20,791 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-13 17:05:20,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:20,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:20,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:20,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:20,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:20,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,828 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-13 17:05:20,829 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-13 17:05:20,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:20,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:20,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:20,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:20,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:20,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:20,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:20,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:20,912 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-10-13 17:05:20,912 INFO L444 ModelExtractionUtils]: 1 out of 31 variables were initially zero. Simplification set additionally 24 variables to zero. [2024-10-13 17:05:20,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:20,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:20,914 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-13 17:05:20,915 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-13 17:05:20,916 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:20,927 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:05:20,927 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:20,927 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-13 17:05:20,938 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-13 17:05:20,955 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-10-13 17:05:20,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:21,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 17:05:21,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:21,044 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-13 17:05:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:21,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 17:05:21,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:21,397 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-13 17:05:21,432 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-13 17:05:21,433 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-13 17:05:21,433 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-13 17:05:21,604 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-13 17:05:21,606 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-13 17:05:21,606 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-13 17:05:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2024-10-13 17:05:21,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 15 letters. Loop has 7 letters. [2024-10-13 17:05:21,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:21,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 22 letters. Loop has 7 letters. [2024-10-13 17:05:21,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:21,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 15 letters. Loop has 14 letters. [2024-10-13 17:05:21,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:21,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 66 transitions. [2024-10-13 17:05:21,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-13 17:05:21,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 51 states and 60 transitions. [2024-10-13 17:05:21,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-10-13 17:05:21,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-13 17:05:21,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 60 transitions. [2024-10-13 17:05:21,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:21,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-10-13 17:05:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 60 transitions. [2024-10-13 17:05:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-10-13 17:05:21,618 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-13 17:05:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-13 17:05:21,619 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-13 17:05:21,619 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-13 17:05:21,619 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:05:21,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-10-13 17:05:21,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-13 17:05:21,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:21,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:21,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:21,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:21,621 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-13 17:05:21,621 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-13 17:05:21,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1084158749, now seen corresponding path program 3 times [2024-10-13 17:05:21,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:21,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073766639] [2024-10-13 17:05:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:21,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:21,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:21,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:21,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 5 times [2024-10-13 17:05:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:21,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012454837] [2024-10-13 17:05:21,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:21,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:21,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:21,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1280040203, now seen corresponding path program 3 times [2024-10-13 17:05:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:21,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875449855] [2024-10-13 17:05:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:21,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:21,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:22,841 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:22,841 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:22,841 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:22,841 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:22,842 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:22,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:22,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:22,842 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:22,842 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration7_Lasso [2024-10-13 17:05:22,842 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:22,842 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:22,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:22,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:23,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:23,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:23,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:23,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:23,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:23,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:23,978 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:23,978 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:23,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:23,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:23,981 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-13 17:05:23,984 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-13 17:05:23,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:23,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:23,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:23,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:23,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:23,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:23,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:23,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:23,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-13 17:05:24,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,009 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-13 17:05:24,010 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-13 17:05:24,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:24,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:24,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:24,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:24,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,037 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-13 17:05:24,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,039 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-13 17:05:24,040 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-13 17:05:24,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:24,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:24,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:24,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:24,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,064 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-13 17:05:24,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,065 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-13 17:05:24,066 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-13 17:05:24,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:24,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:24,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:24,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:24,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,092 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-13 17:05:24,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,094 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-13 17:05:24,095 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-13 17:05:24,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:24,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:24,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:24,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:24,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-13 17:05:24,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,119 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-13 17:05:24,120 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-13 17:05:24,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:24,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:24,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:24,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:24,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-13 17:05:24,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,145 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-13 17:05:24,146 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-13 17:05:24,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:24,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:24,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:24,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:24,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-13 17:05:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,171 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-13 17:05:24,172 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-13 17:05:24,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:24,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:24,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:24,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:24,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:24,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,197 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-13 17:05:24,197 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-13 17:05:24,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:24,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:24,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:24,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,229 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-13 17:05:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,230 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-13 17:05:24,231 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-13 17:05:24,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:24,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:24,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:24,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,257 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-13 17:05:24,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,258 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-13 17:05:24,259 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-13 17:05:24,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:24,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:24,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:24,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:24,297 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-13 17:05:24,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,299 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-13 17:05:24,300 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-13 17:05:24,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-13 17:05:24,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:24,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:24,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:24,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:24,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:24,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:24,333 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:24,371 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-13 17:05:24,372 INFO L444 ModelExtractionUtils]: 17 out of 31 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-13 17:05:24,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:24,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:24,374 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-13 17:05:24,375 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-13 17:05:24,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:24,390 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:05:24,391 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:24,391 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-13 17:05:24,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-13 17:05:24,424 INFO L156 tatePredicateManager]: 3 out of 6 supporting invariants were superfluous and have been removed [2024-10-13 17:05:24,430 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:05:24,431 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:05:24,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:24,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 17:05:24,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:24,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 17:05:24,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:24,725 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-13 17:05:24,725 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-13 17:05:24,726 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-13 17:05:24,880 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-13 17:05:24,880 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-13 17:05:24,881 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-13 17:05:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2024-10-13 17:05:24,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 17 letters. Loop has 7 letters. [2024-10-13 17:05:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:24,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 24 letters. Loop has 7 letters. [2024-10-13 17:05:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:24,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 17 letters. Loop has 14 letters. [2024-10-13 17:05:24,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:24,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 106 transitions. [2024-10-13 17:05:24,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-13 17:05:24,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 72 states and 88 transitions. [2024-10-13 17:05:24,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-13 17:05:24,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-13 17:05:24,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 88 transitions. [2024-10-13 17:05:24,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:24,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 88 transitions. [2024-10-13 17:05:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 88 transitions. [2024-10-13 17:05:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-10-13 17:05:24,899 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-13 17:05:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-10-13 17:05:24,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-10-13 17:05:24,900 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-10-13 17:05:24,900 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:05:24,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2024-10-13 17:05:24,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-13 17:05:24,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:24,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:24,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:24,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:05:24,904 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-13 17:05:24,905 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-13 17:05:24,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1302233657, now seen corresponding path program 1 times [2024-10-13 17:05:24,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:24,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352344639] [2024-10-13 17:05:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:24,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:24,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:24,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:24,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2024-10-13 17:05:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:24,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037808444] [2024-10-13 17:05:24,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:25,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:25,005 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-13 17:05:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:25,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:25,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2041310206, now seen corresponding path program 1 times [2024-10-13 17:05:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:25,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531263423] [2024-10-13 17:05:25,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:25,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:25,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:26,217 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:26,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:26,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:26,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:26,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:26,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:26,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:26,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:26,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration8_Lasso [2024-10-13 17:05:26,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:26,217 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:26,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:26,974 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:26,974 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:26,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:26,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:26,976 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-13 17:05:26,978 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-13 17:05:26,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:26,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:26,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:26,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:26,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:26,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:26,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:26,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:26,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,001 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-13 17:05:27,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,002 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-13 17:05:27,003 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-13 17:05:27,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:27,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:27,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:27,017 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:27,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,028 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-13 17:05:27,029 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-13 17:05:27,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:27,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:27,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:27,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:27,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:27,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,052 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-13 17:05:27,053 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-13 17:05:27,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:27,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:27,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:27,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:27,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,075 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-13 17:05:27,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,077 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-13 17:05:27,078 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-13 17:05:27,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:27,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:27,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:27,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:27,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,107 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-13 17:05:27,108 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-13 17:05:27,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:27,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,118 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-13 17:05:27,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,120 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-13 17:05:27,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:27,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,137 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-13 17:05:27,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,139 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-13 17:05:27,139 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-13 17:05:27,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:27,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:27,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:27,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,164 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-13 17:05:27,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,166 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-13 17:05:27,166 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-13 17:05:27,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:27,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:27,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:27,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,191 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-13 17:05:27,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,192 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-13 17:05:27,193 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-13 17:05:27,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:27,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:27,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:27,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:27,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,226 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-13 17:05:27,227 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-13 17:05:27,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:27,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:27,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:27,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:27,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,259 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-13 17:05:27,260 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-13 17:05:27,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:27,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:27,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:27,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:27,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:27,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:27,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,287 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-13 17:05:27,287 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-13 17:05:27,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:27,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:27,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:27,298 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 17:05:27,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:27,308 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-13 17:05:27,308 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-13 17:05:27,332 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:27,370 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-10-13 17:05:27,370 INFO L444 ModelExtractionUtils]: 18 out of 36 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-10-13 17:05:27,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:27,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:27,372 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-13 17:05:27,374 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-13 17:05:27,374 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:27,386 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-10-13 17:05:27,386 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:27,386 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0) = 1*insertionSort_~j~0 Supporting invariants [] [2024-10-13 17:05:27,397 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-13 17:05:27,406 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-13 17:05:27,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:27,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 17:05:27,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:27,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:05:27,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:27,593 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-13 17:05:27,594 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-13 17:05:27,594 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-13 17:05:27,638 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-13 17:05:27,638 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-13 17:05:27,639 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-13 17:05:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-10-13 17:05:27,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-13 17:05:27,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:27,640 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:05:27,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:27,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 17:05:27,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:27,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:05:27,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:27,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:05:27,867 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-13 17:05:27,867 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-13 17:05:27,913 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-13 17:05:27,914 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-13 17:05:27,914 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-13 17:05:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-10-13 17:05:27,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-13 17:05:27,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:27,915 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:05:27,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:27,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 17:05:27,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:28,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:05:28,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:28,086 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-13 17:05:28,086 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-13 17:05:28,087 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-13 17:05:28,151 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-13 17:05:28,151 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-13 17:05:28,152 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-13 17:05:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2024-10-13 17:05:28,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-13 17:05:28,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:28,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 24 letters. Loop has 4 letters. [2024-10-13 17:05:28,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:28,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 8 letters. [2024-10-13 17:05:28,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:28,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 153 transitions. [2024-10-13 17:05:28,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-13 17:05:28,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 48 states and 58 transitions. [2024-10-13 17:05:28,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-13 17:05:28,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-13 17:05:28,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2024-10-13 17:05:28,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:28,157 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-10-13 17:05:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2024-10-13 17:05:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2024-10-13 17:05:28,159 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-13 17:05:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-10-13 17:05:28,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-13 17:05:28,160 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-13 17:05:28,160 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 17:05:28,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2024-10-13 17:05:28,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 17:05:28,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:28,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:28,161 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-13 17:05:28,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:28,161 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-13 17:05:28,161 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-13 17:05:28,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:28,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1758050558, now seen corresponding path program 1 times [2024-10-13 17:05:28,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:28,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041250125] [2024-10-13 17:05:28,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:28,204 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-13 17:05:28,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:28,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041250125] [2024-10-13 17:05:28,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041250125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:05:28,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:05:28,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:05:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359986828] [2024-10-13 17:05:28,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:05:28,206 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:05:28,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1842592362, now seen corresponding path program 1 times [2024-10-13 17:05:28,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:28,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915360928] [2024-10-13 17:05:28,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:28,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:28,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:05:29,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:05:29,000 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-13 17:05:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:29,010 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-10-13 17:05:29,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2024-10-13 17:05:29,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-13 17:05:29,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 47 transitions. [2024-10-13 17:05:29,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-13 17:05:29,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-10-13 17:05:29,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2024-10-13 17:05:29,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:29,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-10-13 17:05:29,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2024-10-13 17:05:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-13 17:05:29,014 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-13 17:05:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-13 17:05:29,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-13 17:05:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:05:29,016 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-13 17:05:29,016 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 17:05:29,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2024-10-13 17:05:29,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 17:05:29,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:29,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:29,018 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-13 17:05:29,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:29,018 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-13 17:05:29,018 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-13 17:05:29,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1757990976, now seen corresponding path program 2 times [2024-10-13 17:05:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545561748] [2024-10-13 17:05:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:29,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:29,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:29,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:29,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1842592362, now seen corresponding path program 2 times [2024-10-13 17:05:29,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:29,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765591576] [2024-10-13 17:05:29,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:29,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:29,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:29,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:29,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:29,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1753667593, now seen corresponding path program 3 times [2024-10-13 17:05:29,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:29,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164620485] [2024-10-13 17:05:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:29,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:29,269 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-13 17:05:29,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:29,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164620485] [2024-10-13 17:05:29,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164620485] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:29,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642844737] [2024-10-13 17:05:29,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 17:05:29,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:29,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:29,274 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-13 17:05:29,275 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-13 17:05:29,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 17:05:29,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:05:29,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:05:29,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:29,407 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-13 17:05:29,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:05:29,476 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-13 17:05:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642844737] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:05:29,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:05:29,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2024-10-13 17:05:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137798316] [2024-10-13 17:05:29,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:05:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:05:30,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 17:05:30,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-13 17:05:30,247 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-13 17:05:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:30,370 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-10-13 17:05:30,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2024-10-13 17:05:30,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-13 17:05:30,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 66 transitions. [2024-10-13 17:05:30,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-10-13 17:05:30,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-13 17:05:30,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2024-10-13 17:05:30,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:30,372 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-10-13 17:05:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2024-10-13 17:05:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2024-10-13 17:05:30,374 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-13 17:05:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-13 17:05:30,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-13 17:05:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 17:05:30,375 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-13 17:05:30,375 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 17:05:30,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2024-10-13 17:05:30,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 17:05:30,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:30,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:30,376 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-13 17:05:30,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:30,377 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-13 17:05:30,377 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-13 17:05:30,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:30,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1336854580, now seen corresponding path program 4 times [2024-10-13 17:05:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:30,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844500203] [2024-10-13 17:05:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:30,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:30,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:30,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash -496333001, now seen corresponding path program 6 times [2024-10-13 17:05:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717977074] [2024-10-13 17:05:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:30,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:30,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:30,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash 623643916, now seen corresponding path program 5 times [2024-10-13 17:05:30,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:30,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983657027] [2024-10-13 17:05:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:30,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:05:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:05:30,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:05:32,161 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:05:32,161 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:05:32,161 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:05:32,161 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:05:32,161 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:05:32,161 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:32,161 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:05:32,161 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:05:32,161 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration11_Lasso [2024-10-13 17:05:32,161 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:05:32,162 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:05:32,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:32,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:05:33,906 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:05:33,906 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:05:33,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:33,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:33,908 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-13 17:05:33,910 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-13 17:05:33,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:33,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:33,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:33,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:33,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:33,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:33,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:33,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:33,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:33,933 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-13 17:05:33,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:33,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:33,936 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-13 17:05:33,937 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-13 17:05:33,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:33,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:33,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:33,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:33,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:33,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:33,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:33,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:33,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:33,960 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-13 17:05:33,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:33,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:33,962 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-13 17:05:33,963 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-13 17:05:33,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:33,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:33,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:33,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:33,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:33,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:33,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:33,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:33,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:33,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:33,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:33,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:33,987 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-13 17:05:33,988 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-13 17:05:33,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:33,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:33,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:33,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:33,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:33,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:33,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:33,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,011 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-13 17:05:34,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,013 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-13 17:05:34,014 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-13 17:05:34,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:34,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:34,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:34,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:34,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,038 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-13 17:05:34,038 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-13 17:05:34,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:34,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:34,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:34,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-13 17:05:34,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,063 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-13 17:05:34,063 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-13 17:05:34,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:34,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:34,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:34,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,086 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-13 17:05:34,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,087 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-13 17:05:34,089 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-13 17:05:34,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:34,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:34,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:34,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,112 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-13 17:05:34,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,114 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-13 17:05:34,115 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-13 17:05:34,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:34,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:34,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:34,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,137 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-13 17:05:34,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,138 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-13 17:05:34,140 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-13 17:05:34,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:34,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:34,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:34,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:34,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,166 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-13 17:05:34,167 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-13 17:05:34,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:05:34,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:34,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:34,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:34,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,192 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-13 17:05:34,193 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-13 17:05:34,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:34,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:34,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:34,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,216 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-13 17:05:34,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,218 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-13 17:05:34,218 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-13 17:05:34,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:34,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:05:34,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:05:34,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:05:34,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,241 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-13 17:05:34,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,242 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-13 17:05:34,243 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-13 17:05:34,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:34,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:34,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:34,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,269 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-13 17:05:34,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,270 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-13 17:05:34,271 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-13 17:05:34,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:34,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,282 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 17:05:34,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,319 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-13 17:05:34,319 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-13 17:05:34,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,400 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-13 17:05:34,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,402 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-13 17:05:34,403 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-13 17:05:34,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:34,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:34,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:34,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:05:34,441 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-13 17:05:34,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,443 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-13 17:05:34,444 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-13 17:05:34,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-13 17:05:34,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:05:34,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:05:34,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:05:34,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:05:34,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:05:34,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:05:34,489 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:05:34,550 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-10-13 17:05:34,550 INFO L444 ModelExtractionUtils]: 14 out of 31 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-13 17:05:34,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:05:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:34,553 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-13 17:05:34,554 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-13 17:05:34,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:05:34,568 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:05:34,568 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:05:34,568 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~size, insertionSort_~i) = 1*insertionSort_~size - 1*insertionSort_~i Supporting invariants [] [2024-10-13 17:05:34,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-13 17:05:34,596 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-13 17:05:34,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:34,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:05:34,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:34,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:05:34,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:34,747 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-13 17:05:34,748 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-13 17:05:34,748 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-13 17:05:34,783 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-13 17:05:34,784 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-13 17:05:34,785 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-13 17:05:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-13 17:05:34,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2024-10-13 17:05:34,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:34,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2024-10-13 17:05:34,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:34,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2024-10-13 17:05:34,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:05:34,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 90 transitions. [2024-10-13 17:05:34,787 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:05:34,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2024-10-13 17:05:34,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-13 17:05:34,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-13 17:05:34,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-13 17:05:34,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:05:34,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:05:34,788 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:05:34,788 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:05:34,788 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 17:05:34,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-13 17:05:34,788 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:05:34,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-13 17:05:34,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:05:34 BoogieIcfgContainer [2024-10-13 17:05:34,797 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:05:34,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:05:34,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:05:34,798 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:05:34,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:05:13" (3/4) ... [2024-10-13 17:05:34,801 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 17:05:34,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:05:34,803 INFO L158 Benchmark]: Toolchain (without parser) took 21649.48ms. Allocated memory was 155.2MB in the beginning and 371.2MB in the end (delta: 216.0MB). Free memory was 101.3MB in the beginning and 135.5MB in the end (delta: -34.2MB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. [2024-10-13 17:05:34,803 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:05:34,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.19ms. Allocated memory is still 155.2MB. Free memory was 100.8MB in the beginning and 89.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 17:05:34,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.83ms. Allocated memory is still 155.2MB. Free memory was 89.4MB in the beginning and 87.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:05:34,803 INFO L158 Benchmark]: Boogie Preprocessor took 48.61ms. Allocated memory is still 155.2MB. Free memory was 87.8MB in the beginning and 86.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:05:34,804 INFO L158 Benchmark]: RCFGBuilder took 342.35ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 73.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:05:34,804 INFO L158 Benchmark]: BuchiAutomizer took 20964.90ms. Allocated memory was 155.2MB in the beginning and 371.2MB in the end (delta: 216.0MB). Free memory was 73.6MB in the beginning and 136.6MB in the end (delta: -63.0MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. [2024-10-13 17:05:34,804 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 371.2MB. Free memory was 136.6MB in the beginning and 135.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:05:34,806 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.23ms. Allocated memory is still 155.2MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.19ms. Allocated memory is still 155.2MB. Free memory was 100.8MB in the beginning and 89.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.83ms. Allocated memory is still 155.2MB. Free memory was 89.4MB in the beginning and 87.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.61ms. Allocated memory is still 155.2MB. Free memory was 87.8MB in the beginning and 86.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 342.35ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 73.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 20964.90ms. Allocated memory was 155.2MB in the beginning and 371.2MB in the end (delta: 216.0MB). Free memory was 73.6MB in the beginning and 136.6MB in the end (delta: -63.0MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 371.2MB. Free memory was 136.6MB in the beginning and 135.5MB in the end (delta: 1.0MB). 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.9s 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: 100ms 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-13 17:05:34,832 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-13 17:05:35,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2024-10-13 17:05:35,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 17:05:35,435 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