./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 647da5540d24322bf98da85423c1800dc68ed16f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:31:52,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:31:52,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:31:52,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:31:52,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:31:53,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:31:53,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:31:53,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:31:53,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:31:53,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:31:53,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:31:53,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:31:53,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:31:53,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:31:53,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:31:53,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:31:53,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:31:53,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:31:53,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:31:53,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:31:53,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:31:53,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:31:53,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:31:53,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:31:53,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:31:53,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:31:53,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:31:53,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:31:53,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:31:53,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:31:53,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:31:53,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:31:53,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:31:53,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:31:53,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:31:53,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:31:53,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:31:53,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:31:53,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:31:53,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:31:53,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:31:53,052 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-30 01:31:53,108 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:31:53,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:31:53,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:31:53,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:31:53,109 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:31:53,110 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 01:31:53,110 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 01:31:53,110 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 01:31:53,110 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 01:31:53,110 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 01:31:53,111 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 01:31:53,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:31:53,111 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:31:53,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:31:53,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:31:53,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 01:31:53,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 01:31:53,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 01:31:53,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:31:53,112 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 01:31:53,112 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:31:53,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 01:31:53,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:31:53,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:31:53,113 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 01:31:53,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:31:53,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:31:53,114 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:31:53,114 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 01:31:53,115 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 01:31:53,115 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647da5540d24322bf98da85423c1800dc68ed16f [2020-11-30 01:31:53,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:31:53,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:31:53,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:31:53,480 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:31:53,481 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:31:53,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2020-11-30 01:31:53,547 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/data/08eed3f89/30d1a34f25dd4f6cb72df179f6b4d848/FLAGbfdf7822b [2020-11-30 01:31:54,005 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:31:54,005 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2020-11-30 01:31:54,011 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/data/08eed3f89/30d1a34f25dd4f6cb72df179f6b4d848/FLAGbfdf7822b [2020-11-30 01:31:54,433 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/data/08eed3f89/30d1a34f25dd4f6cb72df179f6b4d848 [2020-11-30 01:31:54,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:31:54,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:31:54,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:31:54,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:31:54,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:31:54,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5bd488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54, skipping insertion in model container [2020-11-30 01:31:54,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:31:54,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:31:54,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:31:54,731 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:31:54,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:31:54,778 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:31:54,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54 WrapperNode [2020-11-30 01:31:54,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:31:54,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:31:54,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:31:54,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:31:54,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:31:54,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:31:54,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:31:54,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:31:54,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... [2020-11-30 01:31:54,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:31:54,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:31:54,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:31:54,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:31:54,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:31:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:31:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2020-11-30 01:31:54,931 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2020-11-30 01:31:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:31:54,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:31:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 01:31:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:31:55,203 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:31:55,213 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 01:31:55,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:31:55 BoogieIcfgContainer [2020-11-30 01:31:55,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:31:55,220 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 01:31:55,220 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 01:31:55,233 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 01:31:55,233 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:31:55,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 01:31:54" (1/3) ... [2020-11-30 01:31:55,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@797536e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:31:55, skipping insertion in model container [2020-11-30 01:31:55,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:31:55,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:31:54" (2/3) ... [2020-11-30 01:31:55,236 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@797536e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 01:31:55, skipping insertion in model container [2020-11-30 01:31:55,236 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 01:31:55,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:31:55" (3/3) ... [2020-11-30 01:31:55,237 INFO L373 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2020-11-30 01:31:55,308 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 01:31:55,308 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 01:31:55,308 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 01:31:55,308 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:31:55,308 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:31:55,309 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 01:31:55,309 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:31:55,309 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 01:31:55,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-11-30 01:31:55,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-30 01:31:55,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:31:55,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:31:55,367 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 01:31:55,367 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 01:31:55,367 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 01:31:55,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-11-30 01:31:55,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-30 01:31:55,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:31:55,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:31:55,379 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 01:31:55,379 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 01:31:55,386 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 6#L28true assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L33-3true [2020-11-30 01:31:55,387 INFO L796 eck$LassoCheckResult]: Loop: 8#L33-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 10#L33-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L33-3true [2020-11-30 01:31:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:55,399 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2020-11-30 01:31:55,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:55,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817915557] [2020-11-30 01:31:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:55,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:55,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:55,566 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:31:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:55,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2020-11-30 01:31:55,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:55,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018599829] [2020-11-30 01:31:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:55,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:55,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:55,613 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:31:55,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2020-11-30 01:31:55,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:55,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460272795] [2020-11-30 01:31:55,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:55,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:55,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:55,677 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:31:55,941 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:31:55,941 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:31:55,942 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:31:55,942 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:31:55,942 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 01:31:55,942 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:55,942 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:31:55,942 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:31:55,943 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2020-11-30 01:31:55,943 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:31:55,943 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:31:55,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:31:55,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:31:55,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:31:55,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:31:56,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:31:56,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:31:56,464 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 01:31:56,470 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:31:56,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:31:56,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:31:56,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:31:56,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:31:56,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:31:56,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:31:56,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:31:56,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 01:31:56,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:31:56,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:31:56,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:31:56,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:31:56,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:31:56,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:31:56,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:31:56,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:31:56,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:31:56,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:31:56,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:31:56,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:31:56,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:31:56,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:31:56,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 01:31:56,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:31:56,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:31:56,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:31:56,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:31:56,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:31:56,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:31:56,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:31:56,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:31:56,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:31:56,677 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-11-30 01:31:56,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:31:56,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:31:56,683 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-11-30 01:31:56,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:31:56,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:31:56,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:31:56,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:31:56,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:31:56,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:31:56,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:31:56,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:31:56,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:31:56,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:31:56,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:31:56,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:31:56,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:31:56,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:31:56,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:31:56,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:31:56,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:31:56,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:31:56,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:31:56,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:31:56,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:31:56,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:31:56,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:31:56,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:31:56,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:31:56,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:31:56,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:31:56,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:31:56,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:31:56,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:31:56,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 01:31:56,975 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-11-30 01:31:56,975 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 01:31:56,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:31:56,990 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 01:31:56,990 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 01:31:56,991 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*ULTIMATE.start_main_~a~0.offset >= 0] [2020-11-30 01:31:57,036 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-11-30 01:31:57,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 01:31:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:57,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:31:57,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:57,131 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 01:31:57,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:57,175 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 [2020-11-30 01:31:57,176 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2020-11-30 01:31:57,328 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 9 states. [2020-11-30 01:31:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 01:31:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 01:31:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-11-30 01:31:57,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2020-11-30 01:31:57,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:31:57,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2020-11-30 01:31:57,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:31:57,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2020-11-30 01:31:57,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:31:57,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2020-11-30 01:31:57,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:31:57,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2020-11-30 01:31:57,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-30 01:31:57,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-30 01:31:57,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-11-30 01:31:57,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:31:57,360 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-30 01:31:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-11-30 01:31:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-30 01:31:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 01:31:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-11-30 01:31:57,387 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-30 01:31:57,388 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-30 01:31:57,388 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 01:31:57,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-11-30 01:31:57,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:31:57,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:31:57,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:31:57,391 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-30 01:31:57,391 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-30 01:31:57,392 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 139#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 135#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 136#L33-3 assume !(main_~i~0 < main_~n~0); 131#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 129#insertionSortENTRY [2020-11-30 01:31:57,396 INFO L796 eck$LassoCheckResult]: Loop: 129#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 132#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 140#L15-6 assume !true; 141#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 130#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 129#insertionSortENTRY [2020-11-30 01:31:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2020-11-30 01:31:57,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:57,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118569888] [2020-11-30 01:31:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:57,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118569888] [2020-11-30 01:31:57,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:57,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:57,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876371467] [2020-11-30 01:31:57,446 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:31:57,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:57,447 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2020-11-30 01:31:57,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:57,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329300822] [2020-11-30 01:31:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:57,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329300822] [2020-11-30 01:31:57,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:57,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 01:31:57,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650859873] [2020-11-30 01:31:57,458 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-30 01:31:57,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:57,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 01:31:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:31:57,462 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2020-11-30 01:31:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:57,466 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-11-30 01:31:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 01:31:57,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-11-30 01:31:57,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:31:57,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-11-30 01:31:57,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-30 01:31:57,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-30 01:31:57,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-11-30 01:31:57,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:31:57,469 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-30 01:31:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-11-30 01:31:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-30 01:31:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 01:31:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-11-30 01:31:57,471 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-30 01:31:57,472 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-30 01:31:57,472 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 01:31:57,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-11-30 01:31:57,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:31:57,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:31:57,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:31:57,473 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-30 01:31:57,473 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:57,474 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 175#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 171#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 172#L33-3 assume !(main_~i~0 < main_~n~0); 167#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 165#insertionSortENTRY [2020-11-30 01:31:57,474 INFO L796 eck$LassoCheckResult]: Loop: 165#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 168#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 176#L15-6 #t~short4 := ~j~0 > 0; 169#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 170#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 178#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 166#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 165#insertionSortENTRY [2020-11-30 01:31:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2020-11-30 01:31:57,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:57,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120419266] [2020-11-30 01:31:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:57,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120419266] [2020-11-30 01:31:57,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:57,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:31:57,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614970324] [2020-11-30 01:31:57,501 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 01:31:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2020-11-30 01:31:57,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:57,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818784986] [2020-11-30 01:31:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:57,527 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:57,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:57,560 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:31:57,817 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2020-11-30 01:31:58,044 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-11-30 01:31:58,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:31:58,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:31:58,102 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-11-30 01:31:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:58,123 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-11-30 01:31:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:31:58,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-11-30 01:31:58,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:31:58,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2020-11-30 01:31:58,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-30 01:31:58,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-30 01:31:58,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2020-11-30 01:31:58,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:31:58,128 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-30 01:31:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2020-11-30 01:31:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-11-30 01:31:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 01:31:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-11-30 01:31:58,134 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-11-30 01:31:58,134 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-11-30 01:31:58,134 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 01:31:58,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-11-30 01:31:58,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:31:58,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:31:58,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:31:58,135 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:58,136 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:58,136 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 212#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 208#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 209#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 210#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 211#L33-3 assume !(main_~i~0 < main_~n~0); 203#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 202#insertionSortENTRY [2020-11-30 01:31:58,136 INFO L796 eck$LassoCheckResult]: Loop: 202#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 205#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 213#L15-6 #t~short4 := ~j~0 > 0; 206#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 207#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 215#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 204#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 202#insertionSortENTRY [2020-11-30 01:31:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:58,136 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2020-11-30 01:31:58,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:58,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908611742] [2020-11-30 01:31:58,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:58,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:58,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:58,165 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:31:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2020-11-30 01:31:58,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:58,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808456234] [2020-11-30 01:31:58,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:58,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:58,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:58,190 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:31:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:58,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2020-11-30 01:31:58,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:58,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258311897] [2020-11-30 01:31:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 01:31:58,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258311897] [2020-11-30 01:31:58,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:31:58,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:31:58,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326347784] [2020-11-30 01:31:58,506 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2020-11-30 01:31:58,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:58,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:31:58,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:31:58,719 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-11-30 01:31:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:58,819 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-11-30 01:31:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:31:58,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2020-11-30 01:31:58,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:31:58,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2020-11-30 01:31:58,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-30 01:31:58,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-30 01:31:58,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-11-30 01:31:58,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:31:58,822 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-30 01:31:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-11-30 01:31:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-11-30 01:31:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-30 01:31:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-11-30 01:31:58,825 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-30 01:31:58,825 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-30 01:31:58,825 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 01:31:58,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2020-11-30 01:31:58,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:31:58,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:31:58,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:31:58,826 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:58,826 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:31:58,827 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 265#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 261#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 262#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 263#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 264#L33-3 assume !(main_~i~0 < main_~n~0); 257#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 256#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 258#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 266#L15-6 #t~short4 := ~j~0 > 0; 259#L15-1 assume !#t~short4; 260#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 270#L15-7 [2020-11-30 01:31:58,827 INFO L796 eck$LassoCheckResult]: Loop: 270#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 268#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 269#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 275#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 272#L15-6 #t~short4 := ~j~0 > 0; 274#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 273#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 270#L15-7 [2020-11-30 01:31:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:58,827 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2020-11-30 01:31:58,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:58,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380063489] [2020-11-30 01:31:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:58,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:58,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:58,877 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:31:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:58,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2020-11-30 01:31:58,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:58,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561415770] [2020-11-30 01:31:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:58,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:31:58,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:31:58,900 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:31:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2020-11-30 01:31:58,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:31:58,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952947932] [2020-11-30 01:31:58,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:31:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:59,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952947932] [2020-11-30 01:31:59,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618638563] [2020-11-30 01:31:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:31:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:59,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 01:31:59,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:31:59,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:31:59,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-11-30 01:31:59,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163541002] [2020-11-30 01:31:59,409 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-11-30 01:31:59,759 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-11-30 01:31:59,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:31:59,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:31:59,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:31:59,819 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 16 states. [2020-11-30 01:32:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:32:00,052 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-11-30 01:32:00,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:32:00,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2020-11-30 01:32:00,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:32:00,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 26 transitions. [2020-11-30 01:32:00,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-11-30 01:32:00,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-11-30 01:32:00,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2020-11-30 01:32:00,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:32:00,055 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-11-30 01:32:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2020-11-30 01:32:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-30 01:32:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-30 01:32:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-11-30 01:32:00,058 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-30 01:32:00,058 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-30 01:32:00,058 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 01:32:00,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2020-11-30 01:32:00,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-30 01:32:00,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:32:00,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:32:00,059 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:00,060 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:00,060 INFO L794 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 402#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 397#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 398#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 399#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 400#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 401#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 410#L33-3 assume !(main_~i~0 < main_~n~0); 393#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 392#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 394#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 403#L15-6 #t~short4 := ~j~0 > 0; 395#L15-1 assume !#t~short4; 396#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 407#L15-7 [2020-11-30 01:32:00,060 INFO L796 eck$LassoCheckResult]: Loop: 407#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 404#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 405#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 413#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 409#L15-6 #t~short4 := ~j~0 > 0; 412#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 411#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 407#L15-7 [2020-11-30 01:32:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2020-11-30 01:32:00,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:00,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762169935] [2020-11-30 01:32:00,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:00,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:00,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:00,098 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:32:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2020-11-30 01:32:00,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:00,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672895744] [2020-11-30 01:32:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:00,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:00,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:00,142 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:32:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2020-11-30 01:32:00,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:00,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477954002] [2020-11-30 01:32:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:00,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:00,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:00,231 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:32:00,623 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-11-30 01:32:00,975 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2020-11-30 01:32:01,246 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-11-30 01:32:01,320 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:32:01,320 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:32:01,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:32:01,320 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:32:01,321 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 01:32:01,321 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:01,321 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:32:01,338 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:32:01,339 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2020-11-30 01:32:01,339 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:32:01,339 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:32:01,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,584 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-11-30 01:32:01,876 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-30 01:32:01,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:01,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:02,581 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 01:32:02,582 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:02,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:02,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:02,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:32:02,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:02,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:02,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:02,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:32:02,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:32:02,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:02,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:02,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:02,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:32:02,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:02,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:02,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:02,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:32:02,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:32:02,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:02,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:02,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:02,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:02,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:02,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:02,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:32:02,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:32:02,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:02,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:02,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:02,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:02,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:02,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:02,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:32:02,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:32:02,790 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 01:32:02,865 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-11-30 01:32:02,866 INFO L444 ModelExtractionUtils]: 2 out of 31 variables were initially zero. Simplification set additionally 25 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 01:32:02,869 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:02,871 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 01:32:02,872 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 01:32:02,872 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_#in~array.base)_1, insertionSort_~i) = 1*v_rep(select #length insertionSort_#in~array.base)_1 - 2*insertionSort_~i Supporting invariants [1*insertionSort_~array.offset >= 0] [2020-11-30 01:32:02,961 INFO L297 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2020-11-30 01:32:02,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 01:32:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:03,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 01:32:03,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:03,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 01:32:03,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:03,987 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-11-30 01:32:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:04,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 5 loop predicates [2020-11-30 01:32:04,382 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 9 states. [2020-11-30 01:32:07,703 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2020-11-30 01:32:07,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 35 states and 42 transitions. Complement of second has 16 states. [2020-11-30 01:32:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 4 non-accepting loop states 1 accepting loop states [2020-11-30 01:32:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-30 01:32:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2020-11-30 01:32:07,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 14 letters. Loop has 7 letters. [2020-11-30 01:32:07,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:32:07,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 21 letters. Loop has 7 letters. [2020-11-30 01:32:07,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:32:07,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 14 letters. Loop has 14 letters. [2020-11-30 01:32:07,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:32:07,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2020-11-30 01:32:07,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-30 01:32:07,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 36 transitions. [2020-11-30 01:32:07,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-30 01:32:07,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-30 01:32:07,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2020-11-30 01:32:07,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 01:32:07,740 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-11-30 01:32:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2020-11-30 01:32:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-11-30 01:32:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-30 01:32:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-11-30 01:32:07,750 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-11-30 01:32:07,750 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-11-30 01:32:07,750 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 01:32:07,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2020-11-30 01:32:07,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-30 01:32:07,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 01:32:07,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 01:32:07,752 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:32:07,752 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-30 01:32:07,752 INFO L794 eck$LassoCheckResult]: Stem: 619#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 614#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 609#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 610#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 611#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 612#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 613#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 615#L33-3 assume !(main_~i~0 < main_~n~0); 600#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 599#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 601#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 623#L15-6 #t~short4 := ~j~0 > 0; 605#L15-1 assume !#t~short4; 606#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 620#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 603#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 602#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 604#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 624#L15-6 #t~short4 := ~j~0 > 0; 617#L15-1 [2020-11-30 01:32:07,752 INFO L796 eck$LassoCheckResult]: Loop: 617#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 626#L15-3 assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 625#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 616#L15-6 #t~short4 := ~j~0 > 0; 617#L15-1 [2020-11-30 01:32:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:07,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1647994767, now seen corresponding path program 1 times [2020-11-30 01:32:07,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:07,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040264024] [2020-11-30 01:32:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:07,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:07,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:07,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:32:07,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2020-11-30 01:32:07,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:07,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807856681] [2020-11-30 01:32:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:07,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:07,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:07,815 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:32:07,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:07,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1753822804, now seen corresponding path program 1 times [2020-11-30 01:32:07,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:32:07,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283262597] [2020-11-30 01:32:07,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:32:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:07,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:32:07,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:32:07,873 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:32:08,014 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2020-11-30 01:32:08,342 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-11-30 01:32:08,803 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2020-11-30 01:32:09,139 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-11-30 01:32:09,635 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 107 [2020-11-30 01:32:09,713 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 01:32:09,713 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 01:32:09,713 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 01:32:09,713 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 01:32:09,713 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 01:32:09,713 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:09,713 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 01:32:09,714 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 01:32:09,714 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration7_Lasso [2020-11-30 01:32:09,714 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 01:32:09,714 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 01:32:09,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:09,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:09,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:09,895 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-30 01:32:10,099 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2020-11-30 01:32:10,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 01:32:10,624 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-11-30 01:32:10,728 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 01:32:10,728 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:10,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:10,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:10,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:32:10,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:10,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:10,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:10,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:32:10,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:32:10,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:10,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:10,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:10,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:32:10,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:10,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:10,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:10,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:32:10,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:32:10,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:10,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:10,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:10,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:10,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:10,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:10,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:32:10,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:32:10,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 01:32:10,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:10,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:10,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:10,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:10,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:10,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:32:10,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:32:10,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:10,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:10,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:10,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:10,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:10,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:10,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 01:32:10,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 01:32:10,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:10,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:10,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:10,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 01:32:10,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:10,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 01:32:10,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:10,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 01:32:10,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 01:32:10,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:10,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 01:32:10,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 01:32:10,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 01:32:10,987 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-11-30 01:32:10,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 01:32:11,017 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-11-30 01:32:11,017 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-11-30 01:32:11,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 01:32:11,123 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-11-30 01:32:11,123 INFO L444 ModelExtractionUtils]: 34 out of 56 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce095b94-69b7-4759-9930-e17a4f3bf349/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 01:32:11,125 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 01:32:11,129 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-11-30 01:32:11,129 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 01:32:11,129 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0) = 1*insertionSort_~j~0 Supporting invariants [-1*insertionSort_~array.offset >= 0] [2020-11-30 01:32:11,165 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-11-30 01:32:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:11,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 01:32:11,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:11,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:32:11,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:11,401 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2020-11-30 01:32:11,401 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-11-30 01:32:11,455 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 32 states and 37 transitions. Complement of second has 8 states. [2020-11-30 01:32:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 01:32:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 01:32:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-11-30 01:32:11,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2020-11-30 01:32:11,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:32:11,465 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 01:32:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:11,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 01:32:11,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:11,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:32:11,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:11,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2020-11-30 01:32:11,609 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-11-30 01:32:11,663 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 32 states and 37 transitions. Complement of second has 8 states. [2020-11-30 01:32:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 01:32:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 01:32:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-11-30 01:32:11,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2020-11-30 01:32:11,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:32:11,665 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 01:32:11,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:32:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:11,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 01:32:11,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:32:11,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:32:11,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:32:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:32:11,853 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2020-11-30 01:32:11,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-11-30 01:32:11,950 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 52 states and 66 transitions. Complement of second has 16 states. [2020-11-30 01:32:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 01:32:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 01:32:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-11-30 01:32:11,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 19 letters. Loop has 4 letters. [2020-11-30 01:32:11,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:32:11,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 23 letters. Loop has 4 letters. [2020-11-30 01:32:11,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:32:11,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 19 letters. Loop has 8 letters. [2020-11-30 01:32:11,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 01:32:11,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 66 transitions. [2020-11-30 01:32:11,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 01:32:11,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. [2020-11-30 01:32:11,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-30 01:32:11,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-30 01:32:11,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-30 01:32:11,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 01:32:11,956 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:32:11,956 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:32:11,956 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:32:11,956 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 01:32:11,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-30 01:32:11,957 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-30 01:32:11,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-30 01:32:11,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 01:32:11 BoogieIcfgContainer [2020-11-30 01:32:11,962 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 01:32:11,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:32:11,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:32:11,963 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:32:11,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:31:55" (3/4) ... [2020-11-30 01:32:11,971 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:32:11,971 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:32:11,972 INFO L168 Benchmark]: Toolchain (without parser) took 17535.28 ms. Allocated memory was 109.1 MB in the beginning and 249.6 MB in the end (delta: 140.5 MB). Free memory was 85.0 MB in the beginning and 118.9 MB in the end (delta: -33.9 MB). Peak memory consumption was 107.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:11,973 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 81.8 MB. Free memory was 46.9 MB in the beginning and 46.9 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:32:11,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.72 ms. Allocated memory is still 109.1 MB. Free memory was 85.0 MB in the beginning and 87.1 MB in the end (delta: -2.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:11,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.24 ms. Allocated memory is still 109.1 MB. Free memory was 87.1 MB in the beginning and 86.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:32:11,978 INFO L168 Benchmark]: Boogie Preprocessor took 38.07 ms. Allocated memory is still 109.1 MB. Free memory was 86.1 MB in the beginning and 84.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:11,979 INFO L168 Benchmark]: RCFGBuilder took 364.22 ms. Allocated memory is still 109.1 MB. Free memory was 84.5 MB in the beginning and 70.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:11,982 INFO L168 Benchmark]: BuchiAutomizer took 16742.14 ms. Allocated memory was 109.1 MB in the beginning and 249.6 MB in the end (delta: 140.5 MB). Free memory was 70.9 MB in the beginning and 118.9 MB in the end (delta: -48.1 MB). Peak memory consumption was 94.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:32:11,983 INFO L168 Benchmark]: Witness Printer took 8.58 ms. Allocated memory is still 249.6 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:32:11,985 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 81.8 MB. Free memory was 46.9 MB in the beginning and 46.9 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 342.72 ms. Allocated memory is still 109.1 MB. Free memory was 85.0 MB in the beginning and 87.1 MB in the end (delta: -2.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.24 ms. Allocated memory is still 109.1 MB. Free memory was 87.1 MB in the beginning and 86.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.07 ms. Allocated memory is still 109.1 MB. Free memory was 86.1 MB in the beginning and 84.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 364.22 ms. Allocated memory is still 109.1 MB. Free memory was 84.5 MB in the beginning and 70.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 16742.14 ms. Allocated memory was 109.1 MB in the beginning and 249.6 MB in the end (delta: 140.5 MB). Free memory was 70.9 MB in the beginning and 118.9 MB in the end (delta: -48.1 MB). Peak memory consumption was 94.0 MB. Max. memory is 16.1 GB. * Witness Printer took 8.58 ms. Allocated memory is still 249.6 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[malloc(n * sizeof (int))] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -2 * i and consists of 9 locations. One nondeterministic module has affine ranking function j and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 10.2s. Construction of modules took 2.1s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 112 SDtfs, 116 SDslu, 203 SDs, 0 SdLazy, 218 SolverSat, 37 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital179 mio100 ax100 hnf98 lsp97 ukn98 mio100 lsp54 div100 bol102 ite100 ukn100 eq171 hnf84 smp94 dnf142 smp87 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 148ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...