./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/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.24-cad4683 [2019-11-15 23:55:52,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:55:52,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:55:52,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:55:52,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:55:52,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:55:52,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:55:52,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:55:52,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:55:52,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:55:52,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:55:52,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:55:52,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:55:52,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:55:52,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:55:52,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:55:52,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:55:52,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:55:52,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:55:52,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:55:52,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:55:52,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:55:52,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:55:52,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:55:52,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:55:52,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:55:52,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:55:52,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:55:52,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:55:52,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:55:52,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:55:52,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:55:52,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:55:52,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:55:52,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:55:52,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:55:52,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:55:52,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:55:52,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:55:52,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:55:52,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:55:52,837 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:55:52,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:55:52,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:55:52,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:55:52,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:55:52,855 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:55:52,855 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:55:52,855 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:55:52,856 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:55:52,856 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:55:52,856 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:55:52,856 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:55:52,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:55:52,857 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:55:52,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:55:52,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:55:52,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:55:52,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:55:52,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:55:52,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:55:52,858 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:55:52,859 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:55:52,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:55:52,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:55:52,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:55:52,860 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:55:52,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:55:52,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:55:52,860 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:55:52,861 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:55:52,862 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/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 [2019-11-15 23:55:52,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:55:52,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:55:52,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:55:52,901 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:55:52,902 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:55:52,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2019-11-15 23:55:52,964 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/data/76213bdd3/8d17661d301f464da6ea78d7d7819e49/FLAG34da996c4 [2019-11-15 23:55:53,328 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:55:53,329 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2019-11-15 23:55:53,334 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/data/76213bdd3/8d17661d301f464da6ea78d7d7819e49/FLAG34da996c4 [2019-11-15 23:55:53,687 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/data/76213bdd3/8d17661d301f464da6ea78d7d7819e49 [2019-11-15 23:55:53,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:55:53,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:55:53,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:53,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:55:53,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:55:53,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1ea15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53, skipping insertion in model container [2019-11-15 23:55:53,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,704 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:55:53,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:55:53,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:53,898 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:55:53,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:53,988 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:55:53,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53 WrapperNode [2019-11-15 23:55:53,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:53,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:53,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:55:53,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:55:53,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:54,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:54,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:54,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:55:54,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:55:54,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:55:54,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:54,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:54,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:54,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:54,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:54,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:54,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:54,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:55:54,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:55:54,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:55:54,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:55:54,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/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 [2019-11-15 23:55:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:55:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:55:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2019-11-15 23:55:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2019-11-15 23:55:54,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:55:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:55:54,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:55:54,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:55:54,317 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:55:54,318 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:55:54,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:54 BoogieIcfgContainer [2019-11-15 23:55:54,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:55:54,319 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:55:54,320 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:55:54,323 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:55:54,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:55:54,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:55:53" (1/3) ... [2019-11-15 23:55:54,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19b2bd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:55:54, skipping insertion in model container [2019-11-15 23:55:54,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:55:54,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (2/3) ... [2019-11-15 23:55:54,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19b2bd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:55:54, skipping insertion in model container [2019-11-15 23:55:54,335 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:55:54,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:54" (3/3) ... [2019-11-15 23:55:54,336 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2019-11-15 23:55:54,389 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:55:54,390 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:55:54,390 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:55:54,390 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:55:54,390 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:55:54,391 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:55:54,391 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:55:54,391 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:55:54,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 23:55:54,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:55:54,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:54,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:54,443 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:55:54,444 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:55:54,444 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:55:54,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 23:55:54,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:55:54,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:54,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:54,447 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:55:54,447 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:55:54,454 INFO L791 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.allocOnHeap(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 [2019-11-15 23:55:54,454 INFO L793 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 [2019-11-15 23:55:54,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2019-11-15 23:55:54,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:54,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067793933] [2019-11-15 23:55:54,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:54,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:54,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:54,565 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2019-11-15 23:55:54,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:54,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79183144] [2019-11-15 23:55:54,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:54,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:54,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:54,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:54,586 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2019-11-15 23:55:54,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:54,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151025932] [2019-11-15 23:55:54,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:54,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:54,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:54,624 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:54,800 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:55:54,800 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:55:54,801 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:55:54,801 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:55:54,801 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:55:54,801 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:55:54,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:55:54,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:55:54,802 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2019-11-15 23:55:54,802 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:55:54,802 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:55:54,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:54,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:54,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:54,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:54,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:54,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:55,275 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:55:55,280 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:55:55,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:55,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:55,284 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:55,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:55,285 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:55,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:55,287 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:55,287 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:55,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:55,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:55,291 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:55,292 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:55,292 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:55,292 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:55,292 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:55,293 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:55,293 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:55,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:55,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:55,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:55,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:55,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:55,295 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:55,298 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:55,298 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:55,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:55,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:55,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:55,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:55,309 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:55,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:55,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:55,311 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:55,311 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:55,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:55,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:55,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:55,320 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:55:55,320 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:55,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:55,325 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:55:55,325 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:55,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:55,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:55,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:55,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:55,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:55,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:55,373 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:55,376 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:55,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:55,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:55,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:55,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:55,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:55,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:55,410 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:55,412 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:55,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:55,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:55,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:55,418 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:55:55,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:55,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:55,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:55,419 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:55:55,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:55:55,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:55:55,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:55:55,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:55:55,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:55:55,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:55:55,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:55:55,433 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:55:55,434 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:55:55,503 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:55:55,551 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:55:55,551 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:55:55,553 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:55:55,555 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:55:55,555 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:55:55,556 INFO L512 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 [] [2019-11-15 23:55:55,569 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:55:55,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:55,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:55:55,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:55,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:55:55,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:55,653 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 [2019-11-15 23:55:55,655 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-11-15 23:55:55,711 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. [2019-11-15 23:55:55,712 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 [2019-11-15 23:55:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:55:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2019-11-15 23:55:55,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-15 23:55:55,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:55:55,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 23:55:55,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:55:55,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-15 23:55:55,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:55:55,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 23:55:55,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:55,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-11-15 23:55:55,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:55:55,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:55:55,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-15 23:55:55,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:55:55,732 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 23:55:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-15 23:55:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 23:55:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 23:55:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-15 23:55:55,762 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 23:55:55,762 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 23:55:55,763 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:55:55,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-15 23:55:55,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:55,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:55,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:55,766 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:55:55,767 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:55:55,768 INFO L791 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.allocOnHeap(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 [2019-11-15 23:55:55,768 INFO L793 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 [2019-11-15 23:55:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:55,769 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2019-11-15 23:55:55,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:55,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532362719] [2019-11-15 23:55:55,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:55,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:55,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:55,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532362719] [2019-11-15 23:55:55,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:55,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:55,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718922755] [2019-11-15 23:55:55,862 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:55:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2019-11-15 23:55:55,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:55,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436445448] [2019-11-15 23:55:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:55,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:55,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436445448] [2019-11-15 23:55:55,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:55,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:55:55,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431540762] [2019-11-15 23:55:55,877 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:55:55,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:55,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:55:55,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:55:55,885 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2019-11-15 23:55:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:55,892 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-15 23:55:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:55:55,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-15 23:55:55,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:55,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-15 23:55:55,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 23:55:55,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:55:55,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-15 23:55:55,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:55:55,899 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 23:55:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-15 23:55:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 23:55:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 23:55:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-15 23:55:55,909 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 23:55:55,909 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 23:55:55,909 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:55:55,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-15 23:55:55,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:55,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:55,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:55,913 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:55:55,913 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:55,913 INFO L791 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.allocOnHeap(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 [2019-11-15 23:55:55,913 INFO L793 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~short4;havoc #t~mem3; 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 [2019-11-15 23:55:55,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:55,914 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2019-11-15 23:55:55,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:55,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139204414] [2019-11-15 23:55:55,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:55,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:55,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:55,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139204414] [2019-11-15 23:55:55,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:55,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:55,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445750458] [2019-11-15 23:55:55,948 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:55:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:55,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2019-11-15 23:55:55,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:55,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813460207] [2019-11-15 23:55:55,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:55,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:55,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:55,986 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:56,257 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-15 23:55:56,485 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 23:55:56,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:56,545 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 23:55:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:56,562 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-15 23:55:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:56,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-11-15 23:55:56,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:56,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2019-11-15 23:55:56,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 23:55:56,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:55:56,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-15 23:55:56,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:55:56,566 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 23:55:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-15 23:55:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-15 23:55:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 23:55:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-15 23:55:56,568 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 23:55:56,568 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 23:55:56,568 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:55:56,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-15 23:55:56,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:56,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:56,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:56,569 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:56,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:56,570 INFO L791 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.allocOnHeap(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 [2019-11-15 23:55:56,570 INFO L793 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~short4;havoc #t~mem3; 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 [2019-11-15 23:55:56,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:56,570 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2019-11-15 23:55:56,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:56,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119071778] [2019-11-15 23:55:56,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:56,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:56,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:56,603 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2019-11-15 23:55:56,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:56,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765513884] [2019-11-15 23:55:56,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:56,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:56,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:56,644 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2019-11-15 23:55:56,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:56,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903270703] [2019-11-15 23:55:56,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:56,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:56,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:55:56,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903270703] [2019-11-15 23:55:56,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:56,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:56,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231311002] [2019-11-15 23:55:56,905 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-11-15 23:55:57,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:57,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:57,090 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-15 23:55:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:57,192 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-11-15 23:55:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:55:57,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-11-15 23:55:57,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:57,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-11-15 23:55:57,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 23:55:57,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 23:55:57,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-11-15 23:55:57,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:55:57,195 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 23:55:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-11-15 23:55:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-11-15 23:55:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 23:55:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-15 23:55:57,198 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 23:55:57,198 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 23:55:57,198 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:55:57,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-15 23:55:57,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:57,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:57,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:57,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:57,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:57,200 INFO L791 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.allocOnHeap(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~short4;havoc #t~mem3; 261#L15-7 [2019-11-15 23:55:57,200 INFO L793 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~short4;havoc #t~mem3; 261#L15-7 [2019-11-15 23:55:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:57,200 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2019-11-15 23:55:57,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:57,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3060689] [2019-11-15 23:55:57,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:57,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:57,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:57,220 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:57,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2019-11-15 23:55:57,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:57,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066354298] [2019-11-15 23:55:57,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:57,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:57,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:57,236 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2019-11-15 23:55:57,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:57,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652566597] [2019-11-15 23:55:57,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:57,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:57,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:57,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652566597] [2019-11-15 23:55:57,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276177247] [2019-11-15 23:55:57,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:57,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:55:57,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:57,639 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:55:57,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-11-15 23:55:57,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602488600] [2019-11-15 23:55:57,758 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-11-15 23:55:58,131 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-15 23:55:58,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:58,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:55:58,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:55:58,208 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 16 states. [2019-11-15 23:55:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:58,364 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-11-15 23:55:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:55:58,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-11-15 23:55:58,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:58,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 26 transitions. [2019-11-15 23:55:58,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 23:55:58,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 23:55:58,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2019-11-15 23:55:58,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:55:58,370 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-15 23:55:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2019-11-15 23:55:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 23:55:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 23:55:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-15 23:55:58,373 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 23:55:58,373 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 23:55:58,376 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:55:58,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-11-15 23:55:58,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:55:58,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:55:58,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:55:58,377 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:58,377 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:58,378 INFO L791 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 395#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; 389#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 390#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; 392#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 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; 401#L33-3 assume !(main_~i~0 < main_~n~0); 387#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 391#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 404#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; 403#L15-6 #t~short4 := ~j~0 > 0; 386#L15-1 assume !#t~short4; 388#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 399#L15-7 [2019-11-15 23:55:58,378 INFO L793 eck$LassoCheckResult]: Loop: 399#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 384#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 383#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 385#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; 396#L15-6 #t~short4 := ~j~0 > 0; 397#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; 402#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 399#L15-7 [2019-11-15 23:55:58,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:58,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2019-11-15 23:55:58,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:58,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811464794] [2019-11-15 23:55:58,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:58,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:58,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:58,399 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:58,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:58,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2019-11-15 23:55:58,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:58,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60274031] [2019-11-15 23:55:58,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:58,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:58,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:58,412 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:58,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2019-11-15 23:55:58,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:58,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033178333] [2019-11-15 23:55:58,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:58,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:58,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:58,442 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:58,792 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-15 23:55:59,056 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-11-15 23:55:59,295 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-11-15 23:55:59,372 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:55:59,372 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:55:59,372 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:55:59,372 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:55:59,372 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:55:59,372 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:55:59,372 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:55:59,372 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:55:59,373 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2019-11-15 23:55:59,373 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:55:59,373 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:55:59,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23: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 [2019-11-15 23: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 [2019-11-15 23: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 [2019-11-15 23: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 [2019-11-15 23:55:59,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,576 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-11-15 23:55:59,893 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-11-15 23:55:59,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:55:59,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:00,438 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:56:00,438 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:56:00,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,440 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,441 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,441 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,443 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,446 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,447 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:00,447 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:00,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,450 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,451 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,453 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,453 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,455 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,458 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,458 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,460 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,460 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,461 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,463 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,463 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,465 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,465 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,466 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:00,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,468 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:00,468 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:00,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,469 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,471 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:00,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:00,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:00,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:00,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:00,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:00,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:00,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:00,479 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:00,479 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:00,534 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:56:00,596 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:56:00,596 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:56:00,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:56:00,597 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:56:00,598 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:56:00,598 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~size, insertionSort_~j~0) = 1*insertionSort_~size - 1*insertionSort_~j~0 Supporting invariants [] [2019-11-15 23:56:00,624 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-11-15 23:56:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:00,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:56:00,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:00,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:56:00,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:00,766 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-15 23:56:00,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-15 23:56:00,861 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 40 states and 47 transitions. Complement of second has 16 states. [2019-11-15 23:56:00,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:56:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:56:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2019-11-15 23:56:00,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 14 letters. Loop has 7 letters. [2019-11-15 23:56:00,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:00,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2019-11-15 23:56:00,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:00,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 14 letters. Loop has 14 letters. [2019-11-15 23:56:00,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:00,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2019-11-15 23:56:00,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:56:00,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 34 states and 40 transitions. [2019-11-15 23:56:00,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 23:56:00,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 23:56:00,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2019-11-15 23:56:00,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:56:00,867 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-15 23:56:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2019-11-15 23:56:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-15 23:56:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 23:56:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-15 23:56:00,870 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-15 23:56:00,870 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-15 23:56:00,870 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:56:00,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2019-11-15 23:56:00,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:56:00,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:56:00,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:56:00,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:00,872 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:56:00,872 INFO L791 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 603#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; 597#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 598#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; 600#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 601#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; 602#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 612#L33-3 assume !(main_~i~0 < main_~n~0); 593#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 599#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 617#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; 604#L15-6 #t~short4 := ~j~0 > 0; 592#L15-1 assume !#t~short4; 594#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 608#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 590#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 589#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 591#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; 605#L15-6 #t~short4 := ~j~0 > 0; 606#L15-1 assume !#t~short4; 616#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 610#L15-5 [2019-11-15 23:56:00,872 INFO L793 eck$LassoCheckResult]: Loop: 610#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 611#L15-6 #t~short4 := ~j~0 > 0; 615#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; 614#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 610#L15-5 [2019-11-15 23:56:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:00,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961527, now seen corresponding path program 1 times [2019-11-15 23:56:00,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:00,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593433524] [2019-11-15 23:56:00,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:00,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:00,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:56:00,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593433524] [2019-11-15 23:56:00,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:00,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:56:00,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151318589] [2019-11-15 23:56:00,895 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:56:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:00,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1526396, now seen corresponding path program 1 times [2019-11-15 23:56:00,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:00,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002382798] [2019-11-15 23:56:00,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:00,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:00,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:00,902 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:00,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:00,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:00,987 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:56:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:00,995 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-11-15 23:56:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:00,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2019-11-15 23:56:00,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:56:00,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 39 transitions. [2019-11-15 23:56:00,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 23:56:00,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 23:56:00,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2019-11-15 23:56:00,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:56:00,998 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-11-15 23:56:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2019-11-15 23:56:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-15 23:56:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:56:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-15 23:56:01,001 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-15 23:56:01,001 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-15 23:56:01,001 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:56:01,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2019-11-15 23:56:01,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:56:01,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:56:01,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:56:01,002 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:01,002 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:56:01,003 INFO L791 eck$LassoCheckResult]: Stem: 681#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 674#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; 669#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 670#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; 671#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 672#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; 673#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 675#L33-3 assume !(main_~i~0 < main_~n~0); 660#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 659#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 661#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; 676#L15-6 #t~short4 := ~j~0 > 0; 665#L15-1 assume !#t~short4; 666#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 684#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 663#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 662#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 664#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; 677#L15-6 #t~short4 := ~j~0 > 0; 678#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; 687#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 685#L15-5 [2019-11-15 23:56:01,003 INFO L793 eck$LassoCheckResult]: Loop: 685#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 686#L15-6 #t~short4 := ~j~0 > 0; 690#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; 688#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 685#L15-5 [2019-11-15 23:56:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961465, now seen corresponding path program 1 times [2019-11-15 23:56:01,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:01,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162375014] [2019-11-15 23:56:01,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:01,029 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1526396, now seen corresponding path program 2 times [2019-11-15 23:56:01,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:01,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130752657] [2019-11-15 23:56:01,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:01,036 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1796534284, now seen corresponding path program 1 times [2019-11-15 23:56:01,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:01,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007398538] [2019-11-15 23:56:01,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:56:01,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007398538] [2019-11-15 23:56:01,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589718057] [2019-11-15 23:56:01,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:01,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:56:01,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:01,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:56:01,199 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:01,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-11-15 23:56:01,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118363488] [2019-11-15 23:56:01,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:01,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:56:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:56:01,279 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-11-15 23:56:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:01,497 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-11-15 23:56:01,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:56:01,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 58 transitions. [2019-11-15 23:56:01,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:56:01,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 58 transitions. [2019-11-15 23:56:01,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:56:01,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 23:56:01,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 58 transitions. [2019-11-15 23:56:01,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:56:01,500 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 58 transitions. [2019-11-15 23:56:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 58 transitions. [2019-11-15 23:56:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-11-15 23:56:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 23:56:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-11-15 23:56:01,503 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-15 23:56:01,503 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-15 23:56:01,503 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:56:01,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2019-11-15 23:56:01,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:56:01,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:56:01,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:56:01,505 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:01,505 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:01,505 INFO L791 eck$LassoCheckResult]: Stem: 876#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 872#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; 865#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 866#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; 869#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 870#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; 871#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 884#L33-3 assume !(main_~i~0 < main_~n~0); 867#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 868#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 889#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; 888#L15-6 #t~short4 := ~j~0 > 0; 887#L15-1 assume !#t~short4; 886#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 878#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 861#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 877#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 895#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; 874#L15-6 #t~short4 := ~j~0 > 0; 875#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; 880#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 881#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 873#L15-6 #t~short4 := ~j~0 > 0; 860#L15-1 assume !#t~short4; 862#L15-3 [2019-11-15 23:56:01,505 INFO L793 eck$LassoCheckResult]: Loop: 862#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 885#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 855#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 854#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 856#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; 882#L15-6 #t~short4 := ~j~0 > 0; 892#L15-1 assume !#t~short4; 862#L15-3 [2019-11-15 23:56:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:01,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 2 times [2019-11-15 23:56:01,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:01,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494147260] [2019-11-15 23:56:01,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:01,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:01,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash -497256520, now seen corresponding path program 1 times [2019-11-15 23:56:01,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:01,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420691097] [2019-11-15 23:56:01,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:01,540 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:01,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1939981049, now seen corresponding path program 3 times [2019-11-15 23:56:01,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:01,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151008601] [2019-11-15 23:56:01,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:01,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:56:01,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151008601] [2019-11-15 23:56:01,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594857066] [2019-11-15 23:56:01,632 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:01,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 23:56:01,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:56:01,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:56:01,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:01,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:56:01,770 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:01,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-15 23:56:01,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973910000] [2019-11-15 23:56:02,082 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-11-15 23:56:02,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:02,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:56:02,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:56:02,149 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. cyclomatic complexity: 9 Second operand 14 states. [2019-11-15 23:56:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:02,513 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-11-15 23:56:02,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:56:02,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2019-11-15 23:56:02,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 23:56:02,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 62 transitions. [2019-11-15 23:56:02,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-15 23:56:02,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 23:56:02,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 62 transitions. [2019-11-15 23:56:02,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:56:02,516 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-11-15 23:56:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 62 transitions. [2019-11-15 23:56:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2019-11-15 23:56:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 23:56:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-11-15 23:56:02,520 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-11-15 23:56:02,520 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-11-15 23:56:02,520 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:56:02,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2019-11-15 23:56:02,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 23:56:02,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:56:02,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:56:02,521 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:02,522 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:02,522 INFO L791 eck$LassoCheckResult]: Stem: 1111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1105#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; 1100#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1101#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; 1102#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1103#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; 1104#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1119#L33-3 assume !(main_~i~0 < main_~n~0); 1090#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1089#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1091#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; 1128#L15-6 #t~short4 := ~j~0 > 0; 1127#L15-1 assume !#t~short4; 1126#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1125#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1096#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1124#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1123#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; 1121#L15-6 #t~short4 := ~j~0 > 0; 1122#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; 1130#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 1133#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1106#L15-6 #t~short4 := ~j~0 > 0; 1095#L15-1 assume !#t~short4; 1097#L15-3 [2019-11-15 23:56:02,522 INFO L793 eck$LassoCheckResult]: Loop: 1097#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1112#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1109#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1110#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1116#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; 1117#L15-6 #t~short4 := ~j~0 > 0; 1131#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; 1129#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 1115#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1118#L15-6 #t~short4 := ~j~0 > 0; 1132#L15-1 assume !#t~short4; 1097#L15-3 [2019-11-15 23:56:02,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:02,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 4 times [2019-11-15 23:56:02,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:02,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977528991] [2019-11-15 23:56:02,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:02,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:02,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:02,546 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash -346675363, now seen corresponding path program 1 times [2019-11-15 23:56:02,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:02,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688730707] [2019-11-15 23:56:02,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:02,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:02,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:02,558 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1989274142, now seen corresponding path program 5 times [2019-11-15 23:56:02,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:02,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603047448] [2019-11-15 23:56:02,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:02,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:02,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:56:02,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603047448] [2019-11-15 23:56:02,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005809451] [2019-11-15 23:56:02,676 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:02,772 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-15 23:56:02,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:56:02,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:56:02,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:02,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:56:02,860 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:02,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 16 [2019-11-15 23:56:02,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334904201] [2019-11-15 23:56:02,981 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-11-15 23:56:03,269 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-11-15 23:56:03,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:56:03,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:56:03,334 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 9 Second operand 17 states. [2019-11-15 23:56:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:03,725 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-15 23:56:03,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:56:03,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 65 transitions. [2019-11-15 23:56:03,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-15 23:56:03,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 65 transitions. [2019-11-15 23:56:03,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-15 23:56:03,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-15 23:56:03,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2019-11-15 23:56:03,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:56:03,728 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-11-15 23:56:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2019-11-15 23:56:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2019-11-15 23:56:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 23:56:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-11-15 23:56:03,732 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-11-15 23:56:03,732 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-11-15 23:56:03,732 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:56:03,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2019-11-15 23:56:03,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 23:56:03,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:56:03,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:56:03,733 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:03,733 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:03,734 INFO L791 eck$LassoCheckResult]: Stem: 1375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1369#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; 1364#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1365#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; 1366#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1367#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; 1368#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1382#L33-3 assume !(main_~i~0 < main_~n~0); 1354#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1353#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1355#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; 1386#L15-6 #t~short4 := ~j~0 > 0; 1385#L15-1 assume !#t~short4; 1384#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1383#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1357#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1356#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1358#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; 1371#L15-6 #t~short4 := ~j~0 > 0; 1372#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; 1390#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 1392#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1370#L15-6 #t~short4 := ~j~0 > 0; 1359#L15-1 assume !#t~short4; 1360#L15-3 [2019-11-15 23:56:03,734 INFO L793 eck$LassoCheckResult]: Loop: 1360#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1376#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1373#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1374#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1378#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; 1379#L15-6 #t~short4 := ~j~0 > 0; 1400#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; 1399#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 1380#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1381#L15-6 #t~short4 := ~j~0 > 0; 1391#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; 1388#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 1389#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1398#L15-6 #t~short4 := ~j~0 > 0; 1397#L15-1 assume !#t~short4; 1360#L15-3 [2019-11-15 23:56:03,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:03,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 6 times [2019-11-15 23:56:03,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:03,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253825536] [2019-11-15 23:56:03,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:03,757 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:03,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2062908546, now seen corresponding path program 2 times [2019-11-15 23:56:03,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:03,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453461118] [2019-11-15 23:56:03,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:03,772 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1457523005, now seen corresponding path program 7 times [2019-11-15 23:56:03,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:03,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836877398] [2019-11-15 23:56:03,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:03,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:03,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836877398] [2019-11-15 23:56:03,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691560638] [2019-11-15 23:56:03,895 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc2525f9-1ff2-4e7e-818e-b90ffb371b3b/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:03,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:56:03,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:04,193 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:04,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2019-11-15 23:56:04,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014352937] [2019-11-15 23:56:04,416 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-11-15 23:56:04,852 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-15 23:56:04,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 23:56:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:56:04,931 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. cyclomatic complexity: 9 Second operand 23 states. [2019-11-15 23:56:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:05,107 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-11-15 23:56:05,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:56:05,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 84 transitions. [2019-11-15 23:56:05,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 23:56:05,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 51 states and 57 transitions. [2019-11-15 23:56:05,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-15 23:56:05,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-15 23:56:05,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 57 transitions. [2019-11-15 23:56:05,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:56:05,110 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-15 23:56:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 57 transitions. [2019-11-15 23:56:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-15 23:56:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 23:56:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-11-15 23:56:05,115 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-11-15 23:56:05,115 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-11-15 23:56:05,115 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:56:05,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 56 transitions. [2019-11-15 23:56:05,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 23:56:05,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:56:05,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:56:05,117 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:05,117 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:05,118 INFO L791 eck$LassoCheckResult]: Stem: 1656#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1651#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; 1644#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1645#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; 1648#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1652#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; 1670#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1649#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; 1650#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1662#L33-3 assume !(main_~i~0 < main_~n~0); 1646#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1647#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1668#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; 1667#L15-6 #t~short4 := ~j~0 > 0; 1666#L15-1 assume !#t~short4; 1665#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1657#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1637#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1636#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1638#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; 1654#L15-6 #t~short4 := ~j~0 > 0; 1655#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; 1669#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 1676#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1674#L15-6 #t~short4 := ~j~0 > 0; 1671#L15-1 assume !#t~short4; 1664#L15-3 [2019-11-15 23:56:05,118 INFO L793 eck$LassoCheckResult]: Loop: 1664#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1663#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1634#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1633#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1635#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; 1653#L15-6 #t~short4 := ~j~0 > 0; 1639#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; 1640#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 1660#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1661#L15-6 #t~short4 := ~j~0 > 0; 1678#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; 1673#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 1677#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1675#L15-6 #t~short4 := ~j~0 > 0; 1672#L15-1 assume !#t~short4; 1664#L15-3 [2019-11-15 23:56:05,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash 970401822, now seen corresponding path program 8 times [2019-11-15 23:56:05,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:05,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503072399] [2019-11-15 23:56:05,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:05,141 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2062908546, now seen corresponding path program 3 times [2019-11-15 23:56:05,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:05,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403357065] [2019-11-15 23:56:05,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:05,156 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:05,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:05,156 INFO L82 PathProgramCache]: Analyzing trace with hash -798001467, now seen corresponding path program 9 times [2019-11-15 23:56:05,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:05,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383351334] [2019-11-15 23:56:05,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:05,199 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:05,567 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-11-15 23:56:06,082 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-15 23:56:06,192 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 23:56:06,299 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-11-15 23:56:06,738 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-11-15 23:56:06,988 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-11-15 23:56:07,392 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2019-11-15 23:56:07,471 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:56:07,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:56:07,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:56:07,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:56:07,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:56:07,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:56:07,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:56:07,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:56:07,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration12_Lasso [2019-11-15 23:56:07,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:56:07,471 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:56:07,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,700 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-11-15 23:56:07,922 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-11-15 23:56:07,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:07,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:08,397 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:56:08,397 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:56:08,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,399 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,401 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,402 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,402 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,402 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,404 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,406 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,407 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,409 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:08,409 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:08,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,413 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,414 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:08,414 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:08,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,416 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,417 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,417 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,418 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,419 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,419 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,421 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,423 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,423 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,423 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,425 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,426 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,428 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,428 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:08,428 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:08,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,431 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,431 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,432 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,433 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,434 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,435 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,435 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,435 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,436 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,436 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,436 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,437 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,438 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,438 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,440 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,441 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,441 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,443 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:08,444 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:08,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,448 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:08,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,449 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:08,449 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:08,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,451 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,451 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,451 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,453 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:08,453 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:08,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,469 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,471 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:08,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:08,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,472 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,473 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:56:08,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,474 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:56:08,474 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:08,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:08,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:08,479 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:08,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:08,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:08,480 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:08,483 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:08,483 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:08,521 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:56:08,628 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-15 23:56:08,628 INFO L444 ModelExtractionUtils]: 20 out of 31 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-11-15 23:56:08,629 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:56:08,629 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:56:08,630 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:56:08,630 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_#in~array.base)_2, insertionSort_~i) = 1*v_rep(select #length insertionSort_#in~array.base)_2 - 8*insertionSort_~i Supporting invariants [] [2019-11-15 23:56:08,658 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 23:56:08,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:56:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:08,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:56:08,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:08,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:56:08,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:12,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:12,617 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2019-11-15 23:56:12,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 56 transitions. cyclomatic complexity: 9 Second operand 12 states. [2019-11-15 23:56:38,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 56 transitions. cyclomatic complexity: 9. Second operand 12 states. Result 227 states and 268 transitions. Complement of second has 95 states. [2019-11-15 23:56:38,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2019-11-15 23:56:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:56:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2019-11-15 23:56:38,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 45 transitions. Stem has 26 letters. Loop has 15 letters. [2019-11-15 23:56:38,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:38,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 45 transitions. Stem has 41 letters. Loop has 15 letters. [2019-11-15 23:56:38,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:38,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 45 transitions. Stem has 26 letters. Loop has 30 letters. [2019-11-15 23:56:38,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:38,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 268 transitions. [2019-11-15 23:56:38,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2019-11-15 23:56:38,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 222 states and 263 transitions. [2019-11-15 23:56:38,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-11-15 23:56:38,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2019-11-15 23:56:38,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 263 transitions. [2019-11-15 23:56:38,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:56:38,182 INFO L688 BuchiCegarLoop]: Abstraction has 222 states and 263 transitions. [2019-11-15 23:56:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 263 transitions. [2019-11-15 23:56:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 88. [2019-11-15 23:56:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-15 23:56:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-11-15 23:56:38,190 INFO L711 BuchiCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-11-15 23:56:38,190 INFO L591 BuchiCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-11-15 23:56:38,190 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 23:56:38,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 103 transitions. [2019-11-15 23:56:38,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-15 23:56:38,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:56:38,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:56:38,193 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:38,193 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:38,193 INFO L791 eck$LassoCheckResult]: Stem: 2239#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2230#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; 2224#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2225#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; 2227#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2228#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; 2229#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2231#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; 2250#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2249#L33-3 assume !(main_~i~0 < main_~n~0); 2218#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2226#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2257#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; 2256#L15-6 #t~short4 := ~j~0 > 0; 2217#L15-1 assume !#t~short4; 2219#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2269#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2237#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2238#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2264#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; 2265#L15-6 #t~short4 := ~j~0 > 0; 2285#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; 2295#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 2294#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2293#L15-6 #t~short4 := ~j~0 > 0; 2260#L15-1 assume !#t~short4; 2261#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2240#L15-7 [2019-11-15 23:56:38,193 INFO L793 eck$LassoCheckResult]: Loop: 2240#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2212#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2211#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2213#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; 2244#L15-6 #t~short4 := ~j~0 > 0; 2290#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; 2291#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2240#L15-7 [2019-11-15 23:56:38,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:38,194 INFO L82 PathProgramCache]: Analyzing trace with hash 17685426, now seen corresponding path program 10 times [2019-11-15 23:56:38,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:38,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402345628] [2019-11-15 23:56:38,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:38,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:38,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:38,216 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 5 times [2019-11-15 23:56:38,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:38,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83365854] [2019-11-15 23:56:38,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:38,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:38,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:38,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1495415351, now seen corresponding path program 11 times [2019-11-15 23:56:38,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:38,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19926397] [2019-11-15 23:56:38,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:38,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:38,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:38,287 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:38,408 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-11-15 23:56:38,738 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-15 23:56:38,917 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-11-15 23:56:39,352 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-11-15 23:56:39,599 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-11-15 23:56:40,002 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 113 [2019-11-15 23:56:40,107 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-15 23:56:40,110 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:56:40,110 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:56:40,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:56:40,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:56:40,110 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:56:40,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:56:40,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:56:40,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:56:40,111 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration13_Lasso [2019-11-15 23:56:40,111 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:56:40,111 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:56:40,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,382 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-15 23:56:40,607 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-11-15 23:56:40,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:40,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:41,049 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:56:41,049 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:56:41,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:41,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:41,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:41,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:41,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:41,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:41,050 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:41,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:41,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:41,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:41,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:41,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:41,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:41,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:41,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:41,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:41,053 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:41,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:41,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:41,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:41,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:41,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:41,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:41,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:41,054 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:41,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:41,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:41,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:41,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:41,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:41,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:41,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:41,056 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:41,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:41,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:41,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:41,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:41,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:41,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:41,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:41,060 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:41,061 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:41,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:41,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:41,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:41,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:41,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:41,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:41,075 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:41,076 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:41,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:41,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:41,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:41,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:41,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:41,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:41,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:41,078 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:41,078 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:41,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:41,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:41,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:41,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:41,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:41,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:41,081 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:41,081 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:41,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:41,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:41,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:41,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:41,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:41,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:41,086 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:41,086 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:41,193 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:56:41,242 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:56:41,242 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:56:41,243 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:56:41,243 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:56:41,244 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:56:41,244 INFO L512 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 [] [2019-11-15 23:56:41,273 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-11-15 23:56:41,275 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:56:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:41,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:56:41,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:41,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:56:41,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:41,445 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 [2019-11-15 23:56:41,445 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 103 transitions. cyclomatic complexity: 20 Second operand 6 states. [2019-11-15 23:56:41,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 103 transitions. cyclomatic complexity: 20. Second operand 6 states. Result 153 states and 183 transitions. Complement of second has 14 states. [2019-11-15 23:56:41,606 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 [2019-11-15 23:56:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:56:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-11-15 23:56:41,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2019-11-15 23:56:41,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:41,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2019-11-15 23:56:41,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:41,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2019-11-15 23:56:41,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:41,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 183 transitions. [2019-11-15 23:56:41,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:56:41,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 104 states and 121 transitions. [2019-11-15 23:56:41,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-15 23:56:41,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-15 23:56:41,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 121 transitions. [2019-11-15 23:56:41,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:56:41,611 INFO L688 BuchiCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-11-15 23:56:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 121 transitions. [2019-11-15 23:56:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2019-11-15 23:56:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:56:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2019-11-15 23:56:41,630 INFO L711 BuchiCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-11-15 23:56:41,630 INFO L591 BuchiCegarLoop]: Abstraction has 93 states and 110 transitions. [2019-11-15 23:56:41,631 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 23:56:41,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 110 transitions. [2019-11-15 23:56:41,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:56:41,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:56:41,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:56:41,632 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:41,634 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:56:41,634 INFO L791 eck$LassoCheckResult]: Stem: 2645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2640#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; 2635#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2636#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; 2637#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2638#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; 2639#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2641#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; 2657#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2656#L33-3 assume !(main_~i~0 < main_~n~0); 2625#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2624#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2626#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; 2655#L15-6 #t~short4 := ~j~0 > 0; 2679#L15-1 assume !#t~short4; 2677#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2678#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2699#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2716#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2715#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; 2711#L15-6 #t~short4 := ~j~0 > 0; 2698#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; 2700#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2709#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2631#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2707#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2705#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; 2703#L15-6 #t~short4 := ~j~0 > 0; 2643#L15-1 [2019-11-15 23:56:41,635 INFO L793 eck$LassoCheckResult]: Loop: 2643#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; 2651#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;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; 2652#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2642#L15-6 #t~short4 := ~j~0 > 0; 2643#L15-1 [2019-11-15 23:56:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash 496161610, now seen corresponding path program 3 times [2019-11-15 23:56:41,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:41,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865224778] [2019-11-15 23:56:41,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:41,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:41,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:41,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:41,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:41,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 3 times [2019-11-15 23:56:41,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:41,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436170076] [2019-11-15 23:56:41,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:41,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:41,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:41,676 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1509363707, now seen corresponding path program 12 times [2019-11-15 23:56:41,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:41,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745419563] [2019-11-15 23:56:41,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:41,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:41,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:56:41,727 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:56:41,840 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-15 23:56:42,111 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-15 23:56:42,365 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-11-15 23:56:42,857 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2019-11-15 23:56:43,108 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-11-15 23:56:43,524 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 114 [2019-11-15 23:56:43,616 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:56:43,616 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:56:43,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:56:43,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:56:43,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:56:43,617 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:56:43,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:56:43,617 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:56:43,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration14_Lasso [2019-11-15 23:56:43,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:56:43,617 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:56:43,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:43,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:43,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:43,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:43,844 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-15 23:56:44,033 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 23:56:44,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:56:44,480 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:56:44,480 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:56:44,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:44,481 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:44,481 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:44,481 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:44,481 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:44,481 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:44,482 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:44,482 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:44,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:44,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:44,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:44,483 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:44,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:44,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:44,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:44,483 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:44,483 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:44,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:44,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:44,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:44,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:44,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:44,484 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:44,485 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:44,485 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:44,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:44,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:44,488 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:44,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:44,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:44,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:44,489 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:44,489 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:44,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:44,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:44,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:44,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:56:44,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:44,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:44,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:44,496 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:56:44,496 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:56:44,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:44,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:44,497 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:44,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:44,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:44,498 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:44,498 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:56:44,498 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:44,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:44,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:44,502 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:44,502 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:56:44,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:56:44,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:44,503 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:56:44,503 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:56:44,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:56:44,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:56:44,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:56:44,507 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:56:44,507 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:56:44,507 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:56:44,512 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 23:56:44,512 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:56:44,595 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:56:44,710 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 23:56:44,710 INFO L444 ModelExtractionUtils]: 44 out of 56 variables were initially zero. Simplification set additionally 9 variables to zero. [2019-11-15 23:56:44,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:56:44,712 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 23:56:44,712 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:56:44,713 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~array.offset, insertionSort_~j~0) = 1*insertionSort_~array.offset + 4*insertionSort_~j~0 Supporting invariants [] [2019-11-15 23:56:44,760 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-11-15 23:56:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:44,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:56:44,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:44,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:56:44,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:44,905 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 [2019-11-15 23:56:44,905 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23 Second operand 5 states. [2019-11-15 23:56:44,914 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 98 states and 115 transitions. Complement of second has 8 states. [2019-11-15 23:56:44,917 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 [2019-11-15 23:56:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:56:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-15 23:56:44,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2019-11-15 23:56:44,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:44,917 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:56:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:44,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:56:44,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:44,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:56:44,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:45,015 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 [2019-11-15 23:56:45,015 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23 Second operand 5 states. [2019-11-15 23:56:45,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 98 states and 115 transitions. Complement of second has 8 states. [2019-11-15 23:56:45,031 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 [2019-11-15 23:56:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:56:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-15 23:56:45,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2019-11-15 23:56:45,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:45,032 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:56:45,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:45,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:56:45,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:45,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:56:45,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:45,135 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 [2019-11-15 23:56:45,135 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23 Second operand 5 states. [2019-11-15 23:56:45,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 110 transitions. cyclomatic complexity: 23. Second operand 5 states. Result 162 states and 199 transitions. Complement of second has 9 states. [2019-11-15 23:56:45,166 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 [2019-11-15 23:56:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:56:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-11-15 23:56:45,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 4 letters. [2019-11-15 23:56:45,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:45,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 4 letters. [2019-11-15 23:56:45,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:45,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 8 letters. [2019-11-15 23:56:45,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:56:45,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 199 transitions. [2019-11-15 23:56:45,170 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:56:45,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 0 states and 0 transitions. [2019-11-15 23:56:45,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:56:45,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:56:45,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:56:45,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:56:45,170 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:56:45,170 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:56:45,170 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:56:45,170 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 23:56:45,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:56:45,170 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:56:45,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:56:45,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:56:45 BoogieIcfgContainer [2019-11-15 23:56:45,177 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:56:45,178 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:56:45,178 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:56:45,179 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:56:45,179 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:54" (3/4) ... [2019-11-15 23:56:45,182 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:56:45,182 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:56:45,183 INFO L168 Benchmark]: Toolchain (without parser) took 51493.04 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 493.4 MB). Free memory was 944.7 MB in the beginning and 1.4 GB in the end (delta: -482.1 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:45,187 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:56:45,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -225.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:45,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:56:45,190 INFO L168 Benchmark]: Boogie Preprocessor took 29.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:45,191 INFO L168 Benchmark]: RCFGBuilder took 267.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:45,191 INFO L168 Benchmark]: BuchiAutomizer took 50858.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -280.6 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:45,194 INFO L168 Benchmark]: Witness Printer took 3.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:56:45,198 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -225.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 267.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50858.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -280.6 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 14 terminating modules (9 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 size + -1 * j and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -8 * i and consists of 17 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. 9 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.7s and 15 iterations. TraceHistogramMax:3. Analysis of lassos took 18.4s. Construction of modules took 0.9s. Büchi inclusion checks took 31.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 183 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 93 states and ocurred in iteration 13. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/10 HoareTripleCheckerStatistics: 223 SDtfs, 340 SDslu, 662 SDs, 0 SdLazy, 920 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc6 concLT0 SILN0 SILU2 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital279 mio100 ax100 hnf99 lsp94 ukn76 mio100 lsp56 div100 bol101 ite100 ukn100 eq168 hnf87 smp95 dnf124 smp92 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 206ms VariablesStem: 10 VariablesLoop: 8 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...