./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c911d3bfcad41488f605dca082dbd47805d189ae ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:33:19,111 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:33:19,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:33:19,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:33:19,119 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:33:19,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:33:19,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:33:19,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:33:19,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:33:19,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:33:19,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:33:19,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:33:19,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:33:19,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:33:19,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:33:19,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:33:19,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:33:19,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:33:19,126 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:33:19,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:33:19,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:33:19,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:33:19,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:33:19,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:33:19,129 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:33:19,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:33:19,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:33:19,131 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:33:19,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:33:19,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:33:19,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:33:19,132 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:33:19,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:33:19,132 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:33:19,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:33:19,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:33:19,133 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 17:33:19,141 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:33:19,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:33:19,142 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:33:19,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:33:19,142 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 17:33:19,142 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 17:33:19,142 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 17:33:19,142 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 17:33:19,142 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 17:33:19,142 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 17:33:19,142 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 17:33:19,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:33:19,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:33:19,142 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 17:33:19,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:33:19,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:33:19,144 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 17:33:19,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:33:19,144 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 17:33:19,144 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 17:33:19,144 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 17:33:19,144 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_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c911d3bfcad41488f605dca082dbd47805d189ae [2018-12-08 17:33:19,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:33:19,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:33:19,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:33:19,170 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:33:19,171 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:33:19,171 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-08 17:33:19,205 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/data/1f344bda7/2e8dc4fe187a42b0b820f9611055a1a6/FLAGead0a6e9a [2018-12-08 17:33:19,630 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:33:19,630 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/sv-benchmarks/c/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-08 17:33:19,636 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/data/1f344bda7/2e8dc4fe187a42b0b820f9611055a1a6/FLAGead0a6e9a [2018-12-08 17:33:19,644 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/bin-2019/uautomizer/data/1f344bda7/2e8dc4fe187a42b0b820f9611055a1a6 [2018-12-08 17:33:19,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:33:19,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:33:19,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:33:19,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:33:19,649 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:33:19,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8167c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19, skipping insertion in model container [2018-12-08 17:33:19,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:33:19,673 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:33:19,811 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:33:19,818 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:33:19,875 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:33:19,894 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:33:19,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19 WrapperNode [2018-12-08 17:33:19,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:33:19,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:33:19,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:33:19,895 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:33:19,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:33:19,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:33:19,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:33:19,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:33:19,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... [2018-12-08 17:33:19,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:33:19,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:33:19,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:33:19,935 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:33:19,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0da7415e-4504-4c44-90c0-f75de215da97/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-12-08 17:33:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:33:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 17:33:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:33:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:33:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:33:19,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:33:20,068 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:33:20,069 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 17:33:20,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:33:20 BoogieIcfgContainer [2018-12-08 17:33:20,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:33:20,069 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 17:33:20,069 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 17:33:20,071 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 17:33:20,072 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 17:33:20,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 05:33:19" (1/3) ... [2018-12-08 17:33:20,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@411a08a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 05:33:20, skipping insertion in model container [2018-12-08 17:33:20,073 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 17:33:20,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:19" (2/3) ... [2018-12-08 17:33:20,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@411a08a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 05:33:20, skipping insertion in model container [2018-12-08 17:33:20,073 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 17:33:20,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:33:20" (3/3) ... [2018-12-08 17:33:20,074 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-12-08 17:33:20,104 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:33:20,105 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 17:33:20,105 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 17:33:20,105 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 17:33:20,105 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:33:20,105 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:33:20,105 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 17:33:20,105 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:33:20,105 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 17:33:20,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-08 17:33:20,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 17:33:20,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:33:20,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:33:20,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 17:33:20,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 17:33:20,129 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 17:33:20,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-08 17:33:20,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 17:33:20,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:33:20,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:33:20,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 17:33:20,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 17:33:20,135 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 7#L553true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 11#L553-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 12#L543-3true [2018-12-08 17:33:20,135 INFO L796 eck$LassoCheckResult]: Loop: 12#L543-3true assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 14#L546-6true assume !true; 16#L546-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 9#L543-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 12#L543-3true [2018-12-08 17:33:20,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-08 17:33:20,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:20,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:20,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:20,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:20,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2018-12-08 17:33:20,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:20,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:20,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:20,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:33:20,231 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 17:33:20,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 17:33:20,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:33:20,241 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-12-08 17:33:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:20,247 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-08 17:33:20,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 17:33:20,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-12-08 17:33:20,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 17:33:20,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2018-12-08 17:33:20,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 17:33:20,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 17:33:20,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-08 17:33:20,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 17:33:20,255 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 17:33:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-08 17:33:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-08 17:33:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 17:33:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-08 17:33:20,275 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 17:33:20,275 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 17:33:20,275 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 17:33:20,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-12-08 17:33:20,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 17:33:20,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:33:20,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:33:20,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 17:33:20,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 17:33:20,276 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 39#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40#L553-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 45#L543-3 [2018-12-08 17:33:20,276 INFO L796 eck$LassoCheckResult]: Loop: 45#L543-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 43#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L546-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 47#L546-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 48#L546-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 44#L543-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 45#L543-3 [2018-12-08 17:33:20,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-08 17:33:20,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:20,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:20,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:20,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:20,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2018-12-08 17:33:20,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:20,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:20,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:20,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:20,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2018-12-08 17:33:20,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:20,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:20,530 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 17:33:20,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 17:33:20,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 17:33:20,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 17:33:20,531 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 17:33:20,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 17:33:20,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 17:33:20,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 17:33:20,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-08 17:33:20,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 17:33:20,532 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 17:33:20,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:20,875 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 17:33:20,878 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 17:33:20,880 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-12-08 17:33:20,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:20,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:20,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:20,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,884 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-12-08 17:33:20,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:20,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:20,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:20,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,886 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-12-08 17:33:20,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:20,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:20,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:20,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,889 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-12-08 17:33:20,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:20,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:20,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:20,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,891 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-12-08 17:33:20,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:33:20,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:20,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,896 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-12-08 17:33:20,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:20,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:20,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:20,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,899 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-12-08 17:33:20,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:20,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:20,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:20,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,902 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-12-08 17:33:20,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:33:20,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:20,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,914 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-12-08 17:33:20,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:33:20,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:20,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,919 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-12-08 17:33:20,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,919 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 17:33:20,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,922 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 17:33:20,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:20,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,934 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-12-08 17:33:20,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:20,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:20,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:20,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:20,937 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-12-08 17:33:20,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:20,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:20,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:20,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:20,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:33:20,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:20,995 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 17:33:21,030 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 17:33:21,031 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-08 17:33:21,032 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 17:33:21,033 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 17:33:21,033 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 17:33:21,034 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2018-12-08 17:33:21,045 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 17:33:21,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:21,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:21,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:21,114 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-12-08 17:33:21,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-08 17:33:21,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2018-12-08 17:33:21,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 17:33:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 17:33:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-08 17:33:21,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-08 17:33:21,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:21,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-08 17:33:21,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:21,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2018-12-08 17:33:21,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:21,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2018-12-08 17:33:21,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 17:33:21,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2018-12-08 17:33:21,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 17:33:21,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 17:33:21,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-12-08 17:33:21,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 17:33:21,149 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-08 17:33:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-12-08 17:33:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-08 17:33:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-08 17:33:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-12-08 17:33:21,150 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-08 17:33:21,150 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-08 17:33:21,150 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 17:33:21,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-12-08 17:33:21,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 17:33:21,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:33:21,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:33:21,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 17:33:21,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 17:33:21,152 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 135#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 136#L553-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 144#L543-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 139#L546-6 [2018-12-08 17:33:21,152 INFO L796 eck$LassoCheckResult]: Loop: 139#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 145#L546-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 147#L546-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 138#L546-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 139#L546-6 [2018-12-08 17:33:21,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-08 17:33:21,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:21,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:21,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:21,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2018-12-08 17:33:21,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:21,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:21,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:21,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:21,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:21,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2018-12-08 17:33:21,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:21,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:21,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:21,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:21,352 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 17:33:21,352 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 17:33:21,352 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 17:33:21,352 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 17:33:21,352 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 17:33:21,352 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 17:33:21,352 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 17:33:21,352 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 17:33:21,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-08 17:33:21,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 17:33:21,353 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 17:33:21,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:21,629 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 17:33:21,629 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 17:33:21,630 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-12-08 17:33:21,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:21,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:21,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:21,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:21,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:21,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:21,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:21,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:21,631 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-12-08 17:33:21,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:21,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:21,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:21,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:21,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:21,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:21,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:21,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:21,633 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-12-08 17:33:21,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:21,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:21,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:21,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:21,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:21,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:21,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:21,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:21,635 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-12-08 17:33:21,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:21,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:21,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:21,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:21,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:21,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:21,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:21,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:21,637 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-12-08 17:33:21,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:21,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:21,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:21,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:21,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:33:21,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:21,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:21,643 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-12-08 17:33:21,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:21,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:21,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:21,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:21,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:33:21,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:21,734 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 17:33:21,744 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 17:33:21,744 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-08 17:33:21,744 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 17:33:21,745 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 17:33:21,745 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 17:33:21,745 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-12-08 17:33:21,754 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 17:33:21,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:21,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:21,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:21,809 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-12-08 17:33:21,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-08 17:33:21,841 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 9 states. [2018-12-08 17:33:21,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 17:33:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 17:33:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-08 17:33:21,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-08 17:33:21,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:21,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-08 17:33:21,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:21,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-08 17:33:21,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:21,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2018-12-08 17:33:21,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 17:33:21,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2018-12-08 17:33:21,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 17:33:21,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 17:33:21,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-08 17:33:21,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 17:33:21,847 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-08 17:33:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-08 17:33:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2018-12-08 17:33:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 17:33:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-12-08 17:33:21,850 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-08 17:33:21,850 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-08 17:33:21,850 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 17:33:21,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-12-08 17:33:21,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 17:33:21,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:33:21,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:33:21,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:21,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 17:33:21,851 INFO L794 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 268#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 269#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 270#L553-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 278#L543-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 275#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 283#L546-1 assume !insertionSort_#t~short6; 284#L546-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 285#L546-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 276#L543-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 277#L543-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 273#L546-6 [2018-12-08 17:33:21,851 INFO L796 eck$LassoCheckResult]: Loop: 273#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 279#L546-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 282#L546-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 272#L546-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 273#L546-6 [2018-12-08 17:33:21,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2018-12-08 17:33:21,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:21,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:21,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:33:21,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:33:21,893 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 17:33:21,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:21,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2018-12-08 17:33:21,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:21,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:21,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:33:21,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:33:21,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:33:21,953 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-08 17:33:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:33:21,985 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2018-12-08 17:33:21,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:33:21,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-12-08 17:33:21,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 17:33:21,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2018-12-08 17:33:21,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 17:33:21,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 17:33:21,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2018-12-08 17:33:21,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 17:33:21,987 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-08 17:33:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2018-12-08 17:33:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-12-08 17:33:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 17:33:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-12-08 17:33:21,989 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-08 17:33:21,989 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-08 17:33:21,989 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 17:33:21,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2018-12-08 17:33:21,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 17:33:21,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 17:33:21,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 17:33:21,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:33:21,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 17:33:21,990 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 335#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 336#L553 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 337#L553-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 345#L543-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 347#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 349#L546-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 352#L546-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 353#L546-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 343#L543-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 344#L543-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 340#L546-6 [2018-12-08 17:33:21,990 INFO L796 eck$LassoCheckResult]: Loop: 340#L546-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 346#L546-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 351#L546-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 339#L546-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 340#L546-6 [2018-12-08 17:33:21,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:21,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2018-12-08 17:33:21,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:21,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:21,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:22,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:22,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 3 times [2018-12-08 17:33:22,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:22,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:22,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:22,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:22,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:22,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2018-12-08 17:33:22,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:33:22,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:33:22,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:22,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:33:22,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:33:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:33:22,215 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2018-12-08 17:33:22,254 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 17:33:22,254 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 17:33:22,254 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 17:33:22,254 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 17:33:22,254 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 17:33:22,254 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 17:33:22,254 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 17:33:22,254 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 17:33:22,254 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-08 17:33:22,254 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 17:33:22,255 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 17:33:22,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 17:33:22,558 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 17:33:22,558 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 17:33:22,559 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-12-08 17:33:22,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:22,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:22,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:22,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:22,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:22,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:22,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:22,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:22,561 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-12-08 17:33:22,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:22,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:22,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:22,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:22,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:22,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:22,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:22,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:22,563 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-12-08 17:33:22,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:22,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:22,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:22,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:22,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:22,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:22,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:22,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:22,564 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-12-08 17:33:22,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:22,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:22,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:22,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:22,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:33:22,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:22,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:22,567 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-12-08 17:33:22,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:22,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 17:33:22,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:22,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:22,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:22,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 17:33:22,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 17:33:22,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:22,568 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-12-08 17:33:22,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:22,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:22,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:22,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:22,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:33:22,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:22,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 17:33:22,572 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-12-08 17:33:22,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 17:33:22,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 17:33:22,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 17:33:22,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 17:33:22,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 17:33:22,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 17:33:22,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 17:33:22,595 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 17:33:22,595 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 17:33:22,595 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 17:33:22,595 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 17:33:22,596 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 17:33:22,596 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2018-12-08 17:33:22,608 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-08 17:33:22,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:22,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:22,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:22,646 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-12-08 17:33:22,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-08 17:33:22,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2018-12-08 17:33:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 17:33:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 17:33:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-08 17:33:22,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-08 17:33:22,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:22,676 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 17:33:22,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:22,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:22,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:22,717 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-12-08 17:33:22,717 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-08 17:33:22,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2018-12-08 17:33:22,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 17:33:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 17:33:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-08 17:33:22,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-08 17:33:22,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:22,739 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 17:33:22,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:33:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:22,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:33:22,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:33:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:33:22,776 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-12-08 17:33:22,776 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-08 17:33:22,799 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 8 states. [2018-12-08 17:33:22,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 17:33:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 17:33:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-08 17:33:22,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-08 17:33:22,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:22,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-08 17:33:22,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:22,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-08 17:33:22,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 17:33:22,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2018-12-08 17:33:22,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 17:33:22,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2018-12-08 17:33:22,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 17:33:22,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 17:33:22,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 17:33:22,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 17:33:22,802 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:33:22,802 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:33:22,803 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:33:22,803 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 17:33:22,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 17:33:22,803 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 17:33:22,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 17:33:22,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 05:33:22 BoogieIcfgContainer [2018-12-08 17:33:22,807 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 17:33:22,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:33:22,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:33:22,808 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:33:22,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:33:20" (3/4) ... [2018-12-08 17:33:22,810 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 17:33:22,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:33:22,811 INFO L168 Benchmark]: Toolchain (without parser) took 3164.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 950.6 MB in the beginning and 806.6 MB in the end (delta: 144.0 MB). Peak memory consumption was 374.2 MB. Max. memory is 11.5 GB. [2018-12-08 17:33:22,811 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:33:22,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:33:22,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:33:22,812 INFO L168 Benchmark]: Boogie Preprocessor took 14.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:33:22,812 INFO L168 Benchmark]: RCFGBuilder took 133.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:33:22,812 INFO L168 Benchmark]: BuchiAutomizer took 2737.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 806.6 MB in the end (delta: 303.6 MB). Peak memory consumption was 389.1 MB. Max. memory is 11.5 GB. [2018-12-08 17:33:22,813 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 1.3 GB. Free memory is still 806.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:33:22,815 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 133.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2737.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 806.6 MB in the end (delta: 303.6 MB). Peak memory consumption was 389.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.89 ms. Allocated memory is still 1.3 GB. Free memory is still 806.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 116 SDslu, 43 SDs, 0 SdLazy, 130 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf99 lsp96 ukn75 mio100 lsp66 div100 bol100 ite100 ukn100 eq176 hnf84 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...