./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/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 64bit --witnessprinter.graph.data.programhash 647da5540d24322bf98da85423c1800dc68ed16f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:55:52,903 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:55:52,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:55:52,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:55:52,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:55:52,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:55:52,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:55:52,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:55:52,915 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:55:52,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:55:52,916 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:55:52,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:55:52,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:55:52,917 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:55:52,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:55:52,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:55:52,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:55:52,920 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:55:52,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:55:52,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:55:52,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:55:52,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:55:52,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:55:52,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:55:52,925 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:55:52,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:55:52,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:55:52,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:55:52,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:55:52,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:55:52,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:55:52,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:55:52,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:55:52,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:55:52,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:55:52,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:55:52,930 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:55:52,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:55:52,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:55:52,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:55:52,942 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:55:52,942 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:55:52,942 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:55:52,942 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:55:52,942 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:55:52,942 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:55:52,942 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:55:52,943 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:55:52,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:55:52,943 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:55:52,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:55:52,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:55:52,943 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:55:52,943 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:55:52,943 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:55:52,944 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:55:52,944 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:55:52,944 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:55:52,944 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:55:52,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:55:52,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:55:52,944 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:55:52,945 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:55:52,945 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:55:52,945 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:55:52,945 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:55:52,946 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_113ce38d-1956-4856-9ffd-5c7d5cf7d397/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647da5540d24322bf98da85423c1800dc68ed16f [2018-11-28 12:55:52,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:55:52,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:55:52,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:55:52,981 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:55:52,982 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:55:52,982 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-28 12:55:53,023 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/data/6a18c9aad/a5922be01f0a4db59d633325ef5a16d3/FLAGa33b5e9ab [2018-11-28 12:55:53,425 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:55:53,426 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-28 12:55:53,429 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/data/6a18c9aad/a5922be01f0a4db59d633325ef5a16d3/FLAGa33b5e9ab [2018-11-28 12:55:53,441 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/data/6a18c9aad/a5922be01f0a4db59d633325ef5a16d3 [2018-11-28 12:55:53,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:55:53,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:55:53,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:55:53,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:55:53,448 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:55:53,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671ec8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53, skipping insertion in model container [2018-11-28 12:55:53,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:55:53,469 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:55:53,573 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:55:53,579 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:55:53,591 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:55:53,602 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:55:53,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53 WrapperNode [2018-11-28 12:55:53,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:55:53,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:55:53,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:55:53,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:55:53,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:55:53,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:55:53,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:55:53,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:55:53,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... [2018-11-28 12:55:53,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:55:53,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:55:53,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:55:53,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:55:53,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/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-28 12:55:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:55:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:55:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2018-11-28 12:55:53,710 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-11-28 12:55:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:55:53,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:55:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:55:53,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:55:53,864 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:55:53,864 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 12:55:53,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:55:53 BoogieIcfgContainer [2018-11-28 12:55:53,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:55:53,865 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:55:53,865 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:55:53,868 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:55:53,868 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:55:53,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:55:53" (1/3) ... [2018-11-28 12:55:53,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52cd3af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:55:53, skipping insertion in model container [2018-11-28 12:55:53,869 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:55:53,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:55:53" (2/3) ... [2018-11-28 12:55:53,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52cd3af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:55:53, skipping insertion in model container [2018-11-28 12:55:53,869 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:55:53,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:55:53" (3/3) ... [2018-11-28 12:55:53,870 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive_true-termination.c.i [2018-11-28 12:55:53,907 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:55:53,908 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:55:53,908 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:55:53,908 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:55:53,908 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:55:53,908 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:55:53,908 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:55:53,908 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:55:53,908 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:55:53,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 12:55:53,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:55:53,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:53,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:53,942 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:55:53,942 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:55:53,942 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:55:53,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 12:55:53,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:55:53,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:53,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:53,945 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:55:53,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:55:53,950 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 6#L28true assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L33-3true [2018-11-28 12:55:53,950 INFO L796 eck$LassoCheckResult]: Loop: 8#L33-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 10#L33-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L33-3true [2018-11-28 12:55:53,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:53,955 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2018-11-28 12:55:53,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:53,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:53,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:53,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:53,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:54,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:54,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2018-11-28 12:55:54,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:54,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:54,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:54,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:54,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2018-11-28 12:55:54,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:54,218 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:55:54,219 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:55:54,219 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:55:54,219 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:55:54,219 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:55:54,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:55:54,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:55:54,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:55:54,220 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-28 12:55:54,220 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:55:54,220 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:55:54,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-28 12:55:54,244 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-28 12:55:54,246 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-28 12:55:54,249 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-28 12:55:54,317 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-28 12:55:54,319 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-28 12:55:54,472 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:55:54,476 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:55:54,478 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-28 12:55:54,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:54,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:54,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:54,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:54,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:54,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:54,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:54,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:54,485 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-28 12:55:54,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:54,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:54,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:54,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:54,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:54,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:54,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:54,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:54,488 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-28 12:55:54,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:54,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:54,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:54,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:54,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:54,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:54,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:54,495 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-28 12:55:54,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:54,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:54,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:54,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:54,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:54,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:54,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:54,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:54,498 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-28 12:55:54,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:54,499 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:55:54,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:54,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:54,501 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:55:54,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:54,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:54,514 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-28 12:55:54,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:54,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:54,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:54,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:54,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:54,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:54,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:54,530 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-28 12:55:54,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:54,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:54,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:54,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:54,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:54,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:54,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:54,537 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-28 12:55:54,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:54,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:54,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:54,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:54,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:54,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:54,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:54,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:54,539 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-28 12:55:54,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:54,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:54,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:54,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:54,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:54,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:54,582 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:55:54,605 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:55:54,605 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-28 12:55:54,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:55:54,609 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:55:54,609 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:55:54,609 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 12:55:54,631 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 12:55:54,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:54,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:54,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:54,686 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-28 12:55:54,695 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-28 12:55:54,696 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2018-11-28 12:55:54,734 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 9 states. [2018-11-28 12:55:54,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:55:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:55:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-28 12:55:54,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 12:55:54,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:55:54,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 12:55:54,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:55:54,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 12:55:54,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:55:54,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-28 12:55:54,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:55:54,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-28 12:55:54,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 12:55:54,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:55:54,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-28 12:55:54,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:54,746 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 12:55:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-28 12:55:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 12:55:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 12:55:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-28 12:55:54,763 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 12:55:54,763 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 12:55:54,763 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:55:54,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-28 12:55:54,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:55:54,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:54,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:54,764 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:55:54,764 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:55:54,764 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 126#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 127#L33-3 assume !(main_~i~0 < main_~n~0); 121#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 120#insertionSortENTRY [2018-11-28 12:55:54,765 INFO L796 eck$LassoCheckResult]: Loop: 120#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 123#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 131#L15-6 assume !true; 132#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 122#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 120#insertionSortENTRY [2018-11-28 12:55:54,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2018-11-28 12:55:54,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:54,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:54,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:54,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:54,808 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-28 12:55:54,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:55:54,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:55:54,810 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:55:54,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2018-11-28 12:55:54,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:54,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:54,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:54,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:54,817 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-28 12:55:54,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:55:54,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:55:54,818 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:55:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:55:54,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:55:54,820 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2018-11-28 12:55:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:54,824 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-28 12:55:54,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:55:54,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 12:55:54,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:55:54,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 12:55:54,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 12:55:54,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:55:54,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 12:55:54,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:54,826 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 12:55:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 12:55:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 12:55:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 12:55:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 12:55:54,828 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 12:55:54,828 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 12:55:54,828 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:55:54,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 12:55:54,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:55:54,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:54,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:54,829 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:55:54,829 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:54,829 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 162#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 163#L33-3 assume !(main_~i~0 < main_~n~0); 157#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 156#insertionSortENTRY [2018-11-28 12:55:54,829 INFO L796 eck$LassoCheckResult]: Loop: 156#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 159#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 167#L15-6 #t~short4 := ~j~0 > 0; 160#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 161#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 169#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 158#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 156#insertionSortENTRY [2018-11-28 12:55:54,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:54,829 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2018-11-28 12:55:54,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:54,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:54,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:54,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:54,848 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-28 12:55:54,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:55:54,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:55:54,849 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:55:54,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2018-11-28 12:55:54,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:54,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:55:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:55,001 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-28 12:55:55,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:55:55,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:55:55,102 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 12:55:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:55,107 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-28 12:55:55,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:55:55,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-28 12:55:55,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:55:55,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 12:55:55,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 12:55:55,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:55:55,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 12:55:55,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:55,109 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 12:55:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 12:55:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 12:55:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 12:55:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 12:55:55,110 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 12:55:55,110 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 12:55:55,110 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:55:55,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 12:55:55,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:55:55,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:55,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:55,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:55,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:55,112 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 203#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 199#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 200#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 201#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 202#L33-3 assume !(main_~i~0 < main_~n~0); 195#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 193#insertionSortENTRY [2018-11-28 12:55:55,112 INFO L796 eck$LassoCheckResult]: Loop: 193#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 196#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 204#L15-6 #t~short4 := ~j~0 > 0; 197#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 198#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 206#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 194#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 193#insertionSortENTRY [2018-11-28 12:55:55,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:55,113 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2018-11-28 12:55:55,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:55,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:55,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:55,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:55,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2018-11-28 12:55:55,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:55,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:55,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2018-11-28 12:55:55,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:55,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:55,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:55:55,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:55:55,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:55:55,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:55:55,339 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-28 12:55:55,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:55:55,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:55:55,445 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-28 12:55:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:55,506 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-28 12:55:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:55:55,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-11-28 12:55:55,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:55:55,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2018-11-28 12:55:55,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 12:55:55,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 12:55:55,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-11-28 12:55:55,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:55,508 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 12:55:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-11-28 12:55:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 12:55:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 12:55:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 12:55:55,510 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 12:55:55,510 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 12:55:55,510 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:55:55,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 12:55:55,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:55:55,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:55,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:55,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:55,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:55,511 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 252#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 253#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 254#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 255#L33-3 assume !(main_~i~0 < main_~n~0); 248#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 247#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 249#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 257#L15-6 #t~short4 := ~j~0 > 0; 250#L15-1 assume !#t~short4; 251#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 261#L15-7 [2018-11-28 12:55:55,511 INFO L796 eck$LassoCheckResult]: Loop: 261#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 258#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 259#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 266#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 263#L15-6 #t~short4 := ~j~0 > 0; 265#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 264#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 261#L15-7 [2018-11-28 12:55:55,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:55,512 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2018-11-28 12:55:55,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:55,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:55,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:55,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:55,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2018-11-28 12:55:55,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:55,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:55,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:55,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:55,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2018-11-28 12:55:55,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:55,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:55,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:55:55,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:55:55,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:55:55,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:55:55,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:55,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:55,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:55:55,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2018-11-28 12:55:55,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 12:55:55,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:55:55,972 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-11-28 12:55:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:56,087 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-28 12:55:56,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:55:56,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2018-11-28 12:55:56,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 12:55:56,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 27 transitions. [2018-11-28 12:55:56,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 12:55:56,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 12:55:56,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-28 12:55:56,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:56,090 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 12:55:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-28 12:55:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-28 12:55:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 12:55:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-28 12:55:56,091 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 12:55:56,091 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 12:55:56,091 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:55:56,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-28 12:55:56,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 12:55:56,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:56,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:56,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:56,092 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:56,093 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 392#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 393#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 394#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 395#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 396#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 406#L33-3 assume !(main_~i~0 < main_~n~0); 388#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 387#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 389#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 398#L15-6 #t~short4 := ~j~0 > 0; 390#L15-1 assume !#t~short4; 391#L15-3 [2018-11-28 12:55:56,093 INFO L796 eck$LassoCheckResult]: Loop: 391#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 402#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 400#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 401#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 405#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 404#L15-6 #t~short4 := ~j~0 > 0; 408#L15-1 assume !#t~short4; 391#L15-3 [2018-11-28 12:55:56,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 1 times [2018-11-28 12:55:56,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:56,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash -497256520, now seen corresponding path program 1 times [2018-11-28 12:55:56,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:56,123 INFO L82 PathProgramCache]: Analyzing trace with hash 451769787, now seen corresponding path program 1 times [2018-11-28 12:55:56,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:56,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:56,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:56,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:55:56,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:55:56,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:55:56,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:56,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 12:55:56,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:55:56,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-28 12:55:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:55:56,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:55:56,453 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-28 12:55:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:55:56,522 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-28 12:55:56,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:55:56,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-28 12:55:56,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 12:55:56,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-11-28 12:55:56,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 12:55:56,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 12:55:56,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-28 12:55:56,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:55:56,524 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 12:55:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-28 12:55:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-11-28 12:55:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 12:55:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-28 12:55:56,527 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 12:55:56,527 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 12:55:56,527 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:55:56,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-28 12:55:56,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 12:55:56,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:56,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:56,528 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:56,528 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:56,528 INFO L794 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 532#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 533#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 534#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 535#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 536#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 538#L33-3 assume !(main_~i~0 < main_~n~0); 528#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 527#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 529#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 539#L15-6 #t~short4 := ~j~0 > 0; 530#L15-1 assume !#t~short4; 531#L15-3 [2018-11-28 12:55:56,528 INFO L796 eck$LassoCheckResult]: Loop: 531#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 543#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 540#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 541#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 550#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 549#L15-6 #t~short4 := ~j~0 > 0; 547#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 546#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 544#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 545#L15-6 #t~short4 := ~j~0 > 0; 548#L15-1 assume !#t~short4; 531#L15-3 [2018-11-28 12:55:56,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 2 times [2018-11-28 12:55:56,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:56,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:56,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:56,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash -346675363, now seen corresponding path program 1 times [2018-11-28 12:55:56,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:56,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:56,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:55:56,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 1 times [2018-11-28 12:55:56,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:56,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:56,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:56,689 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-11-28 12:55:56,891 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-28 12:55:57,259 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:55:57,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:55:57,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:55:57,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:55:57,260 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:55:57,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:55:57,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:55:57,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:55:57,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration7_Lasso [2018-11-28 12:55:57,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:55:57,260 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:55:57,264 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-28 12:55:57,267 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-28 12:55:57,269 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-28 12:55:57,270 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-28 12:55:57,271 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-28 12:55:57,272 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-28 12:55:57,272 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-28 12:55:57,273 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-28 12:55:57,274 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-28 12:55:57,275 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-28 12:55:57,276 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-28 12:55:57,528 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-11-28 12:55:57,528 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-28 12:55:57,529 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-28 12:55:57,530 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-28 12:55:57,531 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-28 12:55:57,532 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-28 12:55:57,533 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-28 12:55:57,536 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-28 12:55:57,556 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-28 12:55:57,558 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-28 12:55:57,559 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-28 12:55:57,561 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-28 12:55:57,562 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-28 12:55:57,563 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-28 12:55:57,943 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:55:57,943 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:55:57,944 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-28 12:55:57,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:57,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:57,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:57,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,946 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-28 12:55:57,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:57,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:57,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:57,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,947 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-28 12:55:57,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:57,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:57,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,950 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-28 12:55:57,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:57,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:57,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:57,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,953 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-28 12:55:57,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:57,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:57,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:57,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,955 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-28 12:55:57,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:57,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:57,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:57,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,957 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-28 12:55:57,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:57,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:57,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:57,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,958 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-28 12:55:57,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:57,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:57,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:57,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,960 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-28 12:55:57,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:57,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:57,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:57,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,961 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-28 12:55:57,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:57,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:57,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:57,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,963 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-28 12:55:57,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:57,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:57,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,969 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-28 12:55:57,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,970 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:55:57,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,971 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:55:57,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:57,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,975 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-28 12:55:57,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:57,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:57,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:57,978 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-28 12:55:57,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:57,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:57,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:57,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:57,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:57,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:58,013 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:55:58,025 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:55:58,025 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:55:58,026 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:55:58,027 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:55:58,027 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:55:58,027 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~i) = -2*insertionSort_~i + 1 Supporting invariants [] [2018-11-28 12:55:58,062 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-28 12:55:58,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:58,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:58,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:55:58,220 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 12:55:58,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-28 12:55:58,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 153 states and 185 transitions. Complement of second has 70 states. [2018-11-28 12:55:58,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-28 12:55:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 12:55:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2018-11-28 12:55:58,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 13 letters. Loop has 11 letters. [2018-11-28 12:55:58,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:55:58,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 24 letters. Loop has 11 letters. [2018-11-28 12:55:58,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:55:58,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 13 letters. Loop has 22 letters. [2018-11-28 12:55:58,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:55:58,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 185 transitions. [2018-11-28 12:55:58,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-28 12:55:58,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 185 transitions. [2018-11-28 12:55:58,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-11-28 12:55:58,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-11-28 12:55:58,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 185 transitions. [2018-11-28 12:55:58,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:55:58,585 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 185 transitions. [2018-11-28 12:55:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 185 transitions. [2018-11-28 12:55:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 45. [2018-11-28 12:55:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 12:55:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-28 12:55:58,589 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-28 12:55:58,589 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-28 12:55:58,589 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:55:58,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 55 transitions. [2018-11-28 12:55:58,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 12:55:58,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:55:58,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:55:58,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:58,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:55:58,594 INFO L794 eck$LassoCheckResult]: Stem: 927#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 921#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 915#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 916#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 918#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 919#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 920#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 922#L33-3 assume !(main_~i~0 < main_~n~0); 911#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 917#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 942#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 941#L15-6 #t~short4 := ~j~0 > 0; 910#L15-1 assume !#t~short4; 912#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 928#L15-7 [2018-11-28 12:55:58,594 INFO L796 eck$LassoCheckResult]: Loop: 928#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 905#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 904#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 906#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 923#L15-6 #t~short4 := ~j~0 > 0; 924#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 945#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 928#L15-7 [2018-11-28 12:55:58,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:58,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2018-11-28 12:55:58,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:58,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:58,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:58,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:55:58,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:58,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2018-11-28 12:55:58,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:58,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:58,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:55:58,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:58,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2018-11-28 12:55:58,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:55:58,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:55:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:58,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:55:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:55:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:55:59,152 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:55:59,152 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:55:59,152 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:55:59,152 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:55:59,152 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:55:59,152 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:55:59,152 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:55:59,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:55:59,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-11-28 12:55:59,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:55:59,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:55:59,156 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-28 12:55:59,163 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-28 12:55:59,164 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-28 12:55:59,165 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-28 12:55:59,166 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-28 12:55:59,167 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-28 12:55:59,168 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-28 12:55:59,169 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-28 12:55:59,381 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-28 12:55:59,382 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-28 12:55:59,383 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-28 12:55:59,384 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-28 12:55:59,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-28 12:55:59,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-28 12:55:59,387 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-28 12:55:59,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-28 12:55:59,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-28 12:55:59,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-28 12:55:59,390 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-28 12:55:59,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-28 12:55:59,392 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-28 12:55:59,393 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-28 12:55:59,394 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-28 12:55:59,395 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-28 12:55:59,396 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-28 12:55:59,681 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:55:59,682 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:55:59,682 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-28 12:55:59,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:59,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:59,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:59,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,684 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-28 12:55:59,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:59,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:59,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:59,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,685 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-28 12:55:59,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:59,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:59,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:59,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,691 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-28 12:55:59,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:59,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:59,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:59,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,692 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-28 12:55:59,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:59,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:59,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,695 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-28 12:55:59,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:59,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:59,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:59,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,696 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-28 12:55:59,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:55:59,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:55:59,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:55:59,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,697 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-28 12:55:59,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:59,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:59,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,702 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-28 12:55:59,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,703 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:55:59,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,704 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:55:59,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:59,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,708 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-28 12:55:59,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:59,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:59,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,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-28 12:55:59,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:59,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:59,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:55:59,721 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-28 12:55:59,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:55:59,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:55:59,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:55:59,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:55:59,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:55:59,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:55:59,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:55:59,777 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:55:59,778 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 12:55:59,778 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:55:59,779 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:55:59,779 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:55:59,779 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_#in~array.base)_2, insertionSort_~array.offset, insertionSort_~j~0) = 1*v_rep(select #length insertionSort_#in~array.base)_2 - 1*insertionSort_~array.offset - 4*insertionSort_~j~0 Supporting invariants [] [2018-11-28 12:55:59,820 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2018-11-28 12:55:59,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:55:59,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:55:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:59,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:55:59,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:55:59,964 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-28 12:55:59,964 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2018-11-28 12:55:59,964 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-11-28 12:56:00,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13. Second operand 8 states. Result 81 states and 95 transitions. Complement of second has 17 states. [2018-11-28 12:56:00,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:56:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:56:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-28 12:56:00,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-28 12:56:00,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:00,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-28 12:56:00,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:00,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 14 letters. Loop has 14 letters. [2018-11-28 12:56:00,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:00,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 95 transitions. [2018-11-28 12:56:00,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 12:56:00,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 69 states and 81 transitions. [2018-11-28 12:56:00,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 12:56:00,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 12:56:00,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 81 transitions. [2018-11-28 12:56:00,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:56:00,084 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-11-28 12:56:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 81 transitions. [2018-11-28 12:56:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-11-28 12:56:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 12:56:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-11-28 12:56:00,089 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-28 12:56:00,090 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-28 12:56:00,090 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 12:56:00,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2018-11-28 12:56:00,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 12:56:00,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:56:00,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:56:00,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:00,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:00,091 INFO L794 eck$LassoCheckResult]: Stem: 1198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1191#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1184#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1185#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1188#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1189#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1190#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1207#L33-3 assume !(main_~i~0 < main_~n~0); 1186#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1187#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1217#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1214#L15-6 #t~short4 := ~j~0 > 0; 1210#L15-1 assume !#t~short4; 1209#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1199#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1193#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1226#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1223#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1221#L15-6 #t~short4 := ~j~0 > 0; 1220#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1201#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1202#L15-5 [2018-11-28 12:56:00,091 INFO L796 eck$LassoCheckResult]: Loop: 1202#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1192#L15-6 #t~short4 := ~j~0 > 0; 1194#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1232#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1208#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1175#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1174#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1176#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1205#L15-6 #t~short4 := ~j~0 > 0; 1180#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1181#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1202#L15-5 [2018-11-28 12:56:00,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:00,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961465, now seen corresponding path program 1 times [2018-11-28 12:56:00,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:00,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:00,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:00,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:00,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:00,109 INFO L82 PathProgramCache]: Analyzing trace with hash -148104591, now seen corresponding path program 1 times [2018-11-28 12:56:00,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:00,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:00,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:00,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash -670188039, now seen corresponding path program 2 times [2018-11-28 12:56:00,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:00,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 12:56:00,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:56:00,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:56:00,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:56:00,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:56:00,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:56:00,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 12:56:00,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:56:00,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-11-28 12:56:00,612 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-11-28 12:56:00,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:56:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:56:00,659 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-28 12:56:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:00,776 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-28 12:56:00,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:56:00,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 110 transitions. [2018-11-28 12:56:00,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 12:56:00,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 91 states and 105 transitions. [2018-11-28 12:56:00,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 12:56:00,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 12:56:00,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 105 transitions. [2018-11-28 12:56:00,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:56:00,780 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-11-28 12:56:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 105 transitions. [2018-11-28 12:56:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-11-28 12:56:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 12:56:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-11-28 12:56:00,786 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-11-28 12:56:00,786 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-11-28 12:56:00,786 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 12:56:00,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 91 transitions. [2018-11-28 12:56:00,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 12:56:00,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:56:00,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:56:00,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:00,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:00,788 INFO L794 eck$LassoCheckResult]: Stem: 1489#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1482#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1475#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1476#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1479#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1480#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1481#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1501#L33-3 assume !(main_~i~0 < main_~n~0); 1477#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1478#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1510#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1509#L15-6 #t~short4 := ~j~0 > 0; 1507#L15-1 assume !#t~short4; 1504#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1505#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1473#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1534#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1533#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1532#L15-6 #t~short4 := ~j~0 > 0; 1531#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1530#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1528#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1527#L15-6 #t~short4 := ~j~0 > 0; 1519#L15-1 assume !#t~short4; 1513#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1494#L15-7 [2018-11-28 12:56:00,788 INFO L796 eck$LassoCheckResult]: Loop: 1494#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1465#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1464#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1466#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1483#L15-6 #t~short4 := ~j~0 > 0; 1470#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1471#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1494#L15-7 [2018-11-28 12:56:00,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1796534224, now seen corresponding path program 3 times [2018-11-28 12:56:00,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:00,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:00,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:00,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:00,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 5 times [2018-11-28 12:56:00,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:00,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:00,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:00,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:00,815 INFO L82 PathProgramCache]: Analyzing trace with hash 9870329, now seen corresponding path program 4 times [2018-11-28 12:56:00,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:00,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:56:00,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:56:00,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_113ce38d-1956-4856-9ffd-5c7d5cf7d397/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:56:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 12:56:00,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 12:56:00,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:56:00,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:56:01,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:56:01,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-28 12:56:01,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 12:56:01,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-11-28 12:56:01,272 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. cyclomatic complexity: 18 Second operand 23 states. [2018-11-28 12:56:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:56:01,437 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-11-28 12:56:01,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 12:56:01,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 136 transitions. [2018-11-28 12:56:01,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 12:56:01,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 81 states and 94 transitions. [2018-11-28 12:56:01,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 12:56:01,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 12:56:01,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 94 transitions. [2018-11-28 12:56:01,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:56:01,439 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-11-28 12:56:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 94 transitions. [2018-11-28 12:56:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-28 12:56:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 12:56:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2018-11-28 12:56:01,443 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-11-28 12:56:01,443 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-11-28 12:56:01,443 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 12:56:01,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 93 transitions. [2018-11-28 12:56:01,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 12:56:01,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:56:01,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:56:01,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:01,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:01,444 INFO L794 eck$LassoCheckResult]: Stem: 1829#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1822#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1817#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1818#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1819#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1820#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1821#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1851#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1842#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1841#L33-3 assume !(main_~i~0 < main_~n~0); 1805#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1804#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1806#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1850#L15-6 #t~short4 := ~j~0 > 0; 1848#L15-1 assume !#t~short4; 1844#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1832#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1808#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1807#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1809#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1882#L15-6 #t~short4 := ~j~0 > 0; 1881#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1880#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1879#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1853#L15-6 #t~short4 := ~j~0 > 0; 1849#L15-1 assume !#t~short4; 1845#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1843#L15-7 [2018-11-28 12:56:01,444 INFO L796 eck$LassoCheckResult]: Loop: 1843#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1812#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1828#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1838#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1823#L15-6 #t~short4 := ~j~0 > 0; 1824#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1860#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1843#L15-7 [2018-11-28 12:56:01,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash 17685426, now seen corresponding path program 5 times [2018-11-28 12:56:01,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:01,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:01,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:01,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:01,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 6 times [2018-11-28 12:56:01,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:01,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:01,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:01,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:01,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:01,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:01,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1495415351, now seen corresponding path program 6 times [2018-11-28 12:56:01,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:01,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:01,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:01,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:01,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:02,049 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2018-11-28 12:56:02,209 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-28 12:56:02,447 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-28 12:56:02,491 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:56:02,491 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:56:02,491 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:56:02,491 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:56:02,491 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:56:02,491 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:56:02,491 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:56:02,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:56:02,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration11_Lasso [2018-11-28 12:56:02,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:56:02,492 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:56:02,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-28 12:56:02,495 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-28 12:56:02,496 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-28 12:56:02,497 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-28 12:56:02,499 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-28 12:56:02,500 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-28 12:56:02,500 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-28 12:56:02,501 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-28 12:56:02,502 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-28 12:56:02,703 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-28 12:56:02,706 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-28 12:56:02,708 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-28 12:56:02,709 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-28 12:56:02,711 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-28 12:56:02,712 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-28 12:56:02,715 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-28 12:56:02,718 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-28 12:56:02,718 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-28 12:56:02,719 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-28 12:56:02,720 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-28 12:56:02,721 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-28 12:56:02,722 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-28 12:56:02,723 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-28 12:56:02,724 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-28 12:56:02,964 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:56:02,964 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:56:02,965 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-28 12:56:02,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:02,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:02,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:02,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,966 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-28 12:56:02,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:02,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:02,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:02,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,980 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-28 12:56:02,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:02,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:02,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:02,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,981 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-28 12:56:02,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:56:02,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:56:02,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,984 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-28 12:56:02,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:02,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:02,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:02,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,986 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-28 12:56:02,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:02,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:02,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:02,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,988 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-28 12:56:02,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:02,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:02,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:02,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,990 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-28 12:56:02,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:02,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:02,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:02,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,991 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-28 12:56:02,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:02,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:02,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:02,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,992 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-28 12:56:02,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:56:02,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:56:02,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,995 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-28 12:56:02,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:02,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:02,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:02,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:02,996 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-28 12:56:02,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:02,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:02,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:02,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:02,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:56:02,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:56:03,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:03,007 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-28 12:56:03,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:03,007 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:56:03,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:03,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:03,008 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:56:03,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:56:03,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:03,012 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-28 12:56:03,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:03,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:03,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:03,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:03,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:56:03,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:56:03,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:03,017 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-28 12:56:03,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:03,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:03,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:03,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:03,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:56:03,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:56:03,096 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:56:03,118 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:56:03,119 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 12:56:03,119 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:56:03,120 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:56:03,120 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:56:03,120 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_3, insertionSort_~i, insertionSort_~array.offset) = 1*v_rep(select #length insertionSort_~array.base)_3 - 4*insertionSort_~i - 1*insertionSort_~array.offset Supporting invariants [] [2018-11-28 12:56:03,175 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 12:56:03,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:56:03,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:03,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:03,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:03,271 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-28 12:56:03,272 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 12:56:03,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-28 12:56:03,332 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 137 states and 163 transitions. Complement of second has 14 states. [2018-11-28 12:56:03,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:56:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:56:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-28 12:56:03,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2018-11-28 12:56:03,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:03,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2018-11-28 12:56:03,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:03,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2018-11-28 12:56:03,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:03,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 163 transitions. [2018-11-28 12:56:03,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:56:03,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 92 states and 107 transitions. [2018-11-28 12:56:03,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-28 12:56:03,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 12:56:03,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 107 transitions. [2018-11-28 12:56:03,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:56:03,337 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 107 transitions. [2018-11-28 12:56:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 107 transitions. [2018-11-28 12:56:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-11-28 12:56:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 12:56:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-11-28 12:56:03,341 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-11-28 12:56:03,341 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-11-28 12:56:03,341 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 12:56:03,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 100 transitions. [2018-11-28 12:56:03,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 12:56:03,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:56:03,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:56:03,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:56:03,342 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:56:03,343 INFO L794 eck$LassoCheckResult]: Stem: 2219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2214#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 2209#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2210#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2211#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2212#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2213#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2215#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2235#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2234#L33-3 assume !(main_~i~0 < main_~n~0); 2198#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2197#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2199#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2229#L15-6 #t~short4 := ~j~0 > 0; 2236#L15-1 assume !#t~short4; 2225#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2226#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2207#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2275#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2274#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2271#L15-6 #t~short4 := ~j~0 > 0; 2206#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2208#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2277#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2201#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2200#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2202#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2273#L15-6 #t~short4 := ~j~0 > 0; 2203#L15-1 [2018-11-28 12:56:03,343 INFO L796 eck$LassoCheckResult]: Loop: 2203#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2205#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 2232#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2216#L15-6 #t~short4 := ~j~0 > 0; 2203#L15-1 [2018-11-28 12:56:03,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:03,343 INFO L82 PathProgramCache]: Analyzing trace with hash 496161610, now seen corresponding path program 3 times [2018-11-28 12:56:03,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:03,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:03,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:03,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2018-11-28 12:56:03,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:03,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:03,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:56:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:03,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1509363707, now seen corresponding path program 7 times [2018-11-28 12:56:03,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:56:03,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:56:03,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:03,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:56:03,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:56:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:56:04,050 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-28 12:56:04,216 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-28 12:56:04,443 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-28 12:56:04,478 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:56:04,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:56:04,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:56:04,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:56:04,479 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:56:04,479 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:56:04,479 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:56:04,479 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:56:04,479 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration12_Lasso [2018-11-28 12:56:04,479 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:56:04,479 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:56:04,481 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-28 12:56:04,482 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-28 12:56:04,484 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-28 12:56:04,485 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-28 12:56:04,635 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-28 12:56:04,636 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-28 12:56:04,637 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-28 12:56:04,638 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-28 12:56:04,640 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-28 12:56:04,641 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-28 12:56:04,642 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-28 12:56:04,643 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-28 12:56:04,644 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-28 12:56:04,645 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-28 12:56:04,646 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-28 12:56:04,646 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-28 12:56:04,647 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-28 12:56:04,648 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-28 12:56:04,649 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-28 12:56:04,650 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-28 12:56:04,650 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-28 12:56:04,651 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-28 12:56:04,652 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-28 12:56:04,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:56:04,850 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:56:04,851 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-28 12:56:04,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:04,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:04,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:04,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:04,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:04,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:04,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:04,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:04,852 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-28 12:56:04,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:04,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:04,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:04,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:04,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:04,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:04,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:04,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:04,853 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-28 12:56:04,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:04,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:04,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:04,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:04,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:56:04,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:56:04,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:04,855 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-28 12:56:04,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:04,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:04,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:04,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:04,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:04,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:04,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:04,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:04,857 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-28 12:56:04,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:04,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:04,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:04,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:04,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:56:04,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:56:04,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:04,862 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-28 12:56:04,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:04,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:04,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:04,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:04,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:04,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:04,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:04,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:04,864 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-28 12:56:04,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:04,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:56:04,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:04,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:56:04,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:04,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:56:04,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:56:04,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:56:04,865 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-28 12:56:04,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:56:04,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:56:04,866 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:56:04,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:56:04,869 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 12:56:04,870 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:56:04,914 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:56:04,958 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 12:56:04,958 INFO L444 ModelExtractionUtils]: 44 out of 56 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-28 12:56:04,959 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:56:04,959 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 12:56:04,960 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:56:04,960 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~array.offset, insertionSort_~j~0) = 1*insertionSort_~array.offset + 4*insertionSort_~j~0 Supporting invariants [] [2018-11-28 12:56:05,006 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 12:56:05,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:05,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:05,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:05,070 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-28 12:56:05,070 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-28 12:56:05,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-28 12:56:05,075 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 90 states and 105 transitions. Complement of second has 8 states. [2018-11-28 12:56:05,075 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-28 12:56:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:56:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-28 12:56:05,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 12:56:05,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:05,076 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:56:05,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:05,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:05,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:05,126 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-28 12:56:05,126 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-28 12:56:05,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-28 12:56:05,133 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 90 states and 105 transitions. Complement of second has 8 states. [2018-11-28 12:56:05,133 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-28 12:56:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:56:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-28 12:56:05,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 12:56:05,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:05,134 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:56:05,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:56:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:05,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:56:05,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:56:05,177 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-28 12:56:05,178 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-28 12:56:05,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-28 12:56:05,189 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 131 states and 157 transitions. Complement of second has 9 states. [2018-11-28 12:56:05,190 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-28 12:56:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:56:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-28 12:56:05,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 12:56:05,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:05,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-28 12:56:05,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:05,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-28 12:56:05,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:56:05,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 157 transitions. [2018-11-28 12:56:05,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:56:05,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 0 states and 0 transitions. [2018-11-28 12:56:05,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:56:05,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:56:05,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:56:05,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:56:05,196 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:56:05,196 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:56:05,196 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:56:05,196 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 12:56:05,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:56:05,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:56:05,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:56:05,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:56:05 BoogieIcfgContainer [2018-11-28 12:56:05,202 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:56:05,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:56:05,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:56:05,202 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:56:05,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:55:53" (3/4) ... [2018-11-28 12:56:05,205 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:56:05,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:56:05,206 INFO L168 Benchmark]: Toolchain (without parser) took 11761.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 197.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:56:05,206 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:56:05,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.42 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:56:05,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.96 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:56:05,207 INFO L168 Benchmark]: Boogie Preprocessor took 50.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:56:05,208 INFO L168 Benchmark]: RCFGBuilder took 186.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:56:05,208 INFO L168 Benchmark]: BuchiAutomizer took 11336.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.9 MB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:56:05,209 INFO L168 Benchmark]: Witness Printer took 3.22 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:56:05,211 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.42 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.96 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 186.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11336.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.9 MB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.22 ms. Allocated memory is still 1.4 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 12 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -1 * array + -4 * j and consists of 8 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -4 * i + -1 * array and consists of 6 locations. One nondeterministic module has affine ranking function array + 4 * j and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.3s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 9.3s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 146 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 85 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/3 HoareTripleCheckerStatistics: 180 SDtfs, 271 SDslu, 400 SDs, 0 SdLazy, 707 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU1 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital241 mio100 ax100 hnf99 lsp93 ukn81 mio100 lsp58 div100 bol101 ite100 ukn100 eq168 hnf88 smp95 dnf122 smp92 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 94ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...