./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 647da5540d24322bf98da85423c1800dc68ed16f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:29:27,802 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:29:27,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:29:27,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:29:27,810 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:29:27,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:29:27,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:29:27,813 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:29:27,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:29:27,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:29:27,815 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:29:27,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:29:27,816 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:29:27,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:29:27,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:29:27,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:29:27,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:29:27,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:29:27,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:29:27,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:29:27,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:29:27,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:29:27,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:29:27,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:29:27,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:29:27,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:29:27,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:29:27,828 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:29:27,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:29:27,830 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:29:27,830 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:29:27,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:29:27,831 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:29:27,831 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:29:27,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:29:27,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:29:27,832 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 11:29:27,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:29:27,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:29:27,841 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:29:27,841 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:29:27,841 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:29:27,842 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:29:27,842 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:29:27,842 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:29:27,842 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:29:27,842 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:29:27,842 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:29:27,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:29:27,842 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:29:27,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:29:27,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:29:27,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:29:27,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:29:27,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:29:27,843 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:29:27,843 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:29:27,845 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:29:27,845 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:29:27,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:29:27,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:29:27,846 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:29:27,846 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:29:27,846 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:29:27,846 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:29:27,847 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:29:27,847 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647da5540d24322bf98da85423c1800dc68ed16f [2018-11-18 11:29:27,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:29:27,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:29:27,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:29:27,886 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:29:27,886 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:29:27,887 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-18 11:29:27,934 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/data/a163254d0/f1f8227359184efdb5d41352ea77817b/FLAG5b2e9ad88 [2018-11-18 11:29:28,300 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:29:28,300 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-18 11:29:28,305 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/data/a163254d0/f1f8227359184efdb5d41352ea77817b/FLAG5b2e9ad88 [2018-11-18 11:29:28,713 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/data/a163254d0/f1f8227359184efdb5d41352ea77817b [2018-11-18 11:29:28,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:29:28,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:29:28,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:29:28,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:29:28,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:29:28,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f87d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28, skipping insertion in model container [2018-11-18 11:29:28,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:29:28,745 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:29:28,852 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:29:28,859 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:29:28,870 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:29:28,881 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:29:28,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28 WrapperNode [2018-11-18 11:29:28,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:29:28,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:29:28,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:29:28,882 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:29:28,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:29:28,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:29:28,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:29:28,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:29:28,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... [2018-11-18 11:29:28,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:29:28,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:29:28,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:29:28,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:29:28,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:29:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:29:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:29:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2018-11-18 11:29:29,003 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-11-18 11:29:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:29:29,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:29:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:29:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:29:29,177 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:29:29,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:29:29 BoogieIcfgContainer [2018-11-18 11:29:29,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:29:29,178 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:29:29,178 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:29:29,180 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:29:29,180 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:29:29,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:29:28" (1/3) ... [2018-11-18 11:29:29,181 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa0f25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:29:29, skipping insertion in model container [2018-11-18 11:29:29,181 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:29:29,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:29:28" (2/3) ... [2018-11-18 11:29:29,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa0f25f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:29:29, skipping insertion in model container [2018-11-18 11:29:29,182 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:29:29,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:29:29" (3/3) ... [2018-11-18 11:29:29,183 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive_true-termination.c.i [2018-11-18 11:29:29,233 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:29:29,234 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:29:29,234 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:29:29,234 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:29:29,234 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:29:29,235 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:29:29,235 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:29:29,235 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:29:29,235 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:29:29,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-18 11:29:29,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 11:29:29,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:29,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:29,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 11:29:29,280 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:29:29,280 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:29:29,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-18 11:29:29,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 11:29:29,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:29,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:29,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 11:29:29,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:29:29,288 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 6#L28true assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L33-4true [2018-11-18 11:29:29,288 INFO L796 eck$LassoCheckResult]: Loop: 8#L33-4true assume true; 13#L33-1true 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; 9#L33-3true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L33-4true [2018-11-18 11:29:29,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2018-11-18 11:29:29,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:29,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:29,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:29,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:29,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:29,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash 71659, now seen corresponding path program 1 times [2018-11-18 11:29:29,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:29,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:29,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:29,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:29,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:29,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1806657481, now seen corresponding path program 1 times [2018-11-18 11:29:29,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:29,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:29,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:29,639 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:29:29,640 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:29:29,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:29:29,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:29:29,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:29:29,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:29:29,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:29:29,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:29:29,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-18 11:29:29,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:29:29,642 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:29:29,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:29,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:29,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:29,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:29,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:29,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:30,236 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:29:30,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:29:30,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:30,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:30,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:30,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:30,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:30,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:30,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:30,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:30,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:30,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:30,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:30,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:30,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:30,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:30,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:30,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:30,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:30,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:30,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:30,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:30,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:30,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:30,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:30,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:30,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:30,314 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:29:30,361 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 11:29:30,362 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 11:29:30,364 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:29:30,367 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:29:30,367 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:29:30,368 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_main_~a~0.offset) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2018-11-18 11:29:30,391 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 11:29:30,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:29:30,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:30,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:30,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:29:30,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 11:29:30,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-11-18 11:29:30,649 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 45 states and 57 transitions. Complement of second has 9 states. [2018-11-18 11:29:30,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:29:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:29:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-18 11:29:30,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-18 11:29:30,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:30,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 11:29:30,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:30,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-18 11:29:30,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:30,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2018-11-18 11:29:30,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 11:29:30,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 17 states and 22 transitions. [2018-11-18 11:29:30,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 11:29:30,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 11:29:30,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-18 11:29:30,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:29:30,664 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 11:29:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-18 11:29:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 11:29:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 11:29:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-18 11:29:30,682 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 11:29:30,682 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 11:29:30,682 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:29:30,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-18 11:29:30,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 11:29:30,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:30,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:30,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:29:30,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:29:30,684 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 137#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 138#L33-4 assume true; 140#L33-1 assume !(main_~i~0 < main_~n~0); 132#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 131#insertionSortENTRY [2018-11-18 11:29:30,684 INFO L796 eck$LassoCheckResult]: Loop: 131#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 134#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; 144#L15-6 assume !true; 145#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 133#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 131#insertionSortENTRY [2018-11-18 11:29:30,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:30,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1806657430, now seen corresponding path program 1 times [2018-11-18 11:29:30,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:30,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:30,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:30,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:29:30,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:29:30,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:29:30,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:29:30,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash 28740468, now seen corresponding path program 1 times [2018-11-18 11:29:30,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:30,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:30,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:30,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:30,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:29:30,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:29:30,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:29:30,733 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:29:30,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:29:30,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:29:30,736 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 2 states. [2018-11-18 11:29:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:29:30,741 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-18 11:29:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:29:30,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-18 11:29:30,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 11:29:30,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 11:29:30,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 11:29:30,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 11:29:30,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-11-18 11:29:30,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:29:30,743 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 11:29:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-11-18 11:29:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 11:29:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 11:29:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 11:29:30,745 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 11:29:30,745 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 11:29:30,745 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:29:30,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-18 11:29:30,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 11:29:30,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:30,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:30,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:29:30,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:30,747 INFO L794 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 177#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 178#L33-4 assume true; 180#L33-1 assume !(main_~i~0 < main_~n~0); 172#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 171#insertionSortENTRY [2018-11-18 11:29:30,747 INFO L796 eck$LassoCheckResult]: Loop: 171#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 174#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; 184#L15-6 assume true;#t~short4 := ~j~0 > 0; 175#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; 176#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 186#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 173#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 171#insertionSortENTRY [2018-11-18 11:29:30,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:30,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1806657430, now seen corresponding path program 2 times [2018-11-18 11:29:30,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:30,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:30,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:30,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:30,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:29:30,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:29:30,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:29:30,783 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:29:30,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:30,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 1 times [2018-11-18 11:29:30,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:30,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:30,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:30,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:29:30,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:31,030 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-18 11:29:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:29:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:29:31,167 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 11:29:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:29:31,191 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-18 11:29:31,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:29:31,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-18 11:29:31,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 11:29:31,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 22 transitions. [2018-11-18 11:29:31,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 11:29:31,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 11:29:31,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-18 11:29:31,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:29:31,195 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 11:29:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-18 11:29:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-18 11:29:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 11:29:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-18 11:29:31,197 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 11:29:31,198 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 11:29:31,198 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:29:31,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-18 11:29:31,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 11:29:31,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:31,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:31,199 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:31,199 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:31,199 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 226#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 220#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 221#L33-4 assume true; 222#L33-1 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; 225#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 223#L33-4 assume true; 224#L33-1 assume !(main_~i~0 < main_~n~0); 216#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 214#insertionSortENTRY [2018-11-18 11:29:31,199 INFO L796 eck$LassoCheckResult]: Loop: 214#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 217#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; 227#L15-6 assume true;#t~short4 := ~j~0 > 0; 218#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; 219#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 229#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 215#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 214#insertionSortENTRY [2018-11-18 11:29:31,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1897872112, now seen corresponding path program 1 times [2018-11-18 11:29:31,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:31,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:31,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:31,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476523, now seen corresponding path program 2 times [2018-11-18 11:29:31,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:31,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:31,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:31,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1254854748, now seen corresponding path program 1 times [2018-11-18 11:29:31,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:31,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:29:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:29:31,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:29:31,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:29:31,451 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-18 11:29:31,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:29:31,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:29:31,562 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-18 11:29:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:29:31,669 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-18 11:29:31,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:29:31,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-11-18 11:29:31,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 11:29:31,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 28 transitions. [2018-11-18 11:29:31,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 11:29:31,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 11:29:31,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2018-11-18 11:29:31,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:29:31,671 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-18 11:29:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2018-11-18 11:29:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-18 11:29:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 11:29:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-18 11:29:31,673 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 11:29:31,673 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 11:29:31,673 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:29:31,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-18 11:29:31,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 11:29:31,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:31,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:31,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:31,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:31,675 INFO L794 eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 281#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 282#L33-4 assume true; 283#L33-1 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; 286#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 284#L33-4 assume true; 285#L33-1 assume !(main_~i~0 < main_~n~0); 277#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 276#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 278#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; 288#L15-6 assume true;#t~short4 := ~j~0 > 0; 279#L15-1 assume !#t~short4; 280#L15-3 [2018-11-18 11:29:31,676 INFO L796 eck$LassoCheckResult]: Loop: 280#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 292#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 289#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 290#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 297#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; 294#L15-6 assume true;#t~short4 := ~j~0 > 0; 296#L15-1 assume !#t~short4; 280#L15-3 [2018-11-18 11:29:31,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash 136859416, now seen corresponding path program 1 times [2018-11-18 11:29:31,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:31,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:31,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:31,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:31,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash -496332999, now seen corresponding path program 1 times [2018-11-18 11:29:31,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:31,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:31,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:31,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:31,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:31,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1353291710, now seen corresponding path program 1 times [2018-11-18 11:29:31,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:31,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:29:31,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:29:31,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:29:31,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:31,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:29:31,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:29:31,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-11-18 11:29:32,270 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-11-18 11:29:32,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:29:32,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:29:32,311 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-18 11:29:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:29:32,427 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-18 11:29:32,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:29:32,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-18 11:29:32,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-18 11:29:32,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-11-18 11:29:32,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 11:29:32,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 11:29:32,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-18 11:29:32,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:29:32,429 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-18 11:29:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-18 11:29:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-11-18 11:29:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 11:29:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-18 11:29:32,431 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-18 11:29:32,431 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-18 11:29:32,431 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:29:32,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-18 11:29:32,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-18 11:29:32,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:32,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:32,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:32,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:32,432 INFO L794 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 426#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 420#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 421#L33-4 assume true; 422#L33-1 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; 425#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 423#L33-4 assume true; 424#L33-1 assume !(main_~i~0 < main_~n~0); 416#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 415#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 417#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; 427#L15-6 assume true;#t~short4 := ~j~0 > 0; 418#L15-1 assume !#t~short4; 419#L15-3 [2018-11-18 11:29:32,433 INFO L796 eck$LassoCheckResult]: Loop: 419#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 431#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 428#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 429#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 432#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; 433#L15-6 assume true;#t~short4 := ~j~0 > 0; 437#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; 436#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; 434#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 435#L15-6 assume true;#t~short4 := ~j~0 > 0; 438#L15-1 assume !#t~short4; 419#L15-3 [2018-11-18 11:29:32,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash 136859416, now seen corresponding path program 2 times [2018-11-18 11:29:32,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:32,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:32,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:32,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:32,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:32,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2140837470, now seen corresponding path program 1 times [2018-11-18 11:29:32,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:32,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:32,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:29:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:32,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:32,460 INFO L82 PathProgramCache]: Analyzing trace with hash -781139225, now seen corresponding path program 1 times [2018-11-18 11:29:32,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:32,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:32,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:32,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:29:32,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:29:32,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0d5f673f-8f5a-4dc2-b706-f26b8bd53187/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:29:32,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:32,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:29:32,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:29:32,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-18 11:29:33,027 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-11-18 11:29:33,235 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-18 11:29:33,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 11:29:33,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:29:33,281 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 17 states. [2018-11-18 11:29:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:29:33,421 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-18 11:29:33,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:29:33,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 43 transitions. [2018-11-18 11:29:33,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-18 11:29:33,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2018-11-18 11:29:33,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 11:29:33,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 11:29:33,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2018-11-18 11:29:33,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:29:33,424 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-18 11:29:33,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2018-11-18 11:29:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-18 11:29:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 11:29:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-18 11:29:33,425 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 11:29:33,426 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 11:29:33,426 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:29:33,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-11-18 11:29:33,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-18 11:29:33,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:33,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:33,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:33,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:33,427 INFO L794 eck$LassoCheckResult]: Stem: 598#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 595#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 588#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 589#L33-4 assume true; 591#L33-1 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; 594#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 592#L33-4 assume true; 593#L33-1 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-3 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 605#L33-4 assume true; 599#L33-1 assume !(main_~i~0 < main_~n~0); 586#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 590#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 608#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; 607#L15-6 assume true;#t~short4 := ~j~0 > 0; 585#L15-1 assume !#t~short4; 587#L15-3 [2018-11-18 11:29:33,427 INFO L796 eck$LassoCheckResult]: Loop: 587#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 601#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 583#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 582#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 584#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; 596#L15-6 assume true;#t~short4 := ~j~0 > 0; 597#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; 604#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; 602#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 603#L15-6 assume true;#t~short4 := ~j~0 > 0; 606#L15-1 assume !#t~short4; 587#L15-3 [2018-11-18 11:29:33,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash -184622466, now seen corresponding path program 3 times [2018-11-18 11:29:33,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:33,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:33,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:33,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:33,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2140837470, now seen corresponding path program 2 times [2018-11-18 11:29:33,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:33,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:33,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:29:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:33,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1248316479, now seen corresponding path program 2 times [2018-11-18 11:29:33,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:33,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:33,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:33,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:29:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:33,929 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-11-18 11:29:34,566 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:29:34,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:29:34,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:29:34,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:29:34,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:29:34,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:29:34,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:29:34,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:29:34,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration7_Lasso [2018-11-18 11:29:34,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:29:34,566 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:29:34,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,836 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-18 11:29:34,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:34,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:35,206 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:29:35,206 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:29:35,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:35,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:35,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:35,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:35,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:35,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:35,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:35,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:35,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:35,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:35,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:35,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:35,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:35,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:35,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:35,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:35,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:35,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:35,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:35,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:35,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:35,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:35,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:35,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:35,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:35,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:35,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:35,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:35,224 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:29:35,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:35,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:35,226 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:29:35,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:35,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:35,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:35,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:35,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:35,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:35,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:35,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:35,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:35,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:35,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:35,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:35,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:35,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:35,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:35,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:35,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:35,281 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:29:35,322 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 11:29:35,323 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 11:29:35,323 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:29:35,324 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:29:35,324 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:29:35,324 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~i) = -2*insertionSort_~i + 1 Supporting invariants [] [2018-11-18 11:29:35,367 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-18 11:29:35,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:35,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:35,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:29:35,513 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-18 11:29:35,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-18 11:29:35,846 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 156 states and 188 transitions. Complement of second has 70 states. [2018-11-18 11:29:35,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-18 11:29:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 11:29:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2018-11-18 11:29:35,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 16 letters. Loop has 11 letters. [2018-11-18 11:29:35,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:35,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 27 letters. Loop has 11 letters. [2018-11-18 11:29:35,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:35,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 16 letters. Loop has 22 letters. [2018-11-18 11:29:35,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:35,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 188 transitions. [2018-11-18 11:29:35,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-18 11:29:35,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 188 transitions. [2018-11-18 11:29:35,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-18 11:29:35,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-11-18 11:29:35,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 188 transitions. [2018-11-18 11:29:35,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:29:35,856 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 188 transitions. [2018-11-18 11:29:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 188 transitions. [2018-11-18 11:29:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 48. [2018-11-18 11:29:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 11:29:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-18 11:29:35,862 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-18 11:29:35,862 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-18 11:29:35,862 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:29:35,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 58 transitions. [2018-11-18 11:29:35,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-18 11:29:35,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:35,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:35,864 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:35,864 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:35,864 INFO L794 eck$LassoCheckResult]: Stem: 997#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 985#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 986#L33-4 assume true; 988#L33-1 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; 999#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 989#L33-4 assume true; 990#L33-1 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; 991#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 992#L33-4 assume true; 998#L33-1 assume !(main_~i~0 < main_~n~0); 981#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 987#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1004#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; 994#L15-6 assume true;#t~short4 := ~j~0 > 0; 980#L15-1 assume !#t~short4; 982#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1000#L15-7 [2018-11-18 11:29:35,864 INFO L796 eck$LassoCheckResult]: Loop: 1000#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 975#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 974#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 976#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; 1019#L15-6 assume true;#t~short4 := ~j~0 > 0; 1018#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; 1017#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1000#L15-7 [2018-11-18 11:29:35,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:35,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1428329134, now seen corresponding path program 1 times [2018-11-18 11:29:35,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:35,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:35,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:35,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:29:35,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:35,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1066317913, now seen corresponding path program 3 times [2018-11-18 11:29:35,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:35,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:35,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:35,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1364094262, now seen corresponding path program 1 times [2018-11-18 11:29:35,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:35,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:35,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:35,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:29:35,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:36,489 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:29:36,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:29:36,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:29:36,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:29:36,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:29:36,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:29:36,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:29:36,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:29:36,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-11-18 11:29:36,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:29:36,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:29:36,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,742 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-18 11:29:36,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:36,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:37,107 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:29:37,108 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:29:37,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:37,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:37,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:37,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:37,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:37,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:37,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:37,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:37,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:37,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:37,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:37,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:37,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:37,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:37,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:37,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:37,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:37,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:37,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:37,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:37,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:37,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:37,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:37,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:37,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:37,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:37,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:37,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:37,119 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:29:37,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:37,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:37,121 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:29:37,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:37,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:37,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:37,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:37,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:37,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:37,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:37,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:37,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:37,155 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:29:37,202 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 11:29:37,202 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-18 11:29:37,203 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:29:37,203 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:29:37,204 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:29:37,204 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_2, insertionSort_~array.offset, insertionSort_~i) = 1*v_rep(select #length insertionSort_~array.base)_2 - 1*insertionSort_~array.offset - 4*insertionSort_~i Supporting invariants [] [2018-11-18 11:29:37,234 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-11-18 11:29:37,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:29:37,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:37,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:37,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:29:37,350 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-18 11:29:37,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 58 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-18 11:29:37,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 58 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 84 states and 104 transitions. Complement of second has 14 states. [2018-11-18 11:29:37,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 11:29:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 11:29:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-18 11:29:37,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-18 11:29:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-18 11:29:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-18 11:29:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:37,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 104 transitions. [2018-11-18 11:29:37,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:29:37,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2018-11-18 11:29:37,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 11:29:37,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 11:29:37,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2018-11-18 11:29:37,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:29:37,470 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-18 11:29:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2018-11-18 11:29:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-11-18 11:29:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 11:29:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2018-11-18 11:29:37,476 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2018-11-18 11:29:37,476 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2018-11-18 11:29:37,476 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 11:29:37,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. [2018-11-18 11:29:37,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:29:37,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:29:37,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:29:37,480 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:29:37,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:29:37,480 INFO L794 eck$LassoCheckResult]: Stem: 1271#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1265#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1258#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1259#L33-4 assume true; 1260#L33-1 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; 1269#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1261#L33-4 assume true; 1262#L33-1 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; 1263#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1264#L33-4 assume true; 1268#L33-1 assume !(main_~i~0 < main_~n~0); 1249#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1248#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1250#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; 1276#L15-6 assume true;#t~short4 := ~j~0 > 0; 1282#L15-1 assume !#t~short4; 1279#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1272#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1252#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1251#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1253#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; 1267#L15-6 assume true;#t~short4 := ~j~0 > 0; 1254#L15-1 [2018-11-18 11:29:37,481 INFO L796 eck$LassoCheckResult]: Loop: 1254#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; 1255#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; 1274#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1266#L15-6 assume true;#t~short4 := ~j~0 > 0; 1254#L15-1 [2018-11-18 11:29:37,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:37,481 INFO L82 PathProgramCache]: Analyzing trace with hash 618178544, now seen corresponding path program 2 times [2018-11-18 11:29:37,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:37,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:37,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:37,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:37,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:37,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2018-11-18 11:29:37,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:37,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:37,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:37,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:29:37,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:37,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash 929563051, now seen corresponding path program 3 times [2018-11-18 11:29:37,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:29:37,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:29:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:37,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:29:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:29:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:29:38,130 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-11-18 11:29:38,532 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-11-18 11:29:38,573 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:29:38,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:29:38,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:29:38,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:29:38,574 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:29:38,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:29:38,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:29:38,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:29:38,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration9_Lasso [2018-11-18 11:29:38,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:29:38,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:29:38,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:38,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:29:39,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:29:39,027 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:29:39,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:39,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:39,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:39,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:39,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:39,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:39,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,086 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:29:39,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,087 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:29:39,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:39,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:39,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:39,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:29:39,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:29:39,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:29:39,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:29:39,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:29:39,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:29:39,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:29:39,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:29:39,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:29:39,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:29:39,099 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:29:39,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:29:39,104 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 11:29:39,104 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:29:39,149 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:29:39,199 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 11:29:39,199 INFO L444 ModelExtractionUtils]: 43 out of 56 variables were initially zero. Simplification set additionally 10 variables to zero. [2018-11-18 11:29:39,199 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:29:39,200 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-18 11:29:39,201 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:29:39,201 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~array.offset, insertionSort_~j~0) = 1*insertionSort_~array.offset + 4*insertionSort_~j~0 Supporting invariants [] [2018-11-18 11:29:39,234 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 11:29:39,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:39,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:39,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:29:39,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 11:29:39,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-18 11:29:39,313 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 62 states and 73 transitions. Complement of second has 8 states. [2018-11-18 11:29:39,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:29:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:29:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 11:29:39,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-18 11:29:39,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:39,315 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:29:39,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:39,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:39,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:29:39,374 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 11:29:39,374 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-18 11:29:39,384 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 62 states and 73 transitions. Complement of second has 8 states. [2018-11-18 11:29:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:29:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:29:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 11:29:39,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-18 11:29:39,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:39,388 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:29:39,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:29:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:39,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:29:39,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:29:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:29:39,448 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 11:29:39,448 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-18 11:29:39,465 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 87 states and 107 transitions. Complement of second has 9 states. [2018-11-18 11:29:39,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:29:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:29:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-18 11:29:39,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-18 11:29:39,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:39,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-18 11:29:39,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:39,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-18 11:29:39,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:29:39,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 107 transitions. [2018-11-18 11:29:39,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:29:39,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 0 states and 0 transitions. [2018-11-18 11:29:39,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:29:39,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:29:39,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:29:39,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:29:39,469 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:29:39,469 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:29:39,469 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:29:39,469 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 11:29:39,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:29:39,469 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:29:39,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:29:39,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:29:39 BoogieIcfgContainer [2018-11-18 11:29:39,474 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:29:39,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:29:39,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:29:39,474 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:29:39,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:29:29" (3/4) ... [2018-11-18 11:29:39,478 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:29:39,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:29:39,478 INFO L168 Benchmark]: Toolchain (without parser) took 10762.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.0 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -111.1 MB). Peak memory consumption was 169.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:29:39,479 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:29:39,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.72 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:29:39,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.40 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:29:39,480 INFO L168 Benchmark]: Boogie Preprocessor took 17.94 ms. Allocated memory is still 1.0 GB. Free memory is still 944.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:29:39,480 INFO L168 Benchmark]: RCFGBuilder took 256.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:29:39,480 INFO L168 Benchmark]: BuchiAutomizer took 10296.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.2 MB). Peak memory consumption was 192.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:29:39,481 INFO L168 Benchmark]: Witness Printer took 3.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:29:39,483 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.72 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.40 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.94 ms. Allocated memory is still 1.0 GB. Free memory is still 944.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 256.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10296.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.2 MB). Peak memory consumption was 192.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 9 terminating modules (5 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[malloc(n * sizeof (int))] + -1 * a and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 12 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -1 * array + -4 * i and consists of 6 locations. One nondeterministic module has affine ranking function array + 4 * j and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 8.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 131 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/3 HoareTripleCheckerStatistics: 160 SDtfs, 188 SDslu, 218 SDs, 0 SdLazy, 350 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU1 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax100 hnf99 lsp90 ukn94 mio100 lsp57 div100 bol102 ite100 ukn100 eq167 hnf88 smp93 dnf134 smp89 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 102ms 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...