./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 15:28:17,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:28:17,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:28:17,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:28:17,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:28:18,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:28:18,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:28:18,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:28:18,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:28:18,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:28:18,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:28:18,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:28:18,012 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:28:18,012 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:28:18,012 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:28:18,013 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:28:18,013 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:28:18,013 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:28:18,014 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:28:18,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:28:18,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:28:18,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:28:18,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:28:18,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:28:18,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:28:18,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:28:18,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:28:18,020 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:28:18,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:28:18,020 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:28:18,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:28:18,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:28:18,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:28:18,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:28:18,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:28:18,025 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:28:18,026 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-11-09 15:28:18,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:28:18,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:28:18,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:28:18,310 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:28:18,310 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:28:18,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-11-09 15:28:19,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:28:19,956 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:28:19,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-11-09 15:28:19,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4955c86/458847b0e0f54e34a4f5588af2240b49/FLAG9125d3a85 [2024-11-09 15:28:20,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4955c86/458847b0e0f54e34a4f5588af2240b49 [2024-11-09 15:28:20,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:28:20,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:28:20,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:20,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:28:20,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:28:20,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6daac6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20, skipping insertion in model container [2024-11-09 15:28:20,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:28:20,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:20,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:28:20,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:20,585 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:28:20,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20 WrapperNode [2024-11-09 15:28:20,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:20,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:20,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:28:20,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:28:20,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,622 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2024-11-09 15:28:20,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:20,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:28:20,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:28:20,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:28:20,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,656 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-11-09 15:28:20,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:28:20,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:28:20,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:28:20,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:28:20,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (1/1) ... [2024-11-09 15:28:20,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:20,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:20,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:20,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:28:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:28:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 15:28:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2024-11-09 15:28:20,764 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2024-11-09 15:28:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:28:20,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:28:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:28:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:28:20,837 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:28:20,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:28:20,997 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 15:28:20,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:28:21,010 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:28:21,010 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:28:21,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:21 BoogieIcfgContainer [2024-11-09 15:28:21,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:28:21,011 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:28:21,012 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:28:21,015 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:28:21,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:21,018 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:28:20" (1/3) ... [2024-11-09 15:28:21,019 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cdb0839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:21, skipping insertion in model container [2024-11-09 15:28:21,019 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:21,019 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:20" (2/3) ... [2024-11-09 15:28:21,021 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cdb0839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:21, skipping insertion in model container [2024-11-09 15:28:21,021 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:21,021 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:21" (3/3) ... [2024-11-09 15:28:21,023 INFO L332 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2024-11-09 15:28:21,080 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:28:21,080 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:28:21,080 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:28:21,080 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:28:21,080 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:28:21,081 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:28:21,081 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:28:21,082 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:28:21,086 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-11-09 15:28:21,106 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-09 15:28:21,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:21,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:21,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:28:21,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:21,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:28:21,112 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-11-09 15:28:21,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-09 15:28:21,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:21,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:21,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:28:21,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:21,125 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-11-09 15:28:21,126 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-11-09 15:28:21,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2024-11-09 15:28:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595691060] [2024-11-09 15:28:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:21,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:21,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:21,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2024-11-09 15:28:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:21,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445463928] [2024-11-09 15:28:21,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:21,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:21,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:21,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:21,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2024-11-09 15:28:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:21,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005849816] [2024-11-09 15:28:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:21,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:21,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:21,652 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:21,653 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:21,653 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:21,653 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:21,653 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:21,653 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:21,654 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:21,654 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:21,654 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2024-11-09 15:28:21,654 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:21,654 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:21,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:21,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:21,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:21,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:21,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:21,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:21,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:22,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:22,068 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:22,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:22,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:22,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:22,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:28:22,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:22,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:22,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:22,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:22,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:22,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:22,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:22,116 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:22,140 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:28:22,140 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-09 15:28:22,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:22,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:22,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:22,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:28:22,168 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:22,182 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:22,183 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:22,184 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-11-09 15:28:22,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-09 15:28:22,204 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-09 15:28:22,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:22,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:28:22,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:22,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:22,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:22,309 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:28:22,312 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-11-09 15:28:22,370 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-11-09 15:28:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:22,376 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-11-09 15:28:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-11-09 15:28:22,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-09 15:28:22,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:22,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-09 15:28:22,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:22,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-09 15:28:22,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:22,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2024-11-09 15:28:22,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:22,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 16 states and 21 transitions. [2024-11-09 15:28:22,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-09 15:28:22,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:28:22,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-11-09 15:28:22,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:22,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-09 15:28:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-11-09 15:28:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 15:28:22,414 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-11-09 15:28:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-11-09 15:28:22,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-09 15:28:22,416 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-09 15:28:22,416 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:28:22,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2024-11-09 15:28:22,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:22,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:22,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:22,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:28:22,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:28:22,418 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-11-09 15:28:22,418 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-11-09 15:28:22,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1806659569, now seen corresponding path program 1 times [2024-11-09 15:28:22,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:22,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574520638] [2024-11-09 15:28:22,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:22,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:22,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:22,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574520638] [2024-11-09 15:28:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574520638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:22,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:22,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178814132] [2024-11-09 15:28:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:22,528 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:22,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:22,529 INFO L85 PathProgramCache]: Analyzing trace with hash 28740468, now seen corresponding path program 1 times [2024-11-09 15:28:22,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:22,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720925879] [2024-11-09 15:28:22,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:22,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720925879] [2024-11-09 15:28:22,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720925879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:22,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:22,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:28:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291060437] [2024-11-09 15:28:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:22,545 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:28:22,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:22,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 15:28:22,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 15:28:22,549 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-11-09 15:28:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:22,553 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2024-11-09 15:28:22,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2024-11-09 15:28:22,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:22,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2024-11-09 15:28:22,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:28:22,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:28:22,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-11-09 15:28:22,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:22,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-09 15:28:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-11-09 15:28:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 15:28:22,558 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-11-09 15:28:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-09 15:28:22,559 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-09 15:28:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 15:28:22,559 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-09 15:28:22,560 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:28:22,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-11-09 15:28:22,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:22,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:22,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:22,561 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:28:22,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:22,561 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-11-09 15:28:22,562 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-11-09 15:28:22,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1806659569, now seen corresponding path program 2 times [2024-11-09 15:28:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:22,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411361578] [2024-11-09 15:28:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:22,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:22,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411361578] [2024-11-09 15:28:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411361578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:22,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:22,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:22,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502678942] [2024-11-09 15:28:22,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:22,603 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:22,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 1 times [2024-11-09 15:28:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:22,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197707784] [2024-11-09 15:28:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:22,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:22,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:22,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:22,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:28:22,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:28:22,977 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-11-09 15:28:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:22,987 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-11-09 15:28:22,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2024-11-09 15:28:22,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:22,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2024-11-09 15:28:22,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-09 15:28:22,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-09 15:28:22,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2024-11-09 15:28:22,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:22,989 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-09 15:28:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2024-11-09 15:28:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-09 15:28:22,990 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-11-09 15:28:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-09 15:28:22,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-09 15:28:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:28:22,992 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-09 15:28:22,992 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:28:22,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2024-11-09 15:28:22,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:22,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:22,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:22,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:22,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:22,993 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-11-09 15:28:22,993 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-11-09 15:28:22,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1034772399, now seen corresponding path program 1 times [2024-11-09 15:28:22,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:22,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185909667] [2024-11-09 15:28:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:22,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:23,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 2 times [2024-11-09 15:28:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178869942] [2024-11-09 15:28:23,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:23,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:23,057 INFO L85 PathProgramCache]: Analyzing trace with hash 231564989, now seen corresponding path program 1 times [2024-11-09 15:28:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:23,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590076410] [2024-11-09 15:28:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:28:23,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:23,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590076410] [2024-11-09 15:28:23,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590076410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:23,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:23,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 15:28:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634319262] [2024-11-09 15:28:23,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:23,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:28:23,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:23,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:28:23,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:28:23,614 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-11-09 15:28:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:23,664 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-09 15:28:23,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2024-11-09 15:28:23,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:23,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2024-11-09 15:28:23,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-09 15:28:23,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-09 15:28:23,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2024-11-09 15:28:23,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:23,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-09 15:28:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2024-11-09 15:28:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-11-09 15:28:23,667 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-11-09 15:28:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-09 15:28:23,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 15:28:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:28:23,669 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 15:28:23,669 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:28:23,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2024-11-09 15:28:23,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:23,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:23,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:23,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:23,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:23,670 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-11-09 15:28:23,670 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-11-09 15:28:23,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:23,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1921544551, now seen corresponding path program 1 times [2024-11-09 15:28:23,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:23,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467508272] [2024-11-09 15:28:23,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:23,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:23,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 3 times [2024-11-09 15:28:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907301477] [2024-11-09 15:28:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash 61906447, now seen corresponding path program 1 times [2024-11-09 15:28:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140917020] [2024-11-09 15:28:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:23,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140917020] [2024-11-09 15:28:23,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140917020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:23,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930334311] [2024-11-09 15:28:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:23,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:23,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:23,909 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-11-09 15:28:23,910 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-11-09 15:28:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:23,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:28:23,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:24,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:24,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930334311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:24,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:24,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-11-09 15:28:24,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311051469] [2024-11-09 15:28:24,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:24,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 15:28:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-09 15:28:24,694 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-11-09 15:28:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:24,801 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-09 15:28:24,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2024-11-09 15:28:24,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:24,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 24 states and 27 transitions. [2024-11-09 15:28:24,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:28:24,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-09 15:28:24,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2024-11-09 15:28:24,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:24,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-09 15:28:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2024-11-09 15:28:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-09 15:28:24,812 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-11-09 15:28:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-09 15:28:24,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-09 15:28:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:28:24,814 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-09 15:28:24,814 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:28:24,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2024-11-09 15:28:24,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:28:24,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:24,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:24,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:24,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:24,816 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-11-09 15:28:24,816 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-11-09 15:28:24,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1188957467, now seen corresponding path program 2 times [2024-11-09 15:28:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:24,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220594307] [2024-11-09 15:28:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:24,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:24,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 4 times [2024-11-09 15:28:24,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:24,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665412742] [2024-11-09 15:28:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:24,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:24,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1611060915, now seen corresponding path program 2 times [2024-11-09 15:28:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242320914] [2024-11-09 15:28:24,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:24,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:25,929 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:25,929 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:25,929 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:25,929 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:25,929 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:25,929 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:25,929 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:25,929 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:25,929 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2024-11-09 15:28:25,929 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:25,929 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:25,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:26,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:26,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:26,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:26,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:26,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:26,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:27,091 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:27,091 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:27,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:28:27,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-11-09 15:28:27,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:28:27,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:28:27,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:27,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,148 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:28:27,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,175 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-11-09 15:28:27,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:28:27,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,204 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-11-09 15:28:27,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,206 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:28:27,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,230 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-11-09 15:28:27,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:28:27,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,256 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-11-09 15:28:27,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,257 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-11-09 15:28:27,258 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-11-09 15:28:27,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:28:27,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,282 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:28:27,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:27,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,309 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:28:27,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:27,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:27,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,341 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:28:27,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:27,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,374 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-11-09 15:28:27,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,377 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:28:27,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,392 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-09 15:28:27,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,396 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-09 15:28:27,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-09 15:28:27,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,422 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:28:27,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:27,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,453 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-11-09 15:28:27,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,455 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:28:27,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:27,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:27,545 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-11-09 15:28:27,545 INFO L444 ModelExtractionUtils]: 1 out of 31 variables were initially zero. Simplification set additionally 24 variables to zero. [2024-11-09 15:28:27,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,548 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:28:27,552 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:27,566 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-09 15:28:27,566 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:27,566 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-11-09 15:28:27,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:28:27,598 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:28:27,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:27,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:28:27,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:27,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 15:28:27,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:27,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 15:28:27,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:28,060 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-11-09 15:28:28,060 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-11-09 15:28:28,268 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-11-09 15:28:28,270 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-11-09 15:28:28,271 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-11-09 15:28:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 39 transitions. [2024-11-09 15:28:28,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 15 letters. Loop has 7 letters. [2024-11-09 15:28:28,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:28,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 22 letters. Loop has 7 letters. [2024-11-09 15:28:28,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:28,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 39 transitions. Stem has 15 letters. Loop has 14 letters. [2024-11-09 15:28:28,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:28,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 66 transitions. [2024-11-09 15:28:28,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:28:28,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 51 states and 60 transitions. [2024-11-09 15:28:28,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-09 15:28:28,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-09 15:28:28,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 60 transitions. [2024-11-09 15:28:28,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:28,280 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-11-09 15:28:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 60 transitions. [2024-11-09 15:28:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-11-09 15:28:28,284 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-11-09 15:28:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-09 15:28:28,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-09 15:28:28,284 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-09 15:28:28,284 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:28:28,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-09 15:28:28,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:28:28,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:28,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:28,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:28,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:28,288 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-11-09 15:28:28,288 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-11-09 15:28:28,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:28,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1084158749, now seen corresponding path program 3 times [2024-11-09 15:28:28,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:28,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018202541] [2024-11-09 15:28:28,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:28,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:28,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 5 times [2024-11-09 15:28:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676913369] [2024-11-09 15:28:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:28,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:28,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1280040203, now seen corresponding path program 3 times [2024-11-09 15:28:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:28,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587310641] [2024-11-09 15:28:28,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:29,412 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:29,412 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:29,412 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:29,413 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:29,413 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:29,413 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:29,413 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:29,413 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:29,413 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration7_Lasso [2024-11-09 15:28:29,413 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:29,413 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:29,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:29,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,462 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:30,462 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:30,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,465 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:28:30,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:30,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,495 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:28:30,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,523 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-11-09 15:28:30,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,525 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:28:30,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,548 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-11-09 15:28:30,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,549 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:28:30,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:28:30,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,574 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:28:30,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:30,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,599 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:28:30,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:30,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,624 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:28:30,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:30,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,649 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:28:30,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-09 15:28:30,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,674 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:28:30,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:30,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:30,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:30,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,702 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:28:30,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:30,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:30,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,729 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-11-09 15:28:30,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,730 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:28:30,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:30,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:30,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,776 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:30,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:28:30,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:30,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:30,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:30,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:30,852 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-09 15:28:30,853 INFO L444 ModelExtractionUtils]: 17 out of 31 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 15:28:30,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,855 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-11-09 15:28:30,856 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-11-09 15:28:30,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:30,872 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-09 15:28:30,872 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:30,872 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-11-09 15:28:30,887 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-11-09 15:28:30,909 INFO L156 tatePredicateManager]: 3 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:28:30,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:28:30,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:28:30,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:30,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:28:30,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:31,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 15:28:31,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:31,237 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-11-09 15:28:31,237 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-11-09 15:28:31,367 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-11-09 15:28:31,370 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-11-09 15:28:31,371 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-11-09 15:28:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2024-11-09 15:28:31,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 17 letters. Loop has 7 letters. [2024-11-09 15:28:31,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:31,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 24 letters. Loop has 7 letters. [2024-11-09 15:28:31,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:31,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 23 transitions. Stem has 17 letters. Loop has 14 letters. [2024-11-09 15:28:31,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:31,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 106 transitions. [2024-11-09 15:28:31,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:28:31,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 72 states and 88 transitions. [2024-11-09 15:28:31,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-09 15:28:31,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-09 15:28:31,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 88 transitions. [2024-11-09 15:28:31,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:31,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 88 transitions. [2024-11-09 15:28:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 88 transitions. [2024-11-09 15:28:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-11-09 15:28:31,379 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-11-09 15:28:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-11-09 15:28:31,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-11-09 15:28:31,380 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-11-09 15:28:31,380 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:28:31,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2024-11-09 15:28:31,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:28:31,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:31,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:31,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:31,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:28:31,382 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-11-09 15:28:31,383 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-11-09 15:28:31,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1302233657, now seen corresponding path program 1 times [2024-11-09 15:28:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:31,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227557638] [2024-11-09 15:28:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:31,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:31,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:31,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2024-11-09 15:28:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881428094] [2024-11-09 15:28:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:31,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:31,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:31,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:31,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2041310206, now seen corresponding path program 1 times [2024-11-09 15:28:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:31,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12920367] [2024-11-09 15:28:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:31,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:31,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:31,886 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-11-09 15:28:32,623 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:32,623 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:32,623 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:32,623 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:32,623 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:32,623 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:32,623 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:32,623 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:32,623 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration8_Lasso [2024-11-09 15:28:32,623 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:32,623 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:32,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:32,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,335 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:33,335 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:33,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,339 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-11-09 15:28:33,340 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-11-09 15:28:33,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:33,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:33,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:33,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,366 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-11-09 15:28:33,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,368 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-11-09 15:28:33,368 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-11-09 15:28:33,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:33,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:33,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,392 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-11-09 15:28:33,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,394 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:33,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:28:33,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:33,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:33,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:33,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-09 15:28:33,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,418 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:33,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:28:33,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:33,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:33,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:33,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:33,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,445 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:33,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-09 15:28:33,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:33,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:33,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-09 15:28:33,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,471 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:33,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-09 15:28:33,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,482 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-09 15:28:33,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,485 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-09 15:28:33,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:33,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:33,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,507 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-11-09 15:28:33,507 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-11-09 15:28:33,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:33,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:33,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:33,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,534 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-11-09 15:28:33,535 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-11-09 15:28:33,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:33,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:33,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:33,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,561 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-11-09 15:28:33,562 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-11-09 15:28:33,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:33,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:33,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,587 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-11-09 15:28:33,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,589 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-11-09 15:28:33,590 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-11-09 15:28:33,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:33,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:33,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,623 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-11-09 15:28:33,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,625 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-11-09 15:28:33,628 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-11-09 15:28:33,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:33,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:33,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:33,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:33,663 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-11-09 15:28:33,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,665 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-11-09 15:28:33,667 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-11-09 15:28:33,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:33,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:33,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:33,678 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:28:33,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:33,687 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-09 15:28:33,687 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-09 15:28:33,711 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:33,747 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-09 15:28:33,747 INFO L444 ModelExtractionUtils]: 18 out of 36 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-09 15:28:33,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:33,748 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-11-09 15:28:33,749 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-11-09 15:28:33,749 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:33,761 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-09 15:28:33,761 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:33,761 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0) = 1*insertionSort_~j~0 Supporting invariants [] [2024-11-09 15:28:33,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:33,781 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:28:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:33,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:28:33,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:33,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:33,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:33,938 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-11-09 15:28:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:33,976 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-11-09 15:28:33,976 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-11-09 15:28:34,024 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-11-09 15:28:34,026 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-11-09 15:28:34,027 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-11-09 15:28:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-11-09 15:28:34,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 20 letters. Loop has 4 letters. [2024-11-09 15:28:34,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:34,029 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:28:34,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:34,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:28:34,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:34,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:34,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:34,194 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-11-09 15:28:34,194 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-11-09 15:28:34,229 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-11-09 15:28:34,231 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-11-09 15:28:34,232 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-11-09 15:28:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-11-09 15:28:34,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 20 letters. Loop has 4 letters. [2024-11-09 15:28:34,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:34,232 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:28:34,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:34,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:28:34,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:34,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:34,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:34,416 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-11-09 15:28:34,416 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-11-09 15:28:34,500 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-11-09 15:28:34,502 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-11-09 15:28:34,503 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-11-09 15:28:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2024-11-09 15:28:34,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 4 letters. [2024-11-09 15:28:34,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:34,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 24 letters. Loop has 4 letters. [2024-11-09 15:28:34,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:34,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 8 letters. [2024-11-09 15:28:34,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:34,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 153 transitions. [2024-11-09 15:28:34,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-09 15:28:34,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 48 states and 58 transitions. [2024-11-09 15:28:34,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-09 15:28:34,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-09 15:28:34,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2024-11-09 15:28:34,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:34,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-09 15:28:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2024-11-09 15:28:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2024-11-09 15:28:34,516 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-11-09 15:28:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-11-09 15:28:34,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-09 15:28:34,519 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-09 15:28:34,520 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:28:34,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2024-11-09 15:28:34,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:28:34,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:34,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:34,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:34,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:34,521 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-11-09 15:28:34,522 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-11-09 15:28:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1758050558, now seen corresponding path program 1 times [2024-11-09 15:28:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:34,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695087468] [2024-11-09 15:28:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:34,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 15:28:34,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:34,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695087468] [2024-11-09 15:28:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695087468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:34,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:34,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774340531] [2024-11-09 15:28:34,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:34,571 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:34,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1842592362, now seen corresponding path program 1 times [2024-11-09 15:28:34,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:34,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703929481] [2024-11-09 15:28:34,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:34,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:34,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:34,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:35,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:28:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:28:35,382 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-11-09 15:28:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:35,388 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-09 15:28:35,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2024-11-09 15:28:35,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:28:35,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 47 transitions. [2024-11-09 15:28:35,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-09 15:28:35,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-09 15:28:35,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2024-11-09 15:28:35,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:35,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-09 15:28:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2024-11-09 15:28:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-09 15:28:35,391 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-11-09 15:28:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-09 15:28:35,394 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-09 15:28:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:28:35,396 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-09 15:28:35,396 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:28:35,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2024-11-09 15:28:35,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:28:35,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:35,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:35,397 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-11-09 15:28:35,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:35,397 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-11-09 15:28:35,398 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-11-09 15:28:35,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1757990976, now seen corresponding path program 2 times [2024-11-09 15:28:35,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:35,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190462386] [2024-11-09 15:28:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:35,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1842592362, now seen corresponding path program 2 times [2024-11-09 15:28:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:35,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830114200] [2024-11-09 15:28:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:35,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1753667593, now seen corresponding path program 3 times [2024-11-09 15:28:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:35,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576299649] [2024-11-09 15:28:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 15:28:35,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:35,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576299649] [2024-11-09 15:28:35,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576299649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:35,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876059696] [2024-11-09 15:28:35,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:28:35,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:35,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:35,615 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-11-09 15:28:35,616 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-11-09 15:28:35,696 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 15:28:35,696 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:28:35,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:28:35,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 15:28:35,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 15:28:35,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876059696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:35,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:35,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2024-11-09 15:28:35,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815149644] [2024-11-09 15:28:35,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:36,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:28:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:28:36,571 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-11-09 15:28:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:36,687 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-11-09 15:28:36,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2024-11-09 15:28:36,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:28:36,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 66 transitions. [2024-11-09 15:28:36,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-09 15:28:36,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-09 15:28:36,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2024-11-09 15:28:36,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:36,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-11-09 15:28:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2024-11-09 15:28:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2024-11-09 15:28:36,691 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-11-09 15:28:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-09 15:28:36,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-09 15:28:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 15:28:36,696 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-09 15:28:36,696 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:28:36,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2024-11-09 15:28:36,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-09 15:28:36,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:36,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:36,697 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-11-09 15:28:36,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:36,698 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-11-09 15:28:36,698 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-11-09 15:28:36,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1336854580, now seen corresponding path program 4 times [2024-11-09 15:28:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:36,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412988326] [2024-11-09 15:28:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:36,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:36,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:36,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:36,728 INFO L85 PathProgramCache]: Analyzing trace with hash -496333001, now seen corresponding path program 6 times [2024-11-09 15:28:36,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:36,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359446969] [2024-11-09 15:28:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:36,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:36,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:36,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 623643916, now seen corresponding path program 5 times [2024-11-09 15:28:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:36,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191880449] [2024-11-09 15:28:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:36,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:36,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:38,395 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:38,395 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:38,395 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:38,395 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:38,395 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:38,395 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:38,395 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:38,395 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:38,395 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration11_Lasso [2024-11-09 15:28:38,395 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:38,395 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:38,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:38,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:39,996 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:39,996 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:39,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:39,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:39,999 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-11-09 15:28:40,000 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-11-09 15:28:40,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,023 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-11-09 15:28:40,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,024 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-11-09 15:28:40,025 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-11-09 15:28:40,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,048 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-11-09 15:28:40,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,049 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-11-09 15:28:40,050 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-11-09 15:28:40,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-09 15:28:40,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,074 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-11-09 15:28:40,075 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-11-09 15:28:40,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,097 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-11-09 15:28:40,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,098 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-11-09 15:28:40,099 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-11-09 15:28:40,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-09 15:28:40,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,123 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-11-09 15:28:40,123 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-11-09 15:28:40,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,145 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-11-09 15:28:40,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,147 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-11-09 15:28:40,147 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-11-09 15:28:40,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,169 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-11-09 15:28:40,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,171 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-11-09 15:28:40,172 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-11-09 15:28:40,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-11-09 15:28:40,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,198 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-11-09 15:28:40,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,200 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-11-09 15:28:40,200 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-11-09 15:28:40,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,222 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-11-09 15:28:40,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,223 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-11-09 15:28:40,224 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-11-09 15:28:40,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-09 15:28:40,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,248 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-11-09 15:28:40,248 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-11-09 15:28:40,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,276 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-11-09 15:28:40,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,278 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-11-09 15:28:40,278 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-11-09 15:28:40,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,301 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-11-09 15:28:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,302 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-11-09 15:28:40,303 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-11-09 15:28:40,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:40,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:40,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:40,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,325 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-11-09 15:28:40,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,326 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-11-09 15:28:40,327 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-11-09 15:28:40,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:40,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:40,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,352 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-11-09 15:28:40,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,353 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-11-09 15:28:40,354 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-11-09 15:28:40,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,366 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:28:40,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,400 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-09 15:28:40,400 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-09 15:28:40,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,480 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-11-09 15:28:40,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,483 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-11-09 15:28:40,493 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-11-09 15:28:40,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:40,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:40,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:40,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:40,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,531 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-11-09 15:28:40,532 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-11-09 15:28:40,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:40,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:40,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:40,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:40,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:40,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:40,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:40,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:40,632 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-11-09 15:28:40,633 INFO L444 ModelExtractionUtils]: 14 out of 31 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-09 15:28:40,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:40,635 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-11-09 15:28:40,636 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-11-09 15:28:40,637 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:40,650 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:40,650 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:40,650 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~size, insertionSort_~i) = 1*insertionSort_~size - 1*insertionSort_~i Supporting invariants [] [2024-11-09 15:28:40,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:40,677 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-09 15:28:40,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:40,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:40,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:40,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:28:40,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:40,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-09 15:28:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:40,847 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-11-09 15:28:40,847 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-11-09 15:28:40,878 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-11-09 15:28:40,879 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-11-09 15:28:40,879 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-11-09 15:28:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-09 15:28:40,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2024-11-09 15:28:40,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:40,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2024-11-09 15:28:40,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:40,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2024-11-09 15:28:40,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:40,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 90 transitions. [2024-11-09 15:28:40,882 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:28:40,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2024-11-09 15:28:40,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:28:40,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:28:40,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:28:40,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:40,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:40,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:40,882 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:40,883 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:28:40,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:28:40,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:28:40,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:28:40,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:28:40 BoogieIcfgContainer [2024-11-09 15:28:40,889 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:28:40,890 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:28:40,890 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:28:40,890 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:28:40,890 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:21" (3/4) ... [2024-11-09 15:28:40,892 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:28:40,893 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:28:40,894 INFO L158 Benchmark]: Toolchain (without parser) took 20545.83ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 121.6MB in the beginning and 219.1MB in the end (delta: -97.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:40,894 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 178.3MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:40,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.81ms. Allocated memory is still 178.3MB. Free memory was 121.2MB in the beginning and 109.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:28:40,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 178.3MB. Free memory was 109.0MB in the beginning and 107.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:28:40,895 INFO L158 Benchmark]: Boogie Preprocessor took 52.16ms. Allocated memory is still 178.3MB. Free memory was 107.7MB in the beginning and 105.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:28:40,895 INFO L158 Benchmark]: RCFGBuilder took 333.77ms. Allocated memory is still 178.3MB. Free memory was 105.7MB in the beginning and 93.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:28:40,895 INFO L158 Benchmark]: BuchiAutomizer took 19877.86ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 93.1MB in the beginning and 219.1MB in the end (delta: -126.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:40,895 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 270.5MB. Free memory is still 219.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:40,897 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.53ms. Allocated memory is still 178.3MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.81ms. Allocated memory is still 178.3MB. Free memory was 121.2MB in the beginning and 109.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 178.3MB. Free memory was 109.0MB in the beginning and 107.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.16ms. Allocated memory is still 178.3MB. Free memory was 107.7MB in the beginning and 105.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 333.77ms. Allocated memory is still 178.3MB. Free memory was 105.7MB in the beginning and 93.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 19877.86ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 93.1MB in the beginning and 219.1MB in the end (delta: -126.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 270.5MB. Free memory is still 219.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long) -1 * i) + n) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 14 locations. One deterministic module has affine ranking function null and consists of 10 locations. One deterministic module has affine ranking function (size + ((long) -1 * i)) and consists of 6 locations. One nondeterministic module has affine ranking function j and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.8s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 17.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: 97ms 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-11-09 15:28:40,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2024-11-09 15:28:41,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 15:28:41,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE