./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/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.3.100.v20150511-1540.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-memory-alloca/insertionsort-alloca-2.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.graphml --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 8104a25549f6efe413528ca8cc098e1acad610e4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:40:02,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:40:02,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:40:02,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:40:02,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:40:02,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:40:02,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:40:02,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:40:02,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:40:02,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:40:02,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:40:02,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:40:02,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:40:02,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:40:02,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:40:02,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:40:02,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:40:02,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:40:02,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:40:02,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:40:02,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:40:02,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:40:02,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:40:02,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:40:02,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:40:02,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:40:02,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:40:02,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:40:02,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:40:02,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:40:02,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:40:02,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:40:02,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:40:02,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:40:02,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:40:02,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:40:02,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:40:02,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:40:02,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:40:02,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:40:02,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:40:02,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:40:02,360 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:40:02,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:40:02,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:40:02,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:40:02,364 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:40:02,364 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:40:02,364 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:40:02,364 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:40:02,365 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:40:02,365 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:40:02,366 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:40:02,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:40:02,367 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:40:02,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:40:02,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:40:02,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:40:02,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:40:02,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:40:02,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:40:02,370 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:40:02,370 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:40:02,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:40:02,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:40:02,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:40:02,371 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:40:02,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:40:02,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:40:02,372 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:40:02,372 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:40:02,374 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:40:02,374 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 8104a25549f6efe413528ca8cc098e1acad610e4 [2020-10-20 06:40:02,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:40:02,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:40:02,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:40:02,634 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:40:02,635 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:40:02,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2020-10-20 06:40:02,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce071d42f/b0c5a91f4a534fe3b35516793e72e679/FLAG33025d7af [2020-10-20 06:40:03,332 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:40:03,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2020-10-20 06:40:03,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce071d42f/b0c5a91f4a534fe3b35516793e72e679/FLAG33025d7af [2020-10-20 06:40:03,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce071d42f/b0c5a91f4a534fe3b35516793e72e679 [2020-10-20 06:40:03,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:40:03,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:40:03,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:40:03,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:40:03,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:40:03,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:40:03" (1/1) ... [2020-10-20 06:40:03,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6961f796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:03, skipping insertion in model container [2020-10-20 06:40:03,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:40:03" (1/1) ... [2020-10-20 06:40:03,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:40:03,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:40:04,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:40:04,048 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:40:04,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:40:04,198 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:40:04,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04 WrapperNode [2020-10-20 06:40:04,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:40:04,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:40:04,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:40:04,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:40:04,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... [2020-10-20 06:40:04,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... [2020-10-20 06:40:04,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:40:04,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:40:04,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:40:04,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:40:04,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... [2020-10-20 06:40:04,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... [2020-10-20 06:40:04,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... [2020-10-20 06:40:04,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... [2020-10-20 06:40:04,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... [2020-10-20 06:40:04,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... [2020-10-20 06:40:04,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... [2020-10-20 06:40:04,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:40:04,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:40:04,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:40:04,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:40:04,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:04,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:40:04,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:40:04,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:40:04,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:40:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:40:04,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:40:04,638 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:40:04,639 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 06:40:04,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:40:04 BoogieIcfgContainer [2020-10-20 06:40:04,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:40:04,642 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:40:04,642 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:40:04,646 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:40:04,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:40:04,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:40:03" (1/3) ... [2020-10-20 06:40:04,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69011037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:40:04, skipping insertion in model container [2020-10-20 06:40:04,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:40:04,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:40:04" (2/3) ... [2020-10-20 06:40:04,649 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69011037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:40:04, skipping insertion in model container [2020-10-20 06:40:04,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:40:04,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:40:04" (3/3) ... [2020-10-20 06:40:04,651 INFO L373 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2020-10-20 06:40:04,729 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:40:04,731 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:40:04,733 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:40:04,733 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:40:04,733 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:40:04,734 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:40:04,734 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:40:04,734 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:40:04,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-20 06:40:04,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:40:04,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:04,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:04,789 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:40:04,790 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:04,790 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:40:04,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-10-20 06:40:04,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:40:04,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:04,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:04,792 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:40:04,792 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:04,799 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L560true assume !(main_~array_size~0 < 1); 5#L560-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 6#L550-3true [2020-10-20 06:40:04,800 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 8#L553-6true assume !true; 9#L553-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 3#L550-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 6#L550-3true [2020-10-20 06:40:04,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-20 06:40:04,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:04,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327259440] [2020-10-20 06:40:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:04,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:04,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:04,955 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:04,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2020-10-20 06:40:04,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:04,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994973281] [2020-10-20 06:40:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:04,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994973281] [2020-10-20 06:40:04,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:40:04,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:40:04,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838912918] [2020-10-20 06:40:05,002 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:40:05,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:05,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 06:40:05,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 06:40:05,017 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2020-10-20 06:40:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:05,024 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-10-20 06:40:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 06:40:05,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-10-20 06:40:05,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:40:05,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2020-10-20 06:40:05,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:40:05,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:40:05,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-10-20 06:40:05,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:40:05,035 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-20 06:40:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-10-20 06:40:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-10-20 06:40:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 06:40:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-10-20 06:40:05,070 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-20 06:40:05,071 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-20 06:40:05,071 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:40:05,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-10-20 06:40:05,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:40:05,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:05,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:05,073 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:40:05,073 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:40:05,073 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 42#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 43#L560 assume !(main_~array_size~0 < 1); 44#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 41#L550-3 [2020-10-20 06:40:05,073 INFO L796 eck$LassoCheckResult]: Loop: 41#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 39#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 47#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 48#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 40#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 41#L550-3 [2020-10-20 06:40:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:05,074 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-10-20 06:40:05,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:05,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481342123] [2020-10-20 06:40:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:05,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:05,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:05,107 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2020-10-20 06:40:05,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:05,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487266859] [2020-10-20 06:40:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:05,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:05,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:05,163 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:05,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2020-10-20 06:40:05,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:05,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102801650] [2020-10-20 06:40:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:05,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:05,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:05,247 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:05,458 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2020-10-20 06:40:05,661 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-10-20 06:40:05,740 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:40:05,741 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:40:05,741 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:40:05,741 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:40:05,742 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:40:05,742 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:05,742 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:40:05,742 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:40:05,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2020-10-20 06:40:05,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:40:05,743 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:40:05,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:05,966 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-10-20 06:40:06,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:06,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:06,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:06,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:06,482 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:40:06,488 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:06,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:06,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:06,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:06,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:06,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:06,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:06,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:06,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:06,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:06,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:06,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:06,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:06,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:06,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:06,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:06,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:06,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:06,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:06,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:06,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:06,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:06,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:06,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:06,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:06,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:06,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:06,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:06,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:06,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:06,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:06,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:06,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:06,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:06,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:06,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:06,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:06,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:06,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:06,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:06,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:06,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:06,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:06,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:06,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:06,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:06,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:06,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:06,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:06,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:06,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:06,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:06,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:06,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:06,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:06,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:06,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:06,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:06,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:06,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:06,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:06,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:06,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:06,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:06,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:06,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:06,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:06,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:06,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:06,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:06,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:06,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:06,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:06,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:06,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:06,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:06,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:06,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:06,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:07,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:07,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:07,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:07,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:07,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:07,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:07,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:07,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:07,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:07,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:07,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:07,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:07,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:07,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:07,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:07,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:07,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:07,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:07,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:07,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:07,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:07,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:07,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:07,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:07,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:07,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:07,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:07,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:07,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:07,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:07,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:07,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:07,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:07,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:07,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:07,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:07,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:07,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:07,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:07,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:07,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:07,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:07,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:07,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:07,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:07,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:07,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:07,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:07,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:07,305 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:40:07,350 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-20 06:40:07,351 INFO L444 ModelExtractionUtils]: 23 out of 37 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:07,357 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:40:07,402 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:40:07,403 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:40:07,404 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_insertionSort_~i~0) = 1*v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1 - 1*ULTIMATE.start_insertionSort_~a.offset - 4*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2020-10-20 06:40:07,520 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 06:40:07,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:40:07,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:07,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:07,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:07,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:40:07,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:07,673 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:40:07,674 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-20 06:40:07,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2020-10-20 06:40:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:40:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-10-20 06:40:07,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-20 06:40:07,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:07,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-20 06:40:07,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:07,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2020-10-20 06:40:07,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:07,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2020-10-20 06:40:07,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:07,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2020-10-20 06:40:07,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:40:07,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 06:40:07,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2020-10-20 06:40:07,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:07,756 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 06:40:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2020-10-20 06:40:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-10-20 06:40:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 06:40:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-10-20 06:40:07,761 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:40:07,762 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-10-20 06:40:07,762 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:40:07,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-10-20 06:40:07,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:07,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:07,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:07,770 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:40:07,770 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:07,770 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 140#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 141#L560 assume !(main_~array_size~0 < 1); 142#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 143#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 135#L553-6 [2020-10-20 06:40:07,771 INFO L796 eck$LassoCheckResult]: Loop: 135#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 144#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 147#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 134#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 135#L553-6 [2020-10-20 06:40:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-10-20 06:40:07,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:07,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670863708] [2020-10-20 06:40:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:07,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:07,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:07,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2020-10-20 06:40:07,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:07,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609812383] [2020-10-20 06:40:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:07,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:07,869 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:07,871 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:07,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:07,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2020-10-20 06:40:07,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:07,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433486347] [2020-10-20 06:40:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:07,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:07,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:07,926 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:08,177 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2020-10-20 06:40:08,240 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:40:08,240 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:40:08,240 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:40:08,240 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:40:08,241 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:40:08,241 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:08,241 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:40:08,241 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:40:08,241 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration3_Lasso [2020-10-20 06:40:08,241 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:40:08,241 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:40:08,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,410 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2020-10-20 06:40:08,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:08,806 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:40:08,806 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:08,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:08,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:08,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:08,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:08,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:08,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:08,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:08,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:08,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:08,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:08,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:08,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:08,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:08,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:08,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:08,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:08,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:08,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:08,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:08,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:08,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:08,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:08,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:08,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:08,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:08,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:08,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:08,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:08,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:08,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:08,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:08,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:08,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:08,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:08,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:08,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:08,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:09,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:09,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:09,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:09,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:09,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:09,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:09,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:09,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:09,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:09,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:09,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:09,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:09,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:09,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:09,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:09,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:09,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:09,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:09,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:09,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:09,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:09,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:09,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:09,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:09,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:09,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:09,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:09,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:09,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:09,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:09,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:09,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:40:09,194 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-20 06:40:09,195 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:09,197 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:09,200 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:40:09,200 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:40:09,201 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2020-10-20 06:40:09,233 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 06:40:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:09,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:09,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:09,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:40:09,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:09,311 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:40:09,311 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-20 06:40:09,378 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 9 states. [2020-10-20 06:40:09,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:40:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-10-20 06:40:09,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-20 06:40:09,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:09,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2020-10-20 06:40:09,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:09,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2020-10-20 06:40:09,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:09,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2020-10-20 06:40:09,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:09,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2020-10-20 06:40:09,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:40:09,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:40:09,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-10-20 06:40:09,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:09,387 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-10-20 06:40:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-10-20 06:40:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2020-10-20 06:40:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 06:40:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-10-20 06:40:09,391 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-20 06:40:09,391 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-10-20 06:40:09,391 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:40:09,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2020-10-20 06:40:09,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:09,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:09,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:09,393 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:40:09,393 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:09,393 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L560 assume !(main_~array_size~0 < 1); 276#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 277#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 271#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 283#L553-1 assume !insertionSort_#t~short6; 284#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 285#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 272#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 273#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 269#L553-6 [2020-10-20 06:40:09,394 INFO L796 eck$LassoCheckResult]: Loop: 269#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 278#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 282#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 268#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 269#L553-6 [2020-10-20 06:40:09,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2020-10-20 06:40:09,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019004114] [2020-10-20 06:40:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:09,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019004114] [2020-10-20 06:40:09,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:40:09,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:40:09,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738279585] [2020-10-20 06:40:09,442 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:40:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2020-10-20 06:40:09,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681328910] [2020-10-20 06:40:09,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,448 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,454 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:09,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:40:09,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:40:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:40:09,552 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-10-20 06:40:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:40:09,610 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-10-20 06:40:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:40:09,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2020-10-20 06:40:09,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:09,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 50 transitions. [2020-10-20 06:40:09,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:40:09,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:40:09,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2020-10-20 06:40:09,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:40:09,614 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2020-10-20 06:40:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2020-10-20 06:40:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2020-10-20 06:40:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 06:40:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-10-20 06:40:09,618 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-10-20 06:40:09,618 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-10-20 06:40:09,618 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:40:09,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2020-10-20 06:40:09,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:40:09,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:40:09,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:40:09,620 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:40:09,620 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:40:09,620 INFO L794 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 347#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 348#L560 assume !(main_~array_size~0 < 1); 349#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 350#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 354#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 359#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 360#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 361#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 345#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 346#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 355#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 357#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 358#L553-3 [2020-10-20 06:40:09,620 INFO L796 eck$LassoCheckResult]: Loop: 358#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 341#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 342#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 351#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 358#L553-3 [2020-10-20 06:40:09,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash 587980355, now seen corresponding path program 2 times [2020-10-20 06:40:09,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25519033] [2020-10-20 06:40:09,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,659 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:09,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1910182, now seen corresponding path program 3 times [2020-10-20 06:40:09,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838540954] [2020-10-20 06:40:09,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,673 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:09,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash -508816664, now seen corresponding path program 1 times [2020-10-20 06:40:09,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:40:09,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983395201] [2020-10-20 06:40:09,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:40:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:40:09,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:40:09,768 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:40:09,875 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2020-10-20 06:40:10,334 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 99 [2020-10-20 06:40:10,448 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-20 06:40:10,451 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:40:10,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:40:10,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:40:10,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:40:10,451 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:40:10,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:10,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:40:10,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:40:10,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2020-10-20 06:40:10,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:40:10,452 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:40:10,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:10,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:10,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:10,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:11,089 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2020-10-20 06:40:11,364 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-10-20 06:40:11,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:11,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:11,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:11,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:11,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:11,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:11,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:11,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:40:11,974 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2020-10-20 06:40:12,119 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-10-20 06:40:12,152 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:40:12,153 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:12,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:12,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:12,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:12,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:12,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:12,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:12,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:12,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:12,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:12,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:12,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:12,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:12,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:12,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:12,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:12,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:12,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:12,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:12,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:12,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:12,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:12,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:12,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:12,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:12,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:12,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:12,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:12,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:12,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:12,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:12,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:12,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:12,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:12,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:12,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:12,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:12,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:12,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:12,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:12,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:12,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:12,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:12,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:12,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:12,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:12,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:12,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:12,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:12,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:12,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:12,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:12,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:40:12,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:12,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:12,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:12,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:12,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:12,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:12,402 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:40:12,438 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 06:40:12,438 INFO L444 ModelExtractionUtils]: 23 out of 37 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:12,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:12,452 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:40:12,452 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:40:12,452 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2020-10-20 06:40:12,514 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2020-10-20 06:40:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:12,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:12,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:12,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:40:12,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:12,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:40:12,601 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 06:40:12,664 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 50 states and 62 transitions. Complement of second has 9 states. [2020-10-20 06:40:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:40:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-10-20 06:40:12,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2020-10-20 06:40:12,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:12,666 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:40:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:12,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:12,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:12,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:40:12,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:12,776 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:40:12,776 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 06:40:12,841 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 51 states and 63 transitions. Complement of second has 9 states. [2020-10-20 06:40:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:40:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-10-20 06:40:12,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2020-10-20 06:40:12,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:12,845 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:40:12,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:12,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:12,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:12,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:40:12,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:40:12,918 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:40:12,918 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-20 06:40:12,979 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 61 states and 78 transitions. Complement of second has 8 states. [2020-10-20 06:40:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:40:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-10-20 06:40:12,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 13 letters. Loop has 4 letters. [2020-10-20 06:40:12,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:12,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 17 letters. Loop has 4 letters. [2020-10-20 06:40:12,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:12,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 13 letters. Loop has 8 letters. [2020-10-20 06:40:12,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:12,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 78 transitions. [2020-10-20 06:40:12,985 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:40:12,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2020-10-20 06:40:12,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:40:12,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:40:12,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:40:12,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:40:12,986 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:12,986 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:12,986 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:12,986 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:40:12,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:40:12,986 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:40:12,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:40:12,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:40:12 BoogieIcfgContainer [2020-10-20 06:40:12,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:40:12,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:40:12,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:40:12,993 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:40:12,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:40:04" (3/4) ... [2020-10-20 06:40:12,996 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:40:12,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:40:12,998 INFO L168 Benchmark]: Toolchain (without parser) took 9347.49 ms. Allocated memory was 39.8 MB in the beginning and 83.9 MB in the end (delta: 44.0 MB). Free memory was 16.9 MB in the beginning and 30.9 MB in the end (delta: -14.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:12,999 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 30.9 MB. Free memory was 17.0 MB in the beginning and 17.0 MB in the end (delta: 32.0 kB). Peak memory consumption was 32.0 kB. Max. memory is 14.3 GB. [2020-10-20 06:40:13,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.02 ms. Allocated memory was 39.8 MB in the beginning and 42.5 MB in the end (delta: 2.6 MB). Free memory was 16.0 MB in the beginning and 19.5 MB in the end (delta: -3.5 MB). Peak memory consumption was 6.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:13,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.15 ms. Allocated memory is still 42.5 MB. Free memory was 19.5 MB in the beginning and 17.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:13,001 INFO L168 Benchmark]: Boogie Preprocessor took 27.67 ms. Allocated memory is still 42.5 MB. Free memory was 17.6 MB in the beginning and 15.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:13,001 INFO L168 Benchmark]: RCFGBuilder took 365.31 ms. Allocated memory is still 42.5 MB. Free memory was 15.9 MB in the beginning and 15.9 MB in the end (delta: 71.3 kB). Peak memory consumption was 5.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:13,002 INFO L168 Benchmark]: BuchiAutomizer took 8350.94 ms. Allocated memory was 42.5 MB in the beginning and 83.9 MB in the end (delta: 41.4 MB). Free memory was 15.9 MB in the beginning and 32.0 MB in the end (delta: -16.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:13,003 INFO L168 Benchmark]: Witness Printer took 3.82 ms. Allocated memory is still 83.9 MB. Free memory was 32.0 MB in the beginning and 30.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:13,007 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 30.9 MB. Free memory was 17.0 MB in the beginning and 17.0 MB in the end (delta: 32.0 kB). Peak memory consumption was 32.0 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 544.02 ms. Allocated memory was 39.8 MB in the beginning and 42.5 MB in the end (delta: 2.6 MB). Free memory was 16.0 MB in the beginning and 19.5 MB in the end (delta: -3.5 MB). Peak memory consumption was 6.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 47.15 ms. Allocated memory is still 42.5 MB. Free memory was 19.5 MB in the beginning and 17.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 27.67 ms. Allocated memory is still 42.5 MB. Free memory was 17.6 MB in the beginning and 15.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 365.31 ms. Allocated memory is still 42.5 MB. Free memory was 15.9 MB in the beginning and 15.9 MB in the end (delta: 71.3 kB). Peak memory consumption was 5.4 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 8350.94 ms. Allocated memory was 42.5 MB in the beginning and 83.9 MB in the end (delta: 41.4 MB). Free memory was 15.9 MB in the beginning and 32.0 MB in the end (delta: -16.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 14.3 GB. * Witness Printer took 3.82 ms. Allocated memory is still 83.9 MB. Free memory was 32.0 MB in the beginning and 30.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a + -4 * i and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 88 SDtfs, 108 SDslu, 37 SDs, 0 SdLazy, 137 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital174 mio100 ax110 hnf99 lsp88 ukn94 mio100 lsp49 div100 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf149 smp83 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...