./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer --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 32bit --witnessprinter.graph.data.programhash c911d3bfcad41488f605dca082dbd47805d189ae ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:56:52,609 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:56:52,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:56:52,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:56:52,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:56:52,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:56:52,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:56:52,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:56:52,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:56:52,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:56:52,621 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:56:52,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:56:52,622 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:56:52,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:56:52,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:56:52,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:56:52,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:56:52,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:56:52,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:56:52,628 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:56:52,629 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:56:52,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:56:52,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:56:52,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:56:52,631 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:56:52,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:56:52,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:56:52,633 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:56:52,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:56:52,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:56:52,635 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:56:52,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:56:52,635 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:56:52,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:56:52,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:56:52,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:56:52,637 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 08:56:52,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:56:52,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:56:52,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:56:52,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:56:52,647 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:56:52,648 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:56:52,648 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:56:52,648 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:56:52,648 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:56:52,648 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:56:52,648 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:56:52,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:56:52,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:56:52,649 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:56:52,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:56:52,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:56:52,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:56:52,649 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:56:52,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:56:52,649 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:56:52,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:56:52,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:56:52,650 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:56:52,650 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:56:52,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:56:52,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:56:52,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:56:52,650 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:56:52,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:56:52,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:56:52,651 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:56:52,652 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:56:52,652 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c911d3bfcad41488f605dca082dbd47805d189ae [2018-11-18 08:56:52,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:56:52,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:56:52,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:56:52,687 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:56:52,687 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:56:52,688 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 08:56:52,725 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/data/7bb6b502e/6261583519174df3b542d818b65754c7/FLAG07f8e9d2a [2018-11-18 08:56:53,170 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:56:53,171 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 08:56:53,180 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/data/7bb6b502e/6261583519174df3b542d818b65754c7/FLAG07f8e9d2a [2018-11-18 08:56:53,191 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/data/7bb6b502e/6261583519174df3b542d818b65754c7 [2018-11-18 08:56:53,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:56:53,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:56:53,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:56:53,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:56:53,198 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:56:53,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ee2369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53, skipping insertion in model container [2018-11-18 08:56:53,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:56:53,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:56:53,421 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:56:53,428 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:56:53,457 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:56:53,533 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:56:53,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53 WrapperNode [2018-11-18 08:56:53,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:56:53,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:56:53,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:56:53,534 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:56:53,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:56:53,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:56:53,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:56:53,562 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:56:53,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... [2018-11-18 08:56:53,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:56:53,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:56:53,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:56:53,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:56:53,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_19810315-7e31-4657-bfbd-9b450974c8f9/bin-2019/uautomizer/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 [2018-11-18 08:56:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:56:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:56:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:56:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:56:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:56:53,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:56:53,749 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:56:53,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:56:53 BoogieIcfgContainer [2018-11-18 08:56:53,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:56:53,750 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:56:53,750 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:56:53,753 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:56:53,754 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:56:53,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:56:53" (1/3) ... [2018-11-18 08:56:53,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40055691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:56:53, skipping insertion in model container [2018-11-18 08:56:53,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:56:53,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:56:53" (2/3) ... [2018-11-18 08:56:53,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40055691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:56:53, skipping insertion in model container [2018-11-18 08:56:53,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:56:53,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:56:53" (3/3) ... [2018-11-18 08:56:53,757 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-18 08:56:53,801 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:56:53,802 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:56:53,802 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:56:53,802 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:56:53,802 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:56:53,802 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:56:53,802 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:56:53,802 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:56:53,803 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:56:53,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 08:56:53,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 08:56:53,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:56:53,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:56:53,835 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:56:53,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 08:56:53,836 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:56:53,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 08:56:53,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 08:56:53,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:56:53,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:56:53,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:56:53,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 08:56:53,844 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 7#L553true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 11#L553-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 16#L543-4true [2018-11-18 08:56:53,845 INFO L796 eck$LassoCheckResult]: Loop: 16#L543-4true assume true; 8#L543-1true 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; 13#L546-6true assume !true; 17#L546-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 14#L543-3true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 16#L543-4true [2018-11-18 08:56:53,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 08:56:53,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:53,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:53,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:53,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:56:53,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:53,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash 41207969, now seen corresponding path program 1 times [2018-11-18 08:56:53,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:53,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:53,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:56:53,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:56:53,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:56:53,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:56:53,950 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:56:53,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 08:56:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 08:56:53,961 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2018-11-18 08:56:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:56:53,965 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-18 08:56:53,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 08:56:53,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-18 08:56:53,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 08:56:53,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 15 transitions. [2018-11-18 08:56:53,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 08:56:53,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 08:56:53,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2018-11-18 08:56:53,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:56:53,971 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 08:56:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2018-11-18 08:56:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 08:56:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 08:56:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-11-18 08:56:53,987 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 08:56:53,987 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 08:56:53,987 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:56:53,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-11-18 08:56:53,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 08:56:53,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:56:53,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:56:53,988 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:56:53,988 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:56:53,988 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 41#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 42#L553-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 47#L543-4 [2018-11-18 08:56:53,989 INFO L796 eck$LassoCheckResult]: Loop: 47#L543-4 assume true; 43#L543-1 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; 44#L546-6 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 49#L546-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; 50#L546-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 51#L546-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 48#L543-3 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 47#L543-4 [2018-11-18 08:56:53,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-18 08:56:53,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:53,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:53,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:53,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:56:53,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:54,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash 931874296, now seen corresponding path program 1 times [2018-11-18 08:56:54,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:54,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:54,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:54,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:56:54,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:54,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:54,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1958231444, now seen corresponding path program 1 times [2018-11-18 08:56:54,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:54,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:54,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:54,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:56:54,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:54,202 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-11-18 08:56:54,322 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:56:54,323 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:56:54,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:56:54,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:56:54,324 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:56:54,324 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:56:54,324 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:56:54,324 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:56:54,324 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 08:56:54,324 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:56:54,325 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:56:54,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:54,713 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:56:54,717 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:56:54,719 INFO L122 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 [2018-11-18 08:56:54,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:56:54,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:56:54,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:56:54,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,725 INFO L122 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 [2018-11-18 08:56:54,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:56:54,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:56:54,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:56:54,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,728 INFO L122 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 [2018-11-18 08:56:54,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:56:54,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:56:54,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:56:54,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,730 INFO L122 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 [2018-11-18 08:56:54,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:56:54,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:56:54,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,736 INFO L122 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 [2018-11-18 08:56:54,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:56:54,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:56:54,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:56:54,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,739 INFO L122 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 [2018-11-18 08:56:54,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:56:54,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:56:54,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:56:54,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,747 INFO L122 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 [2018-11-18 08:56:54,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:56:54,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:56:54,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,759 INFO L122 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 [2018-11-18 08:56:54,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:56:54,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:56:54,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,764 INFO L122 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 [2018-11-18 08:56:54,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,765 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:56:54,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,768 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:56:54,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:56:54,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,780 INFO L122 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 [2018-11-18 08:56:54,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:56:54,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:56:54,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:56:54,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:54,783 INFO L122 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 [2018-11-18 08:56:54,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:54,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:54,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:54,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:54,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:56:54,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:56:54,829 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:56:54,857 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 08:56:54,857 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 08:56:54,859 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:56:54,860 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:56:54,861 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:56:54,861 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2018-11-18 08:56:54,892 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 08:56:54,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:54,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:54,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:56:54,969 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 [2018-11-18 08:56:54,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 08:56:54,996 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 20 states and 26 transitions. Complement of second has 6 states. [2018-11-18 08:56:54,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:56:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:56:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 08:56:54,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 7 letters. [2018-11-18 08:56:54,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:55,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 7 letters. [2018-11-18 08:56:55,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:55,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 14 letters. [2018-11-18 08:56:55,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:55,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-18 08:56:55,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:56:55,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 24 transitions. [2018-11-18 08:56:55,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:56:55,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 08:56:55,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-11-18 08:56:55,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:56:55,002 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-18 08:56:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-11-18 08:56:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 08:56:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 08:56:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-18 08:56:55,004 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-18 08:56:55,004 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-18 08:56:55,004 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:56:55,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-18 08:56:55,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:56:55,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:56:55,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:56:55,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:56:55,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:56:55,005 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 145#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 146#L553-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 154#L543-4 assume true; 147#L543-1 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; 148#L546-6 [2018-11-18 08:56:55,006 INFO L796 eck$LassoCheckResult]: Loop: 148#L546-6 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 155#L546-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; 159#L546-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;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; 152#L546-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 148#L546-6 [2018-11-18 08:56:55,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:55,006 INFO L82 PathProgramCache]: Analyzing trace with hash 889568330, now seen corresponding path program 1 times [2018-11-18 08:56:55,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:55,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:55,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:56:55,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:55,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1604006, now seen corresponding path program 1 times [2018-11-18 08:56:55,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:55,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:55,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:56:55,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2015041169, now seen corresponding path program 1 times [2018-11-18 08:56:55,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:55,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:55,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:56:55,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,235 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:56:55,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:56:55,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:56:55,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:56:55,235 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:56:55,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:56:55,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:56:55,236 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:56:55,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 08:56:55,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:56:55,236 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:56:55,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:55,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:56:55,547 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:56:55,547 INFO L122 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 [2018-11-18 08:56:55,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:55,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:55,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:55,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:55,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:56:55,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:56:55,575 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:56:55,590 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 08:56:55,590 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 08:56:55,591 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:56:55,591 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:56:55,592 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:56:55,592 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-11-18 08:56:55,607 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 08:56:55,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:55,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:55,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:56:55,673 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 [2018-11-18 08:56:55,673 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 08:56:55,721 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 59 states and 74 transitions. Complement of second has 9 states. [2018-11-18 08:56:55,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:56:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:56:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-18 08:56:55,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 08:56:55,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:55,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 08:56:55,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:55,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 08:56:55,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:55,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 74 transitions. [2018-11-18 08:56:55,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:56:55,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 37 states and 47 transitions. [2018-11-18 08:56:55,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 08:56:55,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 08:56:55,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2018-11-18 08:56:55,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:56:55,729 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-18 08:56:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2018-11-18 08:56:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2018-11-18 08:56:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 08:56:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-18 08:56:55,732 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-18 08:56:55,732 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-18 08:56:55,732 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:56:55,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-18 08:56:55,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:56:55,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:56:55,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:56:55,733 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:56:55,733 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:56:55,733 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 296#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 297#L553-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 305#L543-4 assume true; 300#L543-1 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; 301#L546-6 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 312#L546-1 assume !insertionSort_#t~short6; 313#L546-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 314#L546-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 306#L543-3 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 307#L543-4 assume true; 298#L543-1 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; 299#L546-6 [2018-11-18 08:56:55,733 INFO L796 eck$LassoCheckResult]: Loop: 299#L546-6 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 308#L546-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; 311#L546-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;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; 303#L546-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 299#L546-6 [2018-11-18 08:56:55,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:55,734 INFO L82 PathProgramCache]: Analyzing trace with hash 722000759, now seen corresponding path program 1 times [2018-11-18 08:56:55,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:55,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:56:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:56:55,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:56:55,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:56:55,766 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:56:55,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1604006, now seen corresponding path program 2 times [2018-11-18 08:56:55,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:55,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:56:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:56:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:56:55,833 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 08:56:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:56:55,867 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2018-11-18 08:56:55,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:56:55,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2018-11-18 08:56:55,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:56:55,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 55 transitions. [2018-11-18 08:56:55,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 08:56:55,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 08:56:55,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2018-11-18 08:56:55,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:56:55,873 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-18 08:56:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2018-11-18 08:56:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-11-18 08:56:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 08:56:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-11-18 08:56:55,875 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-18 08:56:55,875 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-18 08:56:55,875 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:56:55,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2018-11-18 08:56:55,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:56:55,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:56:55,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:56:55,877 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:56:55,877 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:56:55,877 INFO L794 eck$LassoCheckResult]: Stem: 383#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 376#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 377#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 378#L553-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;assume { :begin_inline_insertionSort } true;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; 388#L543-4 assume true; 396#L543-1 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; 403#L546-6 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 394#L546-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; 395#L546-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 397#L546-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 391#L543-3 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 392#L543-4 assume true; 379#L543-1 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; 380#L546-6 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 389#L546-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; 393#L546-3 [2018-11-18 08:56:55,877 INFO L796 eck$LassoCheckResult]: Loop: 393#L546-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;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; 384#L546-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 385#L546-6 assume true;insertionSort_#t~short6 := insertionSort_~j~0 > 0; 400#L546-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; 393#L546-3 [2018-11-18 08:56:55,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1132625220, now seen corresponding path program 2 times [2018-11-18 08:56:55,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:55,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:56:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1940966, now seen corresponding path program 3 times [2018-11-18 08:56:55,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:55,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:56:55,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1750420257, now seen corresponding path program 1 times [2018-11-18 08:56:55,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:56:55,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:56:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:56:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:56:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:56:56,256 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2018-11-18 08:56:56,379 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-18 08:56:56,381 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:56:56,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:56:56,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:56:56,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:56:56,381 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:56:56,381 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:56:56,381 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:56:56,381 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:56:56,381 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-18 08:56:56,381 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:56:56,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:56:56,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:56,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:56,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:56,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:56,685 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-11-18 08:56:56,828 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-18 08:56:56,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:56,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:56,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:56,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:56,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:56:57,163 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:56:57,163 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:56:57,163 INFO L122 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 [2018-11-18 08:56:57,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:57,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:56:57,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:57,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:57,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:57,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:56:57,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:56:57,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:57,168 INFO L122 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 [2018-11-18 08:56:57,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:57,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:56:57,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:57,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:57,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:57,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:56:57,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:56:57,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:57,170 INFO L122 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 [2018-11-18 08:56:57,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:57,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:57,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:57,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:57,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:56:57,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:56:57,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:57,173 INFO L122 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 [2018-11-18 08:56:57,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:57,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:56:57,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:57,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:57,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:57,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:56:57,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:56:57,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:57,174 INFO L122 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 [2018-11-18 08:56:57,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:57,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:57,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:57,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:57,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:56:57,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:56:57,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:56:57,179 INFO L122 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 [2018-11-18 08:56:57,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:56:57,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:56:57,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:56:57,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:56:57,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:56:57,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:56:57,197 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:56:57,208 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 08:56:57,208 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 08:56:57,208 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:56:57,209 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:56:57,209 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:56:57,210 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-11-18 08:56:57,237 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2018-11-18 08:56:57,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:57,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:57,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:56:57,294 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 [2018-11-18 08:56:57,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 08:56:57,358 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 61 states and 73 transitions. Complement of second has 9 states. [2018-11-18 08:56:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:56:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:56:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-18 08:56:57,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-18 08:56:57,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:57,361 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:56:57,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:57,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:57,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:56:57,400 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 [2018-11-18 08:56:57,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 08:56:57,428 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 62 states and 74 transitions. Complement of second has 9 states. [2018-11-18 08:56:57,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:56:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:56:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-18 08:56:57,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-18 08:56:57,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:57,429 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:56:57,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:56:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:57,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:56:57,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:56:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:56:57,466 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 [2018-11-18 08:56:57,466 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 08:56:57,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 70 states and 87 transitions. Complement of second has 8 states. [2018-11-18 08:56:57,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:56:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:56:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-18 08:56:57,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-18 08:56:57,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:57,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 08:56:57,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:57,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-18 08:56:57,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:56:57,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 87 transitions. [2018-11-18 08:56:57,503 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:56:57,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 0 states and 0 transitions. [2018-11-18 08:56:57,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:56:57,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:56:57,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:56:57,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:56:57,503 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:56:57,503 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:56:57,503 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:56:57,503 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:56:57,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:56:57,504 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:56:57,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:56:57,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:56:57 BoogieIcfgContainer [2018-11-18 08:56:57,510 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:56:57,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:56:57,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:56:57,511 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:56:57,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:56:53" (3/4) ... [2018-11-18 08:56:57,513 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:56:57,514 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:56:57,514 INFO L168 Benchmark]: Toolchain (without parser) took 4320.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -135.2 MB). Peak memory consumption was 166.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:56:57,515 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:56:57,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -233.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:56:57,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:56:57,516 INFO L168 Benchmark]: Boogie Preprocessor took 14.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:56:57,516 INFO L168 Benchmark]: RCFGBuilder took 172.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:56:57,517 INFO L168 Benchmark]: BuchiAutomizer took 3760.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.5 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 69.0 MB). Peak memory consumption was 176.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:56:57,517 INFO L168 Benchmark]: Witness Printer took 3.02 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:56:57,520 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -233.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3760.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.5 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 69.0 MB). Peak memory consumption was 176.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.02 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 array_size + -1 * i and consists of 4 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 3.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 106 SDtfs, 112 SDslu, 58 SDs, 0 SdLazy, 129 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital248 mio100 ax100 hnf99 lsp82 ukn97 mio100 lsp53 div100 bol100 ite100 ukn100 eq177 hnf85 smp100 dnf141 smp83 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...