./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/diff-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/diff-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/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 32bit --witnessprinter.graph.data.programhash 4654dbed0e523ad65784c661074162c44d8abe4e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:39:30,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:39:30,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:39:30,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:39:30,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:39:30,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:39:30,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:39:30,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:39:30,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:39:30,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:39:30,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:39:30,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:39:30,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:39:30,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:39:30,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:39:30,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:39:30,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:39:30,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:39:30,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:39:30,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:39:30,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:39:30,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:39:30,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:39:30,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:39:30,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:39:30,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:39:30,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:39:30,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:39:30,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:39:30,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:39:30,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:39:30,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:39:30,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:39:30,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:39:30,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:39:30,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:39:30,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:39:30,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:39:30,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:39:30,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:39:30,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:39:30,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:39:30,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:39:30,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:39:30,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:39:30,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:39:30,694 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:39:30,695 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:39:30,695 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:39:30,695 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:39:30,695 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:39:30,695 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:39:30,696 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:39:30,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:39:30,696 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:39:30,696 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:39:30,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:39:30,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:39:30,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:39:30,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:39:30,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:39:30,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:39:30,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:39:30,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:39:30,698 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:39:30,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:39:30,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:39:30,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:39:30,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:39:30,699 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:39:30,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:39:30,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:39:30,700 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:39:30,712 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:39:30,712 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4654dbed0e523ad65784c661074162c44d8abe4e [2019-11-16 00:39:30,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:39:30,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:39:30,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:39:30,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:39:30,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:39:30,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2019-11-16 00:39:30,830 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/data/cdf754ae8/a5fbce71a3a743af92c491e40ca0f6a4/FLAG5b0f255fd [2019-11-16 00:39:31,290 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:39:31,291 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2019-11-16 00:39:31,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/data/cdf754ae8/a5fbce71a3a743af92c491e40ca0f6a4/FLAG5b0f255fd [2019-11-16 00:39:31,617 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/data/cdf754ae8/a5fbce71a3a743af92c491e40ca0f6a4 [2019-11-16 00:39:31,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:39:31,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:39:31,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:31,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:39:31,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:39:31,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:31" (1/1) ... [2019-11-16 00:39:31,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25dcc246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:31, skipping insertion in model container [2019-11-16 00:39:31,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:31" (1/1) ... [2019-11-16 00:39:31,635 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:39:31,671 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:39:32,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:32,063 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:39:32,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:39:32,154 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:39:32,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32 WrapperNode [2019-11-16 00:39:32,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:39:32,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:32,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:39:32,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:39:32,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... [2019-11-16 00:39:32,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... [2019-11-16 00:39:32,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:39:32,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:39:32,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:39:32,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:39:32,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... [2019-11-16 00:39:32,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... [2019-11-16 00:39:32,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... [2019-11-16 00:39:32,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... [2019-11-16 00:39:32,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... [2019-11-16 00:39:32,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... [2019-11-16 00:39:32,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... [2019-11-16 00:39:32,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:39:32,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:39:32,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:39:32,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:39:32,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:39:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:39:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:39:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:39:32,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:39:32,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:39:32,654 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:39:32,654 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-16 00:39:32,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:32 BoogieIcfgContainer [2019-11-16 00:39:32,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:39:32,656 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:39:32,656 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:39:32,659 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:39:32,661 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:32,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:39:31" (1/3) ... [2019-11-16 00:39:32,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4560c5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:39:32, skipping insertion in model container [2019-11-16 00:39:32,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:32,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:32" (2/3) ... [2019-11-16 00:39:32,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4560c5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:39:32, skipping insertion in model container [2019-11-16 00:39:32,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:39:32,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:32" (3/3) ... [2019-11-16 00:39:32,666 INFO L371 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2019-11-16 00:39:32,713 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:39:32,713 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:39:32,713 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:39:32,713 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:39:32,714 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:39:32,714 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:39:32,714 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:39:32,714 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:39:32,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-16 00:39:32,741 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:39:32,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:32,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:32,746 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:39:32,746 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:32,746 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:39:32,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-16 00:39:32,748 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:39:32,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:32,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:32,748 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:39:32,748 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:32,754 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 18#L539true assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 3#L539-2true assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 14#L542-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 5#L549-3true [2019-11-16 00:39:32,754 INFO L793 eck$LassoCheckResult]: Loop: 5#L549-3true assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 4#L549-2true main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 5#L549-3true [2019-11-16 00:39:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-16 00:39:32,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:32,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368330691] [2019-11-16 00:39:32,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:32,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:32,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:32,896 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:32,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:32,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-16 00:39:32,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:32,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935130558] [2019-11-16 00:39:32,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:32,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:32,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:32,912 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:32,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-16 00:39:32,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:32,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957894906] [2019-11-16 00:39:32,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:32,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:32,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:32,985 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:33,316 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-16 00:39:33,510 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-16 00:39:33,521 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:39:33,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:39:33,522 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:39:33,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:39:33,522 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:39:33,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:33,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:39:33,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:39:33,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2019-11-16 00:39:33,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:39:33,523 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:39:33,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:33,831 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-16 00:39:34,791 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-16 00:39:34,834 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:39:34,839 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:39:34,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,849 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:34,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:34,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:34,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:34,859 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,859 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,859 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,860 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:34,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:34,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,878 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:34,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:34,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:34,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,884 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:34,884 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:34,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,889 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,891 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:34,904 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:34,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,912 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:34,912 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:34,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:34,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,922 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:34,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:34,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,929 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:34,933 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:34,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,941 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,944 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:34,946 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:34,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,954 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:34,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,955 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:34,955 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:34,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,957 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,957 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,961 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:34,963 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:34,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,967 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,967 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,967 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,968 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:34,968 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:34,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,974 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:34,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,975 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:34,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:34,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:34,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:34,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:34,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:34,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:34,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:34,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:34,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:34,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:34,982 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:34,982 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:34,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:35,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:35,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:35,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:35,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:35,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:35,009 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:35,009 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:35,111 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:39:35,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:39:35,143 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:39:35,146 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:39:35,149 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:39:35,150 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:39:35,150 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~Alen~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~Alen~0 Supporting invariants [] [2019-11-16 00:39:35,188 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-11-16 00:39:35,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:35,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:39:35,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:35,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:39:35,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:35,303 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:39:35,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 3 states. [2019-11-16 00:39:35,357 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 3 states. Result 48 states and 75 transitions. Complement of second has 7 states. [2019-11-16 00:39:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:39:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:39:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-11-16 00:39:35,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:39:35,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:35,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:39:35,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:35,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:39:35,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:35,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 75 transitions. [2019-11-16 00:39:35,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:39:35,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 17 states and 25 transitions. [2019-11-16 00:39:35,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-16 00:39:35,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-16 00:39:35,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-11-16 00:39:35,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:35,386 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-16 00:39:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-11-16 00:39:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-16 00:39:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:39:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-16 00:39:35,405 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-16 00:39:35,405 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-16 00:39:35,406 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:39:35,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-11-16 00:39:35,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:39:35,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:35,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:35,407 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:35,407 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:35,408 INFO L791 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 165#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 166#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 156#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 157#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 160#L549-3 assume !(main_~i~1 < main_~Alen~0); 161#L549-4 main_~i~2 := 0; 162#L554-3 [2019-11-16 00:39:35,408 INFO L793 eck$LassoCheckResult]: Loop: 162#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 170#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 162#L554-3 [2019-11-16 00:39:35,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-16 00:39:35,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:35,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095998581] [2019-11-16 00:39:35,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:35,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095998581] [2019-11-16 00:39:35,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:35,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:39:35,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333423930] [2019-11-16 00:39:35,462 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:39:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:35,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-16 00:39:35,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:35,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660279680] [2019-11-16 00:39:35,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:35,473 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:35,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:35,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:39:35,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:39:35,507 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-16 00:39:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:35,562 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-11-16 00:39:35,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:39:35,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2019-11-16 00:39:35,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:39:35,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2019-11-16 00:39:35,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-16 00:39:35,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-16 00:39:35,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-16 00:39:35,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:35,565 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:39:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-16 00:39:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-16 00:39:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:39:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-16 00:39:35,567 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-16 00:39:35,567 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-16 00:39:35,567 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:39:35,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-16 00:39:35,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:39:35,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:35,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:35,569 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:35,569 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:35,569 INFO L791 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 208#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 198#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 199#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 202#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 200#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 201#L549-3 assume !(main_~i~1 < main_~Alen~0); 203#L549-4 main_~i~2 := 0; 204#L554-3 [2019-11-16 00:39:35,570 INFO L793 eck$LassoCheckResult]: Loop: 204#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 211#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 204#L554-3 [2019-11-16 00:39:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2019-11-16 00:39:35,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:35,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657508347] [2019-11-16 00:39:35,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:35,607 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2019-11-16 00:39:35,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:35,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209689147] [2019-11-16 00:39:35,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:35,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:35,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2019-11-16 00:39:35,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:35,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200879927] [2019-11-16 00:39:35,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:35,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:35,697 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:36,101 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2019-11-16 00:39:36,257 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-16 00:39:36,265 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:39:36,265 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:39:36,265 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:39:36,265 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:39:36,265 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:39:36,265 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:36,265 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:39:36,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:39:36,266 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2019-11-16 00:39:36,266 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:39:36,266 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:39:36,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,572 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-11-16 00:39:36,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:36,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:37,222 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-16 00:39:37,277 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:39:37,277 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:39:37,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:37,278 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:37,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:37,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:37,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:37,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:37,279 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:37,279 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:37,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:37,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:37,280 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:37,280 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:37,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:37,281 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:37,281 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:37,281 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:37,281 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:37,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:37,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:37,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:37,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:37,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:37,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:37,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:37,283 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:37,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:37,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:37,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:37,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:37,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:37,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:37,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:37,285 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:37,285 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:37,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:37,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:37,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:37,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:37,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:37,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:37,290 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:37,290 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:37,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:37,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:37,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:37,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:37,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:37,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:37,294 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:37,294 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:37,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:37,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:37,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:37,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:37,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:37,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:37,305 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:37,305 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:37,348 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:39:37,373 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:39:37,374 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:39:37,374 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:39:37,375 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:39:37,375 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:39:37,376 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, ULTIMATE.start_main_~Blen~0) = -1*ULTIMATE.start_main_~i~2 + 1*ULTIMATE.start_main_~Blen~0 Supporting invariants [] [2019-11-16 00:39:37,410 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-11-16 00:39:37,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:37,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:39:37,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:37,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:39:37,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:37,465 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:39:37,465 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:39:37,482 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 25 states and 39 transitions. Complement of second has 6 states. [2019-11-16 00:39:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:39:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:39:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-16 00:39:37,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:39:37,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:37,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:39:37,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:37,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-16 00:39:37,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:37,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2019-11-16 00:39:37,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:39:37,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-11-16 00:39:37,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:39:37,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:39:37,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-16 00:39:37,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:37,490 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-16 00:39:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-16 00:39:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-16 00:39:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:39:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-16 00:39:37,493 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-16 00:39:37,494 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-16 00:39:37,494 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:39:37,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-16 00:39:37,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:39:37,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:37,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:37,497 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:37,497 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:39:37,497 INFO L791 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 361#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 362#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 352#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 353#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 356#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 354#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 355#L549-3 assume !(main_~i~1 < main_~Alen~0); 357#L549-4 main_~i~2 := 0; 358#L554-3 assume !(main_~i~2 < main_~Blen~0); 368#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 369#L519-2 [2019-11-16 00:39:37,498 INFO L793 eck$LassoCheckResult]: Loop: 369#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 360#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 363#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 367#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 369#L519-2 [2019-11-16 00:39:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-16 00:39:37,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:37,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657143073] [2019-11-16 00:39:37,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:39:37,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657143073] [2019-11-16 00:39:37,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:37,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:39:37,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536142167] [2019-11-16 00:39:37,556 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:39:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:37,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2019-11-16 00:39:37,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:37,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718579037] [2019-11-16 00:39:37,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:37,564 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:37,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:39:37,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:39:37,717 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-16 00:39:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:37,747 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-16 00:39:37,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:39:37,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-16 00:39:37,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:39:37,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-11-16 00:39:37,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-16 00:39:37,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:39:37,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-16 00:39:37,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:37,751 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-16 00:39:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-16 00:39:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-16 00:39:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:39:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-16 00:39:37,752 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:39:37,753 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:39:37,753 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:39:37,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-16 00:39:37,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:39:37,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:37,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:37,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:37,754 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:39:37,754 INFO L791 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 405#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 406#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 396#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 397#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 400#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 398#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 399#L549-3 assume !(main_~i~1 < main_~Alen~0); 401#L549-4 main_~i~2 := 0; 402#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 409#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 410#L554-3 assume !(main_~i~2 < main_~Blen~0); 412#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 413#L519-2 [2019-11-16 00:39:37,754 INFO L793 eck$LassoCheckResult]: Loop: 413#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 404#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 407#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 411#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 413#L519-2 [2019-11-16 00:39:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-16 00:39:37,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:37,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654927580] [2019-11-16 00:39:37,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:37,815 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:37,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:37,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2019-11-16 00:39:37,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:37,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162566224] [2019-11-16 00:39:37,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:37,828 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2019-11-16 00:39:37,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:37,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003359488] [2019-11-16 00:39:37,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:37,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:39:37,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003359488] [2019-11-16 00:39:37,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:37,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:39:37,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622041641] [2019-11-16 00:39:38,028 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-16 00:39:38,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:38,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:39:38,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:39:38,071 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-16 00:39:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:38,133 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2019-11-16 00:39:38,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:39:38,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2019-11-16 00:39:38,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:39:38,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2019-11-16 00:39:38,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-16 00:39:38,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-16 00:39:38,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-11-16 00:39:38,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:38,137 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-16 00:39:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-11-16 00:39:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-16 00:39:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:39:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-16 00:39:38,140 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-16 00:39:38,140 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-16 00:39:38,140 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:39:38,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-16 00:39:38,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:39:38,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:38,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:38,142 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:38,142 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:39:38,142 INFO L791 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 457#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 458#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 448#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 449#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 452#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 450#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 451#L549-3 assume !(main_~i~1 < main_~Alen~0); 453#L549-4 main_~i~2 := 0; 454#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 461#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 462#L554-3 assume !(main_~i~2 < main_~Blen~0); 465#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 466#L519-2 [2019-11-16 00:39:38,142 INFO L793 eck$LassoCheckResult]: Loop: 466#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 459#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 455#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 456#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 463#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 464#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 466#L519-2 [2019-11-16 00:39:38,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:38,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2019-11-16 00:39:38,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:38,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057905229] [2019-11-16 00:39:38,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:38,179 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:38,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2019-11-16 00:39:38,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:38,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282552169] [2019-11-16 00:39:38,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:38,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282552169] [2019-11-16 00:39:38,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:38,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:39:38,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566293922] [2019-11-16 00:39:38,198 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:39:38,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:38,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:39:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:39:38,199 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-16 00:39:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:38,233 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-11-16 00:39:38,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:39:38,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-16 00:39:38,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-16 00:39:38,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2019-11-16 00:39:38,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-16 00:39:38,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-16 00:39:38,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-11-16 00:39:38,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:39:38,236 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-16 00:39:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-11-16 00:39:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-11-16 00:39:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:39:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-16 00:39:38,238 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-16 00:39:38,238 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-16 00:39:38,238 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:39:38,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-16 00:39:38,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:39:38,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:38,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:38,240 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:38,240 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:39:38,240 INFO L791 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 510#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 499#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 500#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 503#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 501#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 502#L549-3 assume !(main_~i~1 < main_~Alen~0); 504#L549-4 main_~i~2 := 0; 505#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 513#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 514#L554-3 assume !(main_~i~2 < main_~Blen~0); 516#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 517#L519-2 [2019-11-16 00:39:38,243 INFO L793 eck$LassoCheckResult]: Loop: 517#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 518#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 506#L523 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem3;havoc diff_#t~mem2;diff_~found~0 := 1; 507#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 511#L522-2 assume !(0 == diff_~found~0); 515#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 517#L519-2 [2019-11-16 00:39:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:38,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2019-11-16 00:39:38,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:38,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269699247] [2019-11-16 00:39:38,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:38,290 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2019-11-16 00:39:38,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:38,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028011339] [2019-11-16 00:39:38,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:38,304 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2019-11-16 00:39:38,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:38,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500228280] [2019-11-16 00:39:38,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:38,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:38,358 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:38,461 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-16 00:39:39,046 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 143 [2019-11-16 00:39:39,283 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-11-16 00:39:39,285 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:39:39,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:39:39,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:39:39,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:39:39,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:39:39,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:39,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:39:39,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:39:39,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2019-11-16 00:39:39,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:39:39,286 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:39:39,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,767 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-16 00:39:39,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:39,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:40,176 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-16 00:39:40,467 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-16 00:39:41,326 WARN L191 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-16 00:39:41,383 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:39:41,384 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:39:41,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:41,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:41,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:41,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:41,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:41,385 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:41,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:41,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:41,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:41,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:41,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:41,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:41,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:41,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:41,389 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:41,389 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:41,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:41,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:41,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:41,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:41,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:41,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:41,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:41,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:41,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:41,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:41,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:41,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:41,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:41,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:41,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:41,399 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:41,399 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:41,446 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:39:41,490 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:39:41,490 INFO L444 ModelExtractionUtils]: 68 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:39:41,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:39:41,491 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:39:41,491 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:39:41,491 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, v_rep(select #length ULTIMATE.start_diff_~A.base)_1, ULTIMATE.start_diff_~A.offset) = -4*ULTIMATE.start_diff_~i~0 + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 - 1*ULTIMATE.start_diff_~A.offset Supporting invariants [] [2019-11-16 00:39:41,564 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2019-11-16 00:39:41,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:39:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:41,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:39:41,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:41,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:39:41,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:41,628 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:39:41,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-16 00:39:41,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2019-11-16 00:39:41,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:39:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:39:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-11-16 00:39:41,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-16 00:39:41,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:41,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-16 00:39:41,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:41,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 12 letters. [2019-11-16 00:39:41,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:41,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2019-11-16 00:39:41,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:39:41,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2019-11-16 00:39:41,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:39:41,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:39:41,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-16 00:39:41,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:39:41,649 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-16 00:39:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-16 00:39:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-16 00:39:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:39:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-16 00:39:41,652 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-16 00:39:41,652 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-16 00:39:41,652 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:39:41,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-16 00:39:41,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:39:41,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:41,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:41,654 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:41,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:41,654 INFO L791 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 725#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 726#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 713#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 714#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 717#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 715#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 716#L549-3 assume !(main_~i~1 < main_~Alen~0); 718#L549-4 main_~i~2 := 0; 719#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 731#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 732#L554-3 assume !(main_~i~2 < main_~Blen~0); 733#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 734#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 721#L523-2 [2019-11-16 00:39:41,654 INFO L793 eck$LassoCheckResult]: Loop: 721#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 720#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 721#L523-2 [2019-11-16 00:39:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:41,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217434, now seen corresponding path program 1 times [2019-11-16 00:39:41,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:41,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775220445] [2019-11-16 00:39:41,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:41,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:41,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:41,675 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:41,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:41,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 1 times [2019-11-16 00:39:41,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:41,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481540288] [2019-11-16 00:39:41,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:41,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:41,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:41,682 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -718428993, now seen corresponding path program 1 times [2019-11-16 00:39:41,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:41,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565991747] [2019-11-16 00:39:41,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:41,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:41,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:41,707 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:42,322 WARN L191 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 153 [2019-11-16 00:39:42,561 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-11-16 00:39:42,563 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:39:42,563 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:39:42,563 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:39:42,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:39:42,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:39:42,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:42,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:39:42,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:39:42,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration8_Lasso [2019-11-16 00:39:42,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:39:42,564 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:39:42,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:42,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:43,164 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 126 [2019-11-16 00:39:43,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:43,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:43,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:43,707 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-11-16 00:39:44,571 WARN L191 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-16 00:39:44,734 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-16 00:39:44,799 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:39:44,799 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:39:44,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,806 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,806 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,815 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,815 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,827 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,828 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,829 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,832 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,832 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,834 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,834 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,834 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,837 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,838 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,845 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,846 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,846 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,850 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,850 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,854 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,856 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,858 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,859 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,859 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,859 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,859 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,860 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,860 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,862 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,862 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,862 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,862 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,866 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,866 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,869 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,870 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,873 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,873 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:39:44,879 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,880 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,880 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:39:44,880 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:39:44,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,882 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-16 00:39:44,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,889 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-16 00:39:44,889 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,919 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,919 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:44,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,921 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:39:44,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,923 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:39:44,923 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:39:44,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:39:44,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:39:44,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:39:44,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:39:44,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:39:44,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:39:44,954 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:39:44,954 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:39:45,052 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:39:45,176 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:39:45,176 INFO L444 ModelExtractionUtils]: 77 out of 82 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:39:45,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:39:45,178 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:39:45,178 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:39:45,178 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~j~0, ULTIMATE.start_diff_~l2~0) = -1*ULTIMATE.start_diff_~j~0 + 1*ULTIMATE.start_diff_~l2~0 Supporting invariants [] [2019-11-16 00:39:45,309 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2019-11-16 00:39:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:45,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:39:45,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:45,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:39:45,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:45,399 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:39:45,399 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-16 00:39:45,416 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 46 states and 63 transitions. Complement of second has 7 states. [2019-11-16 00:39:45,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:39:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:39:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-11-16 00:39:45,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-16 00:39:45,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:45,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-16 00:39:45,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:45,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-16 00:39:45,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:39:45,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-16 00:39:45,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:39:45,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 49 transitions. [2019-11-16 00:39:45,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:39:45,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:39:45,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2019-11-16 00:39:45,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:39:45,420 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-11-16 00:39:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2019-11-16 00:39:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-11-16 00:39:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:39:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-16 00:39:45,422 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-16 00:39:45,422 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-16 00:39:45,422 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:39:45,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-11-16 00:39:45,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:39:45,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:45,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:45,424 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:45,424 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:45,424 INFO L791 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 982#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 983#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 971#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 972#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 975#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 973#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 974#L549-3 assume !(main_~i~1 < main_~Alen~0); 976#L549-4 main_~i~2 := 0; 977#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 988#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 989#L554-3 assume !(main_~i~2 < main_~Blen~0); 990#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 991#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 993#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 980#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 981#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 996#L522-2 assume !(0 == diff_~found~0); 987#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 992#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 979#L523-2 [2019-11-16 00:39:45,424 INFO L793 eck$LassoCheckResult]: Loop: 979#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 978#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 979#L523-2 [2019-11-16 00:39:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2007293386, now seen corresponding path program 1 times [2019-11-16 00:39:45,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:45,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541600155] [2019-11-16 00:39:45,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:45,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:45,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:39:45,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541600155] [2019-11-16 00:39:45,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:45,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:39:45,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431164635] [2019-11-16 00:39:45,453 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:39:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 2 times [2019-11-16 00:39:45,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:45,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513631240] [2019-11-16 00:39:45,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:45,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:45,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:45,460 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:45,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:45,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:45,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:45,524 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-16 00:39:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:45,536 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2019-11-16 00:39:45,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:45,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2019-11-16 00:39:45,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:39:45,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2019-11-16 00:39:45,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:39:45,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:39:45,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-11-16 00:39:45,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:39:45,540 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-11-16 00:39:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-11-16 00:39:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-16 00:39:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:39:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-16 00:39:45,542 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-16 00:39:45,542 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-16 00:39:45,542 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:39:45,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2019-11-16 00:39:45,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:39:45,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:45,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:45,544 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:45,544 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:45,544 INFO L791 eck$LassoCheckResult]: Stem: 1050#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1046#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1047#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1035#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1036#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1039#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1037#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1038#L549-3 assume !(main_~i~1 < main_~Alen~0); 1040#L549-4 main_~i~2 := 0; 1041#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1053#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1054#L554-3 assume !(main_~i~2 < main_~Blen~0); 1055#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1056#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1058#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1044#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1045#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1060#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 1052#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1057#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1043#L523-2 [2019-11-16 00:39:45,544 INFO L793 eck$LassoCheckResult]: Loop: 1043#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1042#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1043#L523-2 [2019-11-16 00:39:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:45,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2007295308, now seen corresponding path program 1 times [2019-11-16 00:39:45,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:45,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114027380] [2019-11-16 00:39:45,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:45,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:45,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:39:45,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114027380] [2019-11-16 00:39:45,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406358487] [2019-11-16 00:39:45,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af6cbb51-1091-4c48-8419-8bd6b765ce72/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:39:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:45,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:39:45,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:39:45,812 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:39:45,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-16 00:39:45,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378544951] [2019-11-16 00:39:45,812 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:39:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:45,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 3 times [2019-11-16 00:39:45,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:45,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124941391] [2019-11-16 00:39:45,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:45,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:45,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:45,819 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:45,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:39:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:39:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:39:45,881 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 15 Second operand 14 states. [2019-11-16 00:39:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:46,007 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-11-16 00:39:46,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:39:46,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 67 transitions. [2019-11-16 00:39:46,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:39:46,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 40 transitions. [2019-11-16 00:39:46,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:39:46,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-16 00:39:46,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-16 00:39:46,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:39:46,010 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-16 00:39:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-16 00:39:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-16 00:39:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-16 00:39:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-16 00:39:46,012 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-16 00:39:46,012 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-16 00:39:46,012 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:39:46,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-11-16 00:39:46,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:39:46,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:39:46,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:39:46,014 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:46,014 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:39:46,014 INFO L791 eck$LassoCheckResult]: Stem: 1212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1208#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~i~1, main_#t~nondet16, main_#t~post15, main_~i~2, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 1209#L539 assume !(main_~Alen~0 < 1 || main_~Alen~0 >= 536870911); 1196#L539-2 assume !(main_~Blen~0 < 1 || main_~Blen~0 >= 536870911); 1197#L542-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~i~1 := 0; 1200#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1198#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1199#L549-3 assume !!(main_~i~1 < main_~Alen~0);call write~int(main_#t~nondet14, main_~A~0.base, main_~A~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet14; 1201#L549-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1221#L549-3 assume !(main_~i~1 < main_~Alen~0); 1202#L549-4 main_~i~2 := 0; 1203#L554-3 assume !!(main_~i~2 < main_~Blen~0);call write~int(main_#t~nondet16, main_~B~0.base, main_~B~0.offset + 4 * main_~i~2, 4);havoc main_#t~nondet16; 1213#L554-2 main_#t~post15 := main_~i~2;main_~i~2 := 1 + main_#t~post15;havoc main_#t~post15; 1214#L554-3 assume !(main_~i~2 < main_~Blen~0); 1217#L554-4 diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 1218#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1220#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1206#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1207#L523-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 1222#L522-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 1216#L529-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 1219#L519-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 1205#L523-2 [2019-11-16 00:39:46,014 INFO L793 eck$LassoCheckResult]: Loop: 1205#L523-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 1204#L523 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem3;havoc diff_#t~mem2;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 1205#L523-2 [2019-11-16 00:39:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash 633938194, now seen corresponding path program 2 times [2019-11-16 00:39:46,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:46,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473663148] [2019-11-16 00:39:46,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:46,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:46,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:46,045 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2918, now seen corresponding path program 4 times [2019-11-16 00:39:46,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:46,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429863562] [2019-11-16 00:39:46,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:46,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:46,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:46,051 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash -670749641, now seen corresponding path program 3 times [2019-11-16 00:39:46,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:39:46,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799491928] [2019-11-16 00:39:46,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:46,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:39:46,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:39:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:39:46,089 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:39:47,170 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 252 DAG size of output: 201 [2019-11-16 00:39:47,519 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-11-16 00:39:47,522 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:39:47,522 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:39:47,522 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:39:47,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:39:47,522 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:39:47,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:39:47,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:39:47,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:39:47,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration11_Lasso [2019-11-16 00:39:47,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:39:47,523 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:39:47,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:39:47,769 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:39:47,771 INFO L168 Benchmark]: Toolchain (without parser) took 16150.92 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.9 MB). Free memory was 944.7 MB in the beginning and 959.6 MB in the end (delta: -14.8 MB). Peak memory consumption was 382.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:47,772 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:39:47,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:47,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:39:47,773 INFO L168 Benchmark]: Boogie Preprocessor took 30.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:39:47,773 INFO L168 Benchmark]: RCFGBuilder took 425.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:47,775 INFO L168 Benchmark]: BuchiAutomizer took 15114.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 126.7 MB). Peak memory consumption was 384.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:39:47,777 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 535.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 425.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15114.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 126.7 MB). Peak memory consumption was 384.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...