./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_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:06,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:12:06,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:12:06,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:12:06,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:12:06,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:12:06,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:12:06,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:12:06,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:12:06,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:12:06,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:12:06,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:12:06,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:12:06,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:12:06,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:12:06,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:12:06,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:12:06,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:12:06,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:12:06,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:12:06,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:12:06,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:12:06,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:12:06,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:12:06,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:12:06,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:12:06,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:12:06,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:12:06,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:12:06,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:12:06,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:12:06,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:12:06,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:12:06,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:12:06,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:12:06,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:12:06,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:12:06,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:12:06,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:12:06,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:12:06,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:12:06,776 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-28 03:12:06,821 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:12:06,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:12:06,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:12:06,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:12:06,824 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:12:06,825 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:12:06,825 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:12:06,825 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:12:06,825 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:12:06,826 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:12:06,827 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:12:06,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:12:06,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:12:06,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:12:06,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:12:06,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:12:06,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:12:06,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:12:06,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:12:06,829 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:12:06,830 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:12:06,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:12:06,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:12:06,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:12:06,831 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:12:06,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:12:06,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:12:06,832 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:12:06,832 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:12:06,833 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:12:06,833 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_4521a235-df8a-4027-8078-cb502f7e4e90/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_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:07,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:12:07,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:12:07,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:12:07,195 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:12:07,196 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:12:07,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2020-11-28 03:12:07,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/data/9da66c47b/db458d0852534073b1134d47b30b4b89/FLAGbb57b6b7f [2020-11-28 03:12:07,842 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:12:07,842 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2020-11-28 03:12:07,855 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/data/9da66c47b/db458d0852534073b1134d47b30b4b89/FLAGbb57b6b7f [2020-11-28 03:12:08,178 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/bin/uautomizer/data/9da66c47b/db458d0852534073b1134d47b30b4b89 [2020-11-28 03:12:08,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:12:08,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:12:08,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:12:08,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:12:08,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:12:08,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67893c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08, skipping insertion in model container [2020-11-28 03:12:08,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:12:08,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:12:08,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:12:08,514 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:12:08,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:12:08,551 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:12:08,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08 WrapperNode [2020-11-28 03:12:08,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:12:08,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:12:08,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:12:08,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:12:08,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:12:08,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:12:08,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:12:08,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:12:08,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... [2020-11-28 03:12:08,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:12:08,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:12:08,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:12:08,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:12:08,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:12:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-28 03:12:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2020-11-28 03:12:08,712 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2020-11-28 03:12:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:12:08,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:12:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-28 03:12:08,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:12:09,206 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:12:09,207 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-28 03:12:09,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:12:09 BoogieIcfgContainer [2020-11-28 03:12:09,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:12:09,210 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:12:09,210 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:12:09,214 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:12:09,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:12:09,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:12:08" (1/3) ... [2020-11-28 03:12:09,218 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78672580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:12:09, skipping insertion in model container [2020-11-28 03:12:09,218 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:12:09,218 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:12:08" (2/3) ... [2020-11-28 03:12:09,219 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78672580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:12:09, skipping insertion in model container [2020-11-28 03:12:09,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:12:09,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:12:09" (3/3) ... [2020-11-28 03:12:09,226 INFO L373 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2020-11-28 03:12:09,304 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:12:09,304 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:12:09,304 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:12:09,304 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:12:09,304 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:12:09,304 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:12:09,305 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:12:09,305 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:12:09,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-11-28 03:12:09,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-28 03:12:09,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:12:09,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:12:09,353 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-28 03:12:09,354 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:12:09,354 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:12:09,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-11-28 03:12:09,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-11-28 03:12:09,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:12:09,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:12:09,358 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-28 03:12:09,358 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:12:09,366 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-28 03:12:09,367 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-28 03:12:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2020-11-28 03:12:09,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:09,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718907809] [2020-11-28 03:12:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:09,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:09,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:09,523 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:09,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2020-11-28 03:12:09,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:09,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008774445] [2020-11-28 03:12:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:09,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:09,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:09,551 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:09,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2020-11-28 03:12:09,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:09,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404588247] [2020-11-28 03:12:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:09,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:09,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:09,598 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:09,887 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:12:09,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:12:09,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:12:09,888 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:12:09,889 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:12:09,889 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:09,889 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:12:09,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:12:09,890 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2020-11-28 03:12:09,890 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:12:09,890 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:12:09,918 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-28 03:12:09,927 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-28 03:12:09,931 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-28 03:12:09,937 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-28 03:12:10,115 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-28 03:12:10,124 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-28 03:12:10,516 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:12:10,522 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:10,534 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-28 03:12:10,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:10,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:12:10,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:10,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:10,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:10,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:12:10,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:12:10,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:10,593 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-28 03:12:10,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:10,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:12:10,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:10,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:10,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:10,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:12:10,599 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-28 03:12:10,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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) [2020-11-28 03:12:10,651 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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:10,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:10,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:10,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:10,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:10,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:12:10,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:12:10,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:10,723 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-28 03:12:10,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:10,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:12:10,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:10,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:10,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:10,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:12:10,729 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-28 03:12:10,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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) [2020-11-28 03:12:10,781 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-28 03:12:10,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:10,784 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-11-28 03:12:10,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:10,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:10,795 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-11-28 03:12:10,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:10,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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) [2020-11-28 03:12:10,860 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-28 03:12:10,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:10,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:10,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:10,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:10,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:12:10,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:10,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:10,946 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-28 03:12:10,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:10,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:10,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:10,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:10,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:12:10,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:12:10,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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) [2020-11-28 03:12:11,010 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-28 03:12:11,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:11,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:12:11,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:11,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:11,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:11,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:12:11,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:11,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:11,050 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-28 03:12:11,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:11,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:11,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:11,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:11,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:12:11,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:12:11,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:12:11,140 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-11-28 03:12:11,140 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_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:11,150 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-28 03:12:11,153 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-28 03:12:11,154 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:12:11,154 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-28 03:12:11,212 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-11-28 03:12:11,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-28 03:12:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:11,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 03:12:11,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:11,311 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 03:12:11,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:11,338 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-28 03:12:11,360 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-28 03:12:11,361 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2020-11-28 03:12:11,460 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-28 03:12:11,462 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-28 03:12:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:12:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-11-28 03:12:11,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2020-11-28 03:12:11,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:11,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2020-11-28 03:12:11,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:11,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2020-11-28 03:12:11,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:11,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2020-11-28 03:12:11,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:11,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2020-11-28 03:12:11,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-11-28 03:12:11,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-28 03:12:11,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-11-28 03:12:11,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:12:11,495 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-28 03:12:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-11-28 03:12:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-28 03:12:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-28 03:12:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-11-28 03:12:11,528 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-28 03:12:11,529 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-28 03:12:11,529 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:12:11,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-11-28 03:12:11,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:11,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:12:11,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:12:11,532 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-28 03:12:11,532 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-28 03:12:11,533 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-28 03:12:11,536 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-28 03:12:11,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2020-11-28 03:12:11,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:11,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973036558] [2020-11-28 03:12:11,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:11,598 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-28 03:12:11,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973036558] [2020-11-28 03:12:11,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:12:11,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:12:11,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578792726] [2020-11-28 03:12:11,602 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:12:11,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:11,603 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2020-11-28 03:12:11,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:11,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648275171] [2020-11-28 03:12:11,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:11,617 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-28 03:12:11,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648275171] [2020-11-28 03:12:11,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:12:11,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:12:11,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337435362] [2020-11-28 03:12:11,618 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:12:11,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:12:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-28 03:12:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-28 03:12:11,623 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2020-11-28 03:12:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:12:11,629 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-11-28 03:12:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:12:11,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-11-28 03:12:11,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:11,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-11-28 03:12:11,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-28 03:12:11,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-28 03:12:11,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-11-28 03:12:11,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:12:11,633 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-28 03:12:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-11-28 03:12:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-28 03:12:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-28 03:12:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-11-28 03:12:11,635 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-28 03:12:11,636 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-28 03:12:11,636 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:12:11,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-11-28 03:12:11,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:11,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:12:11,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:12:11,637 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-28 03:12:11,638 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:12:11,638 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-28 03:12:11,638 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~short4;havoc #t~mem3; 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-28 03:12:11,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:11,639 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2020-11-28 03:12:11,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:11,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128168242] [2020-11-28 03:12:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:11,675 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-28 03:12:11,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128168242] [2020-11-28 03:12:11,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:12:11,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:12:11,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454741222] [2020-11-28 03:12:11,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:12:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2020-11-28 03:12:11,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:11,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846531784] [2020-11-28 03:12:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:11,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:11,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:11,737 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:12,047 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2020-11-28 03:12:12,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:12:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:12:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:12:12,290 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-11-28 03:12:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:12:12,305 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-11-28 03:12:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:12:12,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-11-28 03:12:12,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:12,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2020-11-28 03:12:12,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-28 03:12:12,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-28 03:12:12,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2020-11-28 03:12:12,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:12:12,308 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-11-28 03:12:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2020-11-28 03:12:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-11-28 03:12:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-28 03:12:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-11-28 03:12:12,311 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-11-28 03:12:12,311 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-11-28 03:12:12,311 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:12:12,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-11-28 03:12:12,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:12,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:12:12,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:12:12,313 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:12:12,313 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:12:12,313 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-28 03:12:12,313 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~short4;havoc #t~mem3; 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-28 03:12:12,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:12,314 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2020-11-28 03:12:12,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:12,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142626102] [2020-11-28 03:12:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:12,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:12,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:12,349 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:12,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2020-11-28 03:12:12,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:12,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271519642] [2020-11-28 03:12:12,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:12,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:12,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:12,393 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2020-11-28 03:12:12,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:12,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625688655] [2020-11-28 03:12:12,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:12,528 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-28 03:12:12,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625688655] [2020-11-28 03:12:12,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:12:12,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:12:12,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35824659] [2020-11-28 03:12:12,823 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2020-11-28 03:12:13,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:12:13,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:12:13,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:12:13,060 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-11-28 03:12:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:12:13,199 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-11-28 03:12:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:12:13,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2020-11-28 03:12:13,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:13,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2020-11-28 03:12:13,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-28 03:12:13,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-28 03:12:13,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-11-28 03:12:13,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:12:13,202 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-28 03:12:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-11-28 03:12:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-11-28 03:12:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-28 03:12:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-11-28 03:12:13,204 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-28 03:12:13,204 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-28 03:12:13,204 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:12:13,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2020-11-28 03:12:13,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:13,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:12:13,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:12:13,209 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:12:13,210 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:12:13,210 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~short4;havoc #t~mem3; 270#L15-7 [2020-11-28 03:12:13,210 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~short4;havoc #t~mem3; 270#L15-7 [2020-11-28 03:12:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2020-11-28 03:12:13,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:13,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359249653] [2020-11-28 03:12:13,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:13,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:13,260 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:13,268 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:13,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2020-11-28 03:12:13,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:13,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199473125] [2020-11-28 03:12:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:13,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:13,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:13,320 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:13,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2020-11-28 03:12:13,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:13,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839069691] [2020-11-28 03:12:13,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:13,523 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-28 03:12:13,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839069691] [2020-11-28 03:12:13,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362253442] [2020-11-28 03:12:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:13,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-28 03:12:13,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:13,853 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-28 03:12:13,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:12:13,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-11-28 03:12:13,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193062906] [2020-11-28 03:12:13,984 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-11-28 03:12:14,364 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-11-28 03:12:14,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:12:14,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-28 03:12:14,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-28 03:12:14,432 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 16 states. [2020-11-28 03:12:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:12:14,652 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-11-28 03:12:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 03:12:14,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2020-11-28 03:12:14,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:14,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 26 transitions. [2020-11-28 03:12:14,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-11-28 03:12:14,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-11-28 03:12:14,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2020-11-28 03:12:14,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:12:14,656 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-11-28 03:12:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2020-11-28 03:12:14,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-28 03:12:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-28 03:12:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-11-28 03:12:14,659 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-28 03:12:14,659 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-28 03:12:14,659 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:12:14,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2020-11-28 03:12:14,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-28 03:12:14,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:12:14,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:12:14,661 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:12:14,661 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:12:14,661 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~short4;havoc #t~mem3; 407#L15-7 [2020-11-28 03:12:14,661 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~short4;havoc #t~mem3; 407#L15-7 [2020-11-28 03:12:14,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:14,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2020-11-28 03:12:14,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:14,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869565215] [2020-11-28 03:12:14,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:14,677 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:14,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:14,693 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2020-11-28 03:12:14,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:14,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704662541] [2020-11-28 03:12:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:14,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:14,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:14,713 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2020-11-28 03:12:14,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:14,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144693386] [2020-11-28 03:12:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:14,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:14,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:14,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:14,940 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-11-28 03:12:15,371 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-11-28 03:12:15,760 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2020-11-28 03:12:16,155 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-11-28 03:12:16,252 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:12:16,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:12:16,253 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:12:16,253 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:12:16,253 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:12:16,253 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:16,253 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:12:16,253 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:12:16,253 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2020-11-28 03:12:16,253 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:12:16,253 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:12:16,259 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-28 03:12:16,263 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-28 03:12:16,267 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-28 03:12:16,272 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-28 03:12:16,571 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-11-28 03:12:17,009 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-28 03:12:17,010 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-28 03:12:17,017 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-28 03:12:17,019 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-28 03:12:17,022 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-28 03:12:17,025 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-28 03:12:17,028 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-28 03:12:17,030 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-28 03:12:17,034 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-28 03:12:17,038 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-28 03:12:17,041 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-28 03:12:17,044 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-28 03:12:17,059 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-28 03:12:17,064 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-28 03:12:17,069 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-28 03:12:17,071 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-28 03:12:17,074 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-28 03:12:17,077 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-28 03:12:17,084 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-28 03:12:17,088 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-28 03:12:17,091 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-28 03:12:17,494 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-11-28 03:12:17,699 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 03:12:17,924 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:12:17,924 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:17,963 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-28 03:12:17,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:17,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:12:17,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:17,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:17,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:17,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:12:17,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:12:17,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:17,998 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-28 03:12:18,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:18,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:12:18,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:18,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:18,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:18,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:12:18,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:12:18,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:18,034 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-28 03:12:18,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:18,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:18,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:18,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:18,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:12:18,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:12:18,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:18,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:12:18,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:18,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:18,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:18,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:18,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:12:18,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:12:18,134 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:12:18,193 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-11-28 03:12:18,193 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_4521a235-df8a-4027-8078-cb502f7e4e90/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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:18,197 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 03:12:18,201 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-28 03:12:18,202 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:12:18,202 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-28 03:12:18,288 INFO L297 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2020-11-28 03:12:18,298 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-28 03:12:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:18,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-28 03:12:18,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:18,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-28 03:12:18,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:19,628 WARN L193 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-11-28 03:12:20,000 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-28 03:12:20,001 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-28 03:12:20,002 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 9 states. [2020-11-28 03:12:24,407 WARN L193 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2020-11-28 03:12:24,488 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-28 03:12:24,490 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-28 03:12:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-28 03:12:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2020-11-28 03:12:24,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 14 letters. Loop has 7 letters. [2020-11-28 03:12:24,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:24,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 21 letters. Loop has 7 letters. [2020-11-28 03:12:24,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:24,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 14 letters. Loop has 14 letters. [2020-11-28 03:12:24,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:24,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2020-11-28 03:12:24,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-28 03:12:24,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 36 transitions. [2020-11-28 03:12:24,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-11-28 03:12:24,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-28 03:12:24,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2020-11-28 03:12:24,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:12:24,497 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-11-28 03:12:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2020-11-28 03:12:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-11-28 03:12:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-28 03:12:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-11-28 03:12:24,500 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-11-28 03:12:24,500 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-11-28 03:12:24,500 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:12:24,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2020-11-28 03:12:24,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-28 03:12:24,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:12:24,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:12:24,503 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:12:24,503 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-28 03:12:24,504 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~short4;havoc #t~mem3; 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-28 03:12:24,504 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~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 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-28 03:12:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:24,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1647994767, now seen corresponding path program 1 times [2020-11-28 03:12:24,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:24,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376228565] [2020-11-28 03:12:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:24,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:24,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:24,548 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2020-11-28 03:12:24,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:24,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206656517] [2020-11-28 03:12:24,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:24,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:24,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:24,560 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:24,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1753822804, now seen corresponding path program 1 times [2020-11-28 03:12:24,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:12:24,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991371147] [2020-11-28 03:12:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:12:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:24,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:12:24,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:12:24,602 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:12:24,747 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2020-11-28 03:12:25,116 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-11-28 03:12:25,709 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2020-11-28 03:12:25,818 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-28 03:12:26,119 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2020-11-28 03:12:26,684 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 107 [2020-11-28 03:12:26,804 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:12:26,804 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:12:26,804 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:12:26,804 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:12:26,804 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:12:26,804 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:26,804 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:12:26,804 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:12:26,804 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration7_Lasso [2020-11-28 03:12:26,805 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:12:26,805 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:12:26,809 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-28 03:12:26,819 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-28 03:12:26,822 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-28 03:12:27,087 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-28 03:12:27,365 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2020-11-28 03:12:27,365 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-28 03:12:27,371 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-28 03:12:27,375 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-28 03:12:27,378 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-28 03:12:27,381 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-28 03:12:27,386 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-28 03:12:27,390 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-28 03:12:27,394 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-28 03:12:27,397 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-28 03:12:27,400 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-28 03:12:27,403 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-28 03:12:27,408 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-28 03:12:27,411 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-28 03:12:27,415 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-28 03:12:27,419 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-28 03:12:27,423 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-28 03:12:27,426 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-28 03:12:27,429 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-28 03:12:27,431 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-28 03:12:27,435 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-28 03:12:28,057 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-11-28 03:12:28,173 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:12:28,173 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:28,182 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-28 03:12:28,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:28,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:12:28,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:28,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:28,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:28,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:12:28,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:12:28,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:28,211 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-28 03:12:28,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:28,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:12:28,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:28,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:28,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:28,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:12:28,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:12:28,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:28,244 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-28 03:12:28,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:28,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:28,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:28,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:28,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:12:28,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:12:28,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:28,287 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-28 03:12:28,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:28,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:28,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:28,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:28,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:12:28,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:12:28,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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) [2020-11-28 03:12:28,361 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-28 03:12:28,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:28,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:28,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:28,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:28,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:12:28,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:28,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:28,408 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-28 03:12:28,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:28,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:12:28,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:28,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:12:28,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:28,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:12:28,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:12:28,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4521a235-df8a-4027-8078-cb502f7e4e90/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-28 03:12:28,438 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-28 03:12:28,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:12:28,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:12:28,441 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-11-28 03:12:28,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:12:28,474 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-11-28 03:12:28,475 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-11-28 03:12:28,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:12:28,621 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-11-28 03:12:28,621 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_4521a235-df8a-4027-8078-cb502f7e4e90/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) [2020-11-28 03:12:28,624 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:12:28,628 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-11-28 03:12:28,629 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:12:28,629 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-28 03:12:28,689 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-11-28 03:12:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:28,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-28 03:12:28,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:28,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-28 03:12:28,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:28,935 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-28 03:12:28,935 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-28 03:12:28,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-11-28 03:12:29,037 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-28 03:12:29,039 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-28 03:12:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-28 03:12:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-11-28 03:12:29,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2020-11-28 03:12:29,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:29,040 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-28 03:12:29,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:29,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-28 03:12:29,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:29,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-28 03:12:29,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:29,309 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-28 03:12:29,310 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-28 03:12:29,310 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-11-28 03:12:29,375 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-28 03:12:29,375 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-28 03:12:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-28 03:12:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-11-28 03:12:29,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2020-11-28 03:12:29,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:29,376 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-28 03:12:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:12:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:29,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-28 03:12:29,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:12:29,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-28 03:12:29,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:12:29,586 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-28 03:12:29,587 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-28 03:12:29,587 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-11-28 03:12:29,706 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-28 03:12:29,706 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-28 03:12:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-28 03:12:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-11-28 03:12:29,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 19 letters. Loop has 4 letters. [2020-11-28 03:12:29,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:29,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 23 letters. Loop has 4 letters. [2020-11-28 03:12:29,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:29,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 19 letters. Loop has 8 letters. [2020-11-28 03:12:29,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:12:29,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 66 transitions. [2020-11-28 03:12:29,711 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:12:29,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. [2020-11-28 03:12:29,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-28 03:12:29,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-28 03:12:29,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-28 03:12:29,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:12:29,712 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:12:29,712 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:12:29,712 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:12:29,712 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:12:29,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-28 03:12:29,712 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-28 03:12:29,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-28 03:12:29,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:12:29 BoogieIcfgContainer [2020-11-28 03:12:29,720 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:12:29,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:12:29,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:12:29,721 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:12:29,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:12:09" (3/4) ... [2020-11-28 03:12:29,725 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-28 03:12:29,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:12:29,726 INFO L168 Benchmark]: Toolchain (without parser) took 21538.57 ms. Allocated memory was 90.2 MB in the beginning and 224.4 MB in the end (delta: 134.2 MB). Free memory was 56.6 MB in the beginning and 127.9 MB in the end (delta: -71.3 MB). Peak memory consumption was 64.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:12:29,727 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 90.2 MB. Free memory was 66.1 MB in the beginning and 66.1 MB in the end (delta: 30.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:12:29,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.96 ms. Allocated memory is still 90.2 MB. Free memory was 56.4 MB in the beginning and 68.1 MB in the end (delta: -11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:12:29,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.87 ms. Allocated memory is still 90.2 MB. Free memory was 68.1 MB in the beginning and 66.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:12:29,729 INFO L168 Benchmark]: Boogie Preprocessor took 29.18 ms. Allocated memory is still 90.2 MB. Free memory was 66.8 MB in the beginning and 65.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:12:29,730 INFO L168 Benchmark]: RCFGBuilder took 585.09 ms. Allocated memory is still 90.2 MB. Free memory was 65.3 MB in the beginning and 51.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:12:29,731 INFO L168 Benchmark]: BuchiAutomizer took 20510.10 ms. Allocated memory was 90.2 MB in the beginning and 224.4 MB in the end (delta: 134.2 MB). Free memory was 51.7 MB in the beginning and 127.9 MB in the end (delta: -76.2 MB). Peak memory consumption was 58.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:12:29,731 INFO L168 Benchmark]: Witness Printer took 4.87 ms. Allocated memory is still 224.4 MB. Free memory is still 127.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:12:29,735 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.33 ms. Allocated memory is still 90.2 MB. Free memory was 66.1 MB in the beginning and 66.1 MB in the end (delta: 30.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 359.96 ms. Allocated memory is still 90.2 MB. Free memory was 56.4 MB in the beginning and 68.1 MB in the end (delta: -11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.87 ms. Allocated memory is still 90.2 MB. Free memory was 68.1 MB in the beginning and 66.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.18 ms. Allocated memory is still 90.2 MB. Free memory was 66.8 MB in the beginning and 65.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 585.09 ms. Allocated memory is still 90.2 MB. Free memory was 65.3 MB in the beginning and 51.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 20510.10 ms. Allocated memory was 90.2 MB in the beginning and 224.4 MB in the end (delta: 134.2 MB). Free memory was 51.7 MB in the beginning and 127.9 MB in the end (delta: -76.2 MB). Peak memory consumption was 58.4 MB. Max. memory is 16.1 GB. * Witness Printer took 4.87 ms. Allocated memory is still 224.4 MB. Free memory is still 127.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 20.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 12.3s. Construction of modules took 2.8s. Büchi inclusion checks took 5.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.8s 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: 193ms 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...