./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:12:40,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:12:40,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:12:40,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:12:40,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:12:40,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:12:40,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:12:40,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:12:40,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:12:40,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:12:40,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:12:40,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:12:40,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:12:40,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:12:40,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:12:40,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:12:40,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:12:40,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:12:40,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:12:40,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:12:40,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:12:40,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:12:40,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:12:40,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:12:40,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:12:40,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:12:40,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:12:40,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:12:40,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:12:40,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:12:40,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:12:40,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:12:40,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:12:40,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:12:40,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:12:40,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:12:40,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:12:40,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:12:40,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:12:40,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:12:40,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:12:40,541 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:12:40,555 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:12:40,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:12:40,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:12:40,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:12:40,557 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:12:40,557 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:12:40,557 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:12:40,558 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:12:40,558 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:12:40,558 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:12:40,558 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:12:40,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:12:40,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:12:40,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:12:40,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:12:40,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:12:40,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:12:40,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:12:40,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:12:40,560 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:12:40,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:12:40,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:12:40,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:12:40,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:12:40,562 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:12:40,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:12:40,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:12:40,562 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:12:40,563 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:12:40,564 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_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be [2019-11-15 23:12:40,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:12:40,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:12:40,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:12:40,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:12:40,603 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:12:40,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Urban-alloca.i [2019-11-15 23:12:40,655 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/data/0de41e057/a45bdd67f25f4dce83e3bc77ae783e68/FLAG7049cbcc6 [2019-11-15 23:12:41,107 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:12:41,107 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/sv-benchmarks/c/termination-memory-alloca/Urban-alloca.i [2019-11-15 23:12:41,119 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/data/0de41e057/a45bdd67f25f4dce83e3bc77ae783e68/FLAG7049cbcc6 [2019-11-15 23:12:41,132 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/data/0de41e057/a45bdd67f25f4dce83e3bc77ae783e68 [2019-11-15 23:12:41,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:12:41,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:12:41,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:41,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:12:41,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:12:41,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544e8593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41, skipping insertion in model container [2019-11-15 23:12:41,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,159 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:12:41,212 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:12:41,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:41,582 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:12:41,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:12:41,662 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:12:41,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41 WrapperNode [2019-11-15 23:12:41,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:12:41,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:41,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:12:41,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:12:41,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:12:41,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:12:41,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:12:41,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:12:41,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... [2019-11-15 23:12:41,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:12:41,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:12:41,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:12:41,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:12:41,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/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-15 23:12:41,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:12:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:12:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:12:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:12:41,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:12:41,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:12:42,043 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:12:42,043 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:12:42,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:42 BoogieIcfgContainer [2019-11-15 23:12:42,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:12:42,045 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:12:42,045 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:12:42,048 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:12:42,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:12:42,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:12:41" (1/3) ... [2019-11-15 23:12:42,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@131e8769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:12:42, skipping insertion in model container [2019-11-15 23:12:42,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:12:42,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:12:41" (2/3) ... [2019-11-15 23:12:42,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@131e8769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:12:42, skipping insertion in model container [2019-11-15 23:12:42,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:12:42,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:42" (3/3) ... [2019-11-15 23:12:42,053 INFO L371 chiAutomizerObserver]: Analyzing ICFG Urban-alloca.i [2019-11-15 23:12:42,091 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:12:42,092 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:12:42,092 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:12:42,093 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:12:42,093 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:12:42,093 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:12:42,093 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:12:42,093 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:12:42,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:12:42,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:12:42,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:42,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:42,126 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:12:42,126 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:42,126 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:12:42,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:12:42,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:12:42,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:42,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:42,128 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:12:42,128 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:42,133 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L559-2true [2019-11-15 23:12:42,134 INFO L793 eck$LassoCheckResult]: Loop: 8#L559-2true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 13#L550-1true assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 6#L550-3true assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L551true assume main_#t~mem7 > 0;havoc main_#t~mem7; 7#L552true assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 8#L559-2true [2019-11-15 23:12:42,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:42,138 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:12:42,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:42,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464327100] [2019-11-15 23:12:42,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:42,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:42,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:42,253 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:42,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:42,254 INFO L82 PathProgramCache]: Analyzing trace with hash 35409681, now seen corresponding path program 1 times [2019-11-15 23:12:42,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:42,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465772493] [2019-11-15 23:12:42,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:42,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:42,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:42,293 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:42,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849167, now seen corresponding path program 1 times [2019-11-15 23:12:42,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:42,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867523095] [2019-11-15 23:12:42,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:42,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:42,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:42,344 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:42,550 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-11-15 23:12:42,751 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:12:42,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:12:42,752 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:12:42,752 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:12:42,752 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:12:42,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:12:42,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:12:42,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:12:42,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca.i_Iteration1_Lasso [2019-11-15 23:12:42,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:12:42,754 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:12:42,785 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-15 23:12:42,791 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-15 23:12:42,795 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-15 23:12:42,981 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-15 23:12:43,083 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-15 23:12:43,086 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-15 23:12:43,089 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-15 23:12:43,092 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-15 23:12:43,096 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-15 23:12:43,098 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-15 23:12:43,102 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-15 23:12:43,106 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-15 23:12:43,109 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-15 23:12:43,111 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-15 23:12:43,114 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-15 23:12:43,117 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-15 23:12:43,119 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-15 23:12:43,121 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-15 23:12:43,125 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-15 23:12:43,656 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:12:43,720 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:12:43,725 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:12:43,727 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-15 23:12:43,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:43,729 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:43,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:43,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:43,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:43,731 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:43,732 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:43,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:43,735 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-15 23:12:43,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:43,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:43,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:43,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:43,738 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:43,739 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:43,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:43,743 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-15 23:12:43,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:43,744 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:43,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:43,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:43,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:43,745 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:43,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:43,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:43,751 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-15 23:12:43,751 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:43,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:43,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:43,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:43,755 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:43,755 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:43,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:43,778 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-15 23:12:43,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:43,780 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:43,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:43,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:43,786 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:43,791 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:43,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:43,851 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-15 23:12:43,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:43,852 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:43,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:43,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:43,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:43,856 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:43,856 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:43,867 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:12:43,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:12:43,898 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:12:43,900 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:12:43,900 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:12:43,900 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:12:43,901 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2019-11-15 23:12:43,928 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:12:43,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:12:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:43,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:12:43,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:44,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:12:44,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:44,058 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-15 23:12:44,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:12:44,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-11-15 23:12:44,253 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 54 states and 72 transitions. Complement of second has 12 states. [2019-11-15 23:12:44,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:12:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:12:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-11-15 23:12:44,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 5 letters. [2019-11-15 23:12:44,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:44,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 7 letters. Loop has 5 letters. [2019-11-15 23:12:44,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:44,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 10 letters. [2019-11-15 23:12:44,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:44,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2019-11-15 23:12:44,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 23:12:44,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 28 states and 43 transitions. [2019-11-15 23:12:44,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 23:12:44,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 23:12:44,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 43 transitions. [2019-11-15 23:12:44,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:44,269 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2019-11-15 23:12:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 43 transitions. [2019-11-15 23:12:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2019-11-15 23:12:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 23:12:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2019-11-15 23:12:44,292 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-11-15 23:12:44,293 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-11-15 23:12:44,293 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:12:44,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2019-11-15 23:12:44,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 23:12:44,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:44,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:44,294 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:12:44,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:44,295 INFO L791 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 173#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 184#L550-1 [2019-11-15 23:12:44,295 INFO L793 eck$LassoCheckResult]: Loop: 184#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 174#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 175#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 179#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 180#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 184#L550-1 [2019-11-15 23:12:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 23:12:44,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:44,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041657388] [2019-11-15 23:12:44,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:44,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:44,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:44,318 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 1 times [2019-11-15 23:12:44,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:44,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599363264] [2019-11-15 23:12:44,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:44,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:44,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:44,347 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash 177749398, now seen corresponding path program 1 times [2019-11-15 23:12:44,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:44,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660950408] [2019-11-15 23:12:44,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:44,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:44,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:44,374 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:44,511 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-15 23:12:44,715 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-11-15 23:12:44,850 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-15 23:12:45,010 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 23:12:45,019 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:12:45,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:12:45,019 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:12:45,019 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:12:45,019 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:12:45,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:12:45,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:12:45,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:12:45,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca.i_Iteration2_Lasso [2019-11-15 23:12:45,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:12:45,020 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:12:45,027 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-15 23:12:45,043 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-15 23:12:45,046 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-15 23:12:45,055 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-15 23:12:45,057 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-15 23:12:45,060 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-15 23:12:45,062 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-15 23:12:45,064 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-15 23:12:45,066 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-15 23:12:45,076 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-15 23:12:45,078 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-15 23:12:45,080 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-15 23:12:45,083 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-15 23:12:45,086 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-15 23:12:45,445 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-15 23:12:45,580 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-11-15 23:12:45,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-15 23:12:45,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-15 23:12:45,584 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-15 23:12:45,910 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:12:46,040 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:12:46,040 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:12:46,041 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-15 23:12:46,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,042 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,044 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-15 23:12:46,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,046 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:46,046 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:46,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,051 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-15 23:12:46,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:46,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:46,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,056 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-15 23:12:46,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,059 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-15 23:12:46,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,061 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:46,062 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:46,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,064 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-15 23:12:46,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,065 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,066 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-15 23:12:46,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,068 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,069 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-15 23:12:46,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,072 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-15 23:12:46,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,073 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,074 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,075 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-15 23:12:46,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,077 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-15 23:12:46,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,080 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-15 23:12:46,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,082 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:46,082 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:46,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,084 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-15 23:12:46,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:46,087 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-15 23:12:46,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:46,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:46,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:46,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:46,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:46,089 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:46,089 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:46,091 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:12:46,093 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:12:46,093 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:12:46,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:12:46,094 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:12:46,094 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:12:46,094 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2019-11-15 23:12:46,150 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:12:46,151 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:12:46,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:46,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:12:46,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:46,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:12:46,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:46,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:46,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-15 23:12:46,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:46,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:46,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:46,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-15 23:12:46,291 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-15 23:12:46,292 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:12:46,292 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 23:12:46,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 43 states and 66 transitions. Complement of second has 9 states. [2019-11-15 23:12:46,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:12:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:12:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 23:12:46,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 5 letters. [2019-11-15 23:12:46,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:46,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-15 23:12:46,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:46,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 10 letters. [2019-11-15 23:12:46,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:46,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 66 transitions. [2019-11-15 23:12:46,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 23:12:46,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 64 transitions. [2019-11-15 23:12:46,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 23:12:46,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 23:12:46,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 64 transitions. [2019-11-15 23:12:46,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:46,349 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 64 transitions. [2019-11-15 23:12:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 64 transitions. [2019-11-15 23:12:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-15 23:12:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:12:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2019-11-15 23:12:46,353 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2019-11-15 23:12:46,353 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2019-11-15 23:12:46,353 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:12:46,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 61 transitions. [2019-11-15 23:12:46,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 23:12:46,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:46,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:46,356 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:12:46,356 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:46,356 INFO L791 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 332#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 333#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 357#L550-1 assume !main_#t~short6; 353#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 347#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 348#L559 [2019-11-15 23:12:46,356 INFO L793 eck$LassoCheckResult]: Loop: 348#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 343#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 344#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 350#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 351#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 348#L559 [2019-11-15 23:12:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:46,357 INFO L82 PathProgramCache]: Analyzing trace with hash 889571379, now seen corresponding path program 1 times [2019-11-15 23:12:46,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:46,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105134007] [2019-11-15 23:12:46,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:46,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-15 23:12:46,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105134007] [2019-11-15 23:12:46,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:46,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:12:46,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652666547] [2019-11-15 23:12:46,402 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:12:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 1 times [2019-11-15 23:12:46,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:46,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280150683] [2019-11-15 23:12:46,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:46,416 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:46,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:46,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:12:46,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:12:46,539 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. cyclomatic complexity: 27 Second operand 3 states. [2019-11-15 23:12:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:46,553 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-11-15 23:12:46,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:12:46,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2019-11-15 23:12:46,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 23:12:46,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 39 states and 50 transitions. [2019-11-15 23:12:46,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 23:12:46,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 23:12:46,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2019-11-15 23:12:46,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:46,560 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-15 23:12:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2019-11-15 23:12:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-15 23:12:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:12:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-11-15 23:12:46,564 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-15 23:12:46,564 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-15 23:12:46,564 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:12:46,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-11-15 23:12:46,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 23:12:46,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:46,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:46,566 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:12:46,566 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:46,566 INFO L791 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 423#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 424#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 434#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 447#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 438#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 439#L559 [2019-11-15 23:12:46,566 INFO L793 eck$LassoCheckResult]: Loop: 439#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 445#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 450#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 425#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 426#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 439#L559 [2019-11-15 23:12:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:46,567 INFO L82 PathProgramCache]: Analyzing trace with hash 889569457, now seen corresponding path program 1 times [2019-11-15 23:12:46,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:46,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154624506] [2019-11-15 23:12:46,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:46,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:46,585 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 2 times [2019-11-15 23:12:46,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:46,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118867562] [2019-11-15 23:12:46,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:46,597 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash -127775619, now seen corresponding path program 1 times [2019-11-15 23:12:46,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:46,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603306500] [2019-11-15 23:12:46,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:46,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:46,620 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:46,914 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-11-15 23:12:46,975 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:12:46,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:12:46,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:12:46,976 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:12:46,976 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:12:46,976 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:12:46,976 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:12:46,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:12:46,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca.i_Iteration4_Lasso [2019-11-15 23:12:46,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:12:46,976 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:12:46,979 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-15 23:12:46,982 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-15 23:12:46,984 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-15 23:12:46,986 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-15 23:12:46,989 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-15 23:12:46,992 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-15 23:12:46,993 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-15 23:12:46,995 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-15 23:12:46,998 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-15 23:12:47,007 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-15 23:12:47,202 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-15 23:12:47,204 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-15 23:12:47,205 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-15 23:12:47,208 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-15 23:12:47,209 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-15 23:12:47,211 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-15 23:12:47,213 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-15 23:12:47,215 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-15 23:12:47,216 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-15 23:12:47,218 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-15 23:12:47,580 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:12:47,633 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:12:47,633 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:12:47,633 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-15 23:12:47,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:47,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:47,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:47,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,636 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-15 23:12:47,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,637 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:47,637 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:47,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,639 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-15 23:12:47,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:47,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:47,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:47,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,641 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-15 23:12:47,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,643 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:47,643 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:47,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,645 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-15 23:12:47,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:47,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:47,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:47,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,649 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-15 23:12:47,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:47,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:47,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:47,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,652 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-15 23:12:47,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:47,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:47,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:47,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,654 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-15 23:12:47,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:47,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:47,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,658 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-15 23:12:47,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,660 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:47,661 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:47,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,663 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-15 23:12:47,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,663 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:47,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:47,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,670 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-15 23:12:47,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,672 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:47,672 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:47,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,678 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-15 23:12:47,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,681 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:47,681 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:47,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:47,687 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-15 23:12:47,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:47,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:47,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:47,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:47,689 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:47,689 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:47,698 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:12:47,704 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:12:47,705 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:12:47,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:12:47,707 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:12:47,707 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:12:47,707 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2019-11-15 23:12:47,762 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:12:47,765 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:12:47,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:47,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:12:47,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:47,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:12:47,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:47,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:12:47,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:47,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:47,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:47,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2019-11-15 23:12:47,822 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-15 23:12:47,822 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:12:47,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-15 23:12:47,896 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 65 states and 85 transitions. Complement of second has 9 states. [2019-11-15 23:12:47,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:12:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:12:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-11-15 23:12:47,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 5 letters. [2019-11-15 23:12:47,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:47,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 23:12:47,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:47,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 10 letters. [2019-11-15 23:12:47,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:47,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 85 transitions. [2019-11-15 23:12:47,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2019-11-15 23:12:47,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 84 transitions. [2019-11-15 23:12:47,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 23:12:47,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-15 23:12:47,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 84 transitions. [2019-11-15 23:12:47,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:47,901 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 84 transitions. [2019-11-15 23:12:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 84 transitions. [2019-11-15 23:12:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-15 23:12:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 23:12:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2019-11-15 23:12:47,907 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-11-15 23:12:47,907 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-11-15 23:12:47,907 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:12:47,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 80 transitions. [2019-11-15 23:12:47,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2019-11-15 23:12:47,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:47,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:47,909 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:47,909 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2019-11-15 23:12:47,909 INFO L791 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 632#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 633#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 643#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 671#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 664#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 660#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 661#L559-2 [2019-11-15 23:12:47,909 INFO L793 eck$LassoCheckResult]: Loop: 661#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 672#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 635#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 636#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 647#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 676#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 648#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 649#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 666#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 667#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 661#L559-2 [2019-11-15 23:12:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:47,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 2 times [2019-11-15 23:12:47,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:47,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23138306] [2019-11-15 23:12:47,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:47,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:47,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:47,926 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:47,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash -552559553, now seen corresponding path program 1 times [2019-11-15 23:12:47,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:47,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917428253] [2019-11-15 23:12:47,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:47,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:47,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:48,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917428253] [2019-11-15 23:12:48,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:12:48,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:12:48,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684258156] [2019-11-15 23:12:48,051 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:12:48,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:48,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:12:48,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:12:48,052 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-11-15 23:12:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:48,146 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-11-15 23:12:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:12:48,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 100 transitions. [2019-11-15 23:12:48,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-11-15 23:12:48,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 67 states and 83 transitions. [2019-11-15 23:12:48,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-15 23:12:48,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 23:12:48,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 83 transitions. [2019-11-15 23:12:48,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:48,150 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-11-15 23:12:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 83 transitions. [2019-11-15 23:12:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2019-11-15 23:12:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 23:12:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2019-11-15 23:12:48,153 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-11-15 23:12:48,154 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-11-15 23:12:48,154 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:12:48,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2019-11-15 23:12:48,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-11-15 23:12:48,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:48,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:48,155 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:48,155 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:48,155 INFO L791 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 789#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 790#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 824#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 823#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 816#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 814#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 800#L559-2 [2019-11-15 23:12:48,155 INFO L793 eck$LassoCheckResult]: Loop: 800#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 801#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 791#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 792#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 804#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 800#L559-2 [2019-11-15 23:12:48,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:48,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 3 times [2019-11-15 23:12:48,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:48,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863558205] [2019-11-15 23:12:48,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,190 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash 35409683, now seen corresponding path program 2 times [2019-11-15 23:12:48,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:48,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105703873] [2019-11-15 23:12:48,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,210 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash 333922885, now seen corresponding path program 1 times [2019-11-15 23:12:48,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:48,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8224937] [2019-11-15 23:12:48,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:48,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8224937] [2019-11-15 23:12:48,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177435619] [2019-11-15 23:12:48,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/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-15 23:12:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:48,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:12:48,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:48,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:12:48,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:48,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:48,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:48,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:7 [2019-11-15 23:12:48,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:12:48,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:48,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:48,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:48,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 23:12:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:48,421 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:48,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-15 23:12:48,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156969137] [2019-11-15 23:12:48,524 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-11-15 23:12:48,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:48,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:12:48,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:12:48,549 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 18 Second operand 10 states. [2019-11-15 23:12:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:48,635 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2019-11-15 23:12:48,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:12:48,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2019-11-15 23:12:48,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-15 23:12:48,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 61 transitions. [2019-11-15 23:12:48,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 23:12:48,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 23:12:48,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2019-11-15 23:12:48,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:48,637 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-11-15 23:12:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2019-11-15 23:12:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-15 23:12:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 23:12:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2019-11-15 23:12:48,640 INFO L711 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-11-15 23:12:48,641 INFO L591 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-11-15 23:12:48,641 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:12:48,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 61 transitions. [2019-11-15 23:12:48,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-15 23:12:48,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:48,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:48,642 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:48,642 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:48,642 INFO L791 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 941#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 942#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 959#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 960#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 956#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 957#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 964#L559-2 [2019-11-15 23:12:48,642 INFO L793 eck$LassoCheckResult]: Loop: 964#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 977#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 974#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 971#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 962#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 964#L559-2 [2019-11-15 23:12:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:48,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849425, now seen corresponding path program 1 times [2019-11-15 23:12:48,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:48,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162930725] [2019-11-15 23:12:48,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,659 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash 35409939, now seen corresponding path program 1 times [2019-11-15 23:12:48,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:48,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703288001] [2019-11-15 23:12:48,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,671 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:48,672 INFO L82 PathProgramCache]: Analyzing trace with hash 391181443, now seen corresponding path program 2 times [2019-11-15 23:12:48,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:48,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704338192] [2019-11-15 23:12:48,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:48,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:48,694 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:48,802 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 23:12:49,032 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-11-15 23:12:49,099 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:12:49,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:12:49,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:12:49,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:12:49,099 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:12:49,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:12:49,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:12:49,099 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:12:49,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca.i_Iteration7_Lasso [2019-11-15 23:12:49,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:12:49,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:12:49,101 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-15 23:12:49,103 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-15 23:12:49,106 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-15 23:12:49,113 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-15 23:12:49,114 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-15 23:12:49,119 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-15 23:12:49,120 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-15 23:12:49,122 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-15 23:12:49,123 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-15 23:12:49,127 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-15 23:12:49,129 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-15 23:12:49,131 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-15 23:12:49,133 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-15 23:12:49,135 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-15 23:12:49,325 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-15 23:12:49,326 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-15 23:12:49,328 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-15 23:12:49,330 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-15 23:12:49,707 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:12:49,746 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:12:49,746 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:12:49,746 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-15 23:12:49,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,747 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:49,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,748 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:49,748 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:49,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,749 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-15 23:12:49,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,750 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:49,750 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,751 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-15 23:12:49,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:49,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:49,753 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:49,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,754 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-15 23:12:49,754 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,754 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:49,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,755 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:49,755 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:49,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,756 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-15 23:12:49,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,756 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:49,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,757 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:49,757 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:49,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,758 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-15 23:12:49,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:49,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,759 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:49,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:49,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:12:49,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,761 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,762 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:49,762 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:12:49,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,764 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:49,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:49,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:49,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,766 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-15 23:12:49,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:49,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:49,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:49,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,768 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-15 23:12:49,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,769 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:49,770 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,772 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-15 23:12:49,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,773 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:49,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,773 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:49,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:49,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,774 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-15 23:12:49,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,776 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:49,776 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,777 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-15 23:12:49,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:49,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,779 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:49,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:49,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,780 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-15 23:12:49,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,782 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:49,783 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,792 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-15 23:12:49,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,794 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:49,794 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,798 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-15 23:12:49,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,799 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:12:49,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,801 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:12:49,801 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,810 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-15 23:12:49,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,812 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:49,812 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,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-15 23:12:49,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,817 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:49,818 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:49,819 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-15 23:12:49,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:49,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:49,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:49,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:49,821 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:49,821 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:49,825 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:12:49,828 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:12:49,828 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:12:49,828 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:12:49,829 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:12:49,829 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:12:49,829 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2019-11-15 23:12:49,861 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:12:49,866 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:12:49,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:49,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:12:49,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:49,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:12:49,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:49,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:49,973 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-15 23:12:49,973 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:12:49,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 16 Second operand 6 states. [2019-11-15 23:12:50,046 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 16. Second operand 6 states. Result 78 states and 95 transitions. Complement of second has 11 states. [2019-11-15 23:12:50,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-15 23:12:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:12:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 23:12:50,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 5 letters. [2019-11-15 23:12:50,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:50,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2019-11-15 23:12:50,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:50,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 10 letters. [2019-11-15 23:12:50,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:50,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 95 transitions. [2019-11-15 23:12:50,049 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2019-11-15 23:12:50,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 89 transitions. [2019-11-15 23:12:50,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-15 23:12:50,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-11-15 23:12:50,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 89 transitions. [2019-11-15 23:12:50,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:50,050 INFO L688 BuchiCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-11-15 23:12:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 89 transitions. [2019-11-15 23:12:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2019-11-15 23:12:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-15 23:12:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-11-15 23:12:50,057 INFO L711 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-11-15 23:12:50,057 INFO L591 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-11-15 23:12:50,058 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:12:50,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2019-11-15 23:12:50,058 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2019-11-15 23:12:50,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:50,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:50,059 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 23:12:50,059 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:50,060 INFO L791 eck$LassoCheckResult]: Stem: 1187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1181#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1182#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1224#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1221#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1218#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1216#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 1213#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1214#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1238#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1242#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1207#L552 [2019-11-15 23:12:50,060 INFO L793 eck$LassoCheckResult]: Loop: 1207#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 1239#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1240#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1212#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1208#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1207#L552 [2019-11-15 23:12:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:50,060 INFO L82 PathProgramCache]: Analyzing trace with hash -125928585, now seen corresponding path program 1 times [2019-11-15 23:12:50,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:50,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554731587] [2019-11-15 23:12:50,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:50,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:50,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:50,091 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:50,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:50,092 INFO L82 PathProgramCache]: Analyzing trace with hash 51012381, now seen corresponding path program 2 times [2019-11-15 23:12:50,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:50,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60494571] [2019-11-15 23:12:50,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:50,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:50,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:50,104 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1455202663, now seen corresponding path program 1 times [2019-11-15 23:12:50,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:50,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629035115] [2019-11-15 23:12:50,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:50,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:50,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:50,150 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:50,274 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-11-15 23:12:50,639 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-11-15 23:12:50,698 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:12:50,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:12:50,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:12:50,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:12:50,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:12:50,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:12:50,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:12:50,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:12:50,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca.i_Iteration8_Lasso [2019-11-15 23:12:50,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:12:50,698 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:12:50,700 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-15 23:12:50,703 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-15 23:12:50,897 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-15 23:12:50,899 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-15 23:12:50,901 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-15 23:12:50,903 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-15 23:12:50,904 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-15 23:12:50,905 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-15 23:12:50,907 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-15 23:12:50,908 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-15 23:12:50,910 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-15 23:12:50,912 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-15 23:12:50,913 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-15 23:12:50,915 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-15 23:12:50,917 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-15 23:12:50,918 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-15 23:12:50,920 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-15 23:12:50,921 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-15 23:12:51,243 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:12:51,300 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:12:51,300 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:12:51,300 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-15 23:12:51,301 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:51,301 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:51,301 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:51,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:51,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:51,301 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:51,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:51,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:51,303 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-15 23:12:51,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:51,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:51,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:51,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:51,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:51,304 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:51,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:51,308 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-15 23:12:51,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:51,309 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:51,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:51,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:51,311 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:51,311 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:51,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:51,315 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-15 23:12:51,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:51,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:51,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:51,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:51,317 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:51,318 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:51,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:51,327 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-15 23:12:51,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:51,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:51,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:51,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:51,329 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:51,329 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:51,335 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:12:51,340 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:12:51,340 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:12:51,340 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:12:51,341 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:12:51,341 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:12:51,341 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2019-11-15 23:12:51,401 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:12:51,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:12:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:51,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:12:51,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:51,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:12:51,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:51,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:51,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:51,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2019-11-15 23:12:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:51,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:12:51,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:51,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2019-11-15 23:12:51,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:51,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:51,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:51,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-11-15 23:12:51,526 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-15 23:12:51,526 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:12:51,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-11-15 23:12:51,641 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 169 states and 208 transitions. Complement of second has 10 states. [2019-11-15 23:12:51,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:12:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:12:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-11-15 23:12:51,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 23:12:51,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 5 letters. [2019-11-15 23:12:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:51,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-15 23:12:51,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:51,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 208 transitions. [2019-11-15 23:12:51,650 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 34 [2019-11-15 23:12:51,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 187 transitions. [2019-11-15 23:12:51,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-11-15 23:12:51,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-15 23:12:51,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 187 transitions. [2019-11-15 23:12:51,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:51,653 INFO L688 BuchiCegarLoop]: Abstraction has 149 states and 187 transitions. [2019-11-15 23:12:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 187 transitions. [2019-11-15 23:12:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2019-11-15 23:12:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 23:12:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2019-11-15 23:12:51,663 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2019-11-15 23:12:51,663 INFO L591 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2019-11-15 23:12:51,663 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:12:51,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 157 transitions. [2019-11-15 23:12:51,664 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2019-11-15 23:12:51,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:51,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:51,665 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:51,665 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:51,666 INFO L791 eck$LassoCheckResult]: Stem: 1548#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1542#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1543#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1601#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1604#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1605#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1610#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 1611#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1554#L550-1 [2019-11-15 23:12:51,666 INFO L793 eck$LassoCheckResult]: Loop: 1554#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1544#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1545#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1549#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 1550#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1554#L550-1 [2019-11-15 23:12:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash 177749336, now seen corresponding path program 2 times [2019-11-15 23:12:51,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:51,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062277172] [2019-11-15 23:12:51,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:51,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:51,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:51,681 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:51,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:51,682 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 3 times [2019-11-15 23:12:51,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:51,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819264491] [2019-11-15 23:12:51,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:51,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:51,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:51,691 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2100968094, now seen corresponding path program 1 times [2019-11-15 23:12:51,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:51,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321214190] [2019-11-15 23:12:51,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:51,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:51,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:51,708 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:51,811 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-15 23:12:51,935 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-11-15 23:12:52,152 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-11-15 23:12:52,536 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-11-15 23:12:52,538 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:12:52,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:12:52,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:12:52,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:12:52,539 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:12:52,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:12:52,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:12:52,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:12:52,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca.i_Iteration9_Lasso [2019-11-15 23:12:52,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:12:52,539 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:12:52,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-15 23:12:52,546 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-15 23:12:52,548 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-15 23:12:52,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-15 23:12:52,551 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-15 23:12:52,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-15 23:12:52,555 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-15 23:12:52,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-15 23:12:52,558 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-15 23:12:52,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-15 23:12:52,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-15 23:12:52,862 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-15 23:12:52,956 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-15 23:12:52,958 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-15 23:12:52,959 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-15 23:12:52,960 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-15 23:12:52,962 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-15 23:12:52,964 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-15 23:12:52,966 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-15 23:12:53,268 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:12:53,395 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:12:53,395 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:12:53,395 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-15 23:12:53,396 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,396 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:53,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,396 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:53,396 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:53,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,397 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-15 23:12:53,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,397 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:53,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,398 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:53,398 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:53,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,398 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-15 23:12:53,399 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,399 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:53,400 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:53,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,403 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-15 23:12:53,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,405 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:53,405 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:53,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,406 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-15 23:12:53,407 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,407 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,407 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,407 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,408 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:53,408 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:53,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,409 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-15 23:12:53,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,410 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:53,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,411 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:53,411 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:53,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,412 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-15 23:12:53,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,412 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:53,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,413 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:53,413 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:53,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,414 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-15 23:12:53,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:53,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:53,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:53,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,416 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-15 23:12:53,416 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:53,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,417 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:53,417 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:53,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,418 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-15 23:12:53,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,420 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:53,420 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:53,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,421 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-15 23:12:53,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,422 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:12:53,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,423 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:12:53,423 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:53,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,431 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-15 23:12:53,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,432 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:53,433 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:53,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,436 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-15 23:12:53,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,437 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:12:53,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,438 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:12:53,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:53,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,444 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-15 23:12:53,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,446 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:53,446 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:53,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:53,449 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-15 23:12:53,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:53,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:53,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:53,450 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:53,451 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:53,451 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:53,455 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:12:53,457 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:12:53,457 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:12:53,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:12:53,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:12:53,458 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:12:53,458 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2019-11-15 23:12:53,490 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:12:53,491 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:12:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:53,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:12:53,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:53,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:12:53,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:53,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-15 23:12:53,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:53,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:53,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:53,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-15 23:12:53,591 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-15 23:12:53,591 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:12:53,591 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2019-11-15 23:12:53,636 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 147 states and 182 transitions. Complement of second has 9 states. [2019-11-15 23:12:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:12:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:12:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-15 23:12:53,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-15 23:12:53,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:53,639 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:12:53,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:53,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:12:53,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:53,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:12:53,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:53,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:53,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-15 23:12:53,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:53,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:53,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:53,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-15 23:12:53,757 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-15 23:12:53,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:12:53,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2019-11-15 23:12:53,800 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 145 states and 182 transitions. Complement of second has 9 states. [2019-11-15 23:12:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:12:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:12:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-11-15 23:12:53,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-15 23:12:53,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:53,803 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:12:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:53,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:12:53,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:53,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:12:53,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:53,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:12:53,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-15 23:12:53,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:53,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:53,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:53,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-15 23:12:53,878 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-15 23:12:53,878 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:12:53,878 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2019-11-15 23:12:53,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 214 states and 257 transitions. Complement of second has 8 states. [2019-11-15 23:12:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:12:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:12:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-15 23:12:53,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-15 23:12:53,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:53,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 5 letters. [2019-11-15 23:12:53,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:53,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 10 letters. [2019-11-15 23:12:53,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:53,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 257 transitions. [2019-11-15 23:12:53,914 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2019-11-15 23:12:53,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 157 states and 195 transitions. [2019-11-15 23:12:53,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-15 23:12:53,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-15 23:12:53,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 195 transitions. [2019-11-15 23:12:53,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:53,917 INFO L688 BuchiCegarLoop]: Abstraction has 157 states and 195 transitions. [2019-11-15 23:12:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 195 transitions. [2019-11-15 23:12:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2019-11-15 23:12:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 23:12:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2019-11-15 23:12:53,924 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-11-15 23:12:53,924 INFO L591 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-11-15 23:12:53,924 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:12:53,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 154 transitions. [2019-11-15 23:12:53,925 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-11-15 23:12:53,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:53,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:53,926 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] [2019-11-15 23:12:53,926 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:12:53,926 INFO L791 eck$LassoCheckResult]: Stem: 2393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2387#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2388#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2432#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2433#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2476#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2427#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 2426#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2466#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2465#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2464#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2408#L559 [2019-11-15 23:12:53,926 INFO L793 eck$LassoCheckResult]: Loop: 2408#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 2409#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2500#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2499#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2497#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2408#L559 [2019-11-15 23:12:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:53,927 INFO L82 PathProgramCache]: Analyzing trace with hash -125928577, now seen corresponding path program 3 times [2019-11-15 23:12:53,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:53,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255705832] [2019-11-15 23:12:53,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:53,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:53,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:53,942 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:53,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:53,943 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 3 times [2019-11-15 23:12:53,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:53,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204278463] [2019-11-15 23:12:53,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:53,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:53,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:53,950 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:53,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1691624047, now seen corresponding path program 1 times [2019-11-15 23:12:53,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:53,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431725542] [2019-11-15 23:12:53,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:53,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:53,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:53,967 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:54,339 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2019-11-15 23:12:54,408 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:12:54,408 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:12:54,408 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:12:54,408 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:12:54,408 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:12:54,408 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:12:54,408 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:12:54,408 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:12:54,409 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca.i_Iteration10_Lasso [2019-11-15 23:12:54,409 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:12:54,409 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:12:54,411 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-15 23:12:54,418 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-15 23:12:54,420 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-15 23:12:54,422 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-15 23:12:54,423 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-15 23:12:54,426 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-15 23:12:54,428 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-15 23:12:54,430 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-15 23:12:54,431 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-15 23:12:54,432 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-15 23:12:54,434 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-15 23:12:54,436 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-15 23:12:54,437 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-15 23:12:54,439 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-15 23:12:54,440 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-15 23:12:54,443 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-15 23:12:54,444 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-15 23:12:54,445 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-15 23:12:54,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-15 23:12:55,004 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:12:55,026 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:12:55,027 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:12:55,027 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-15 23:12:55,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,028 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:55,028 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,030 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-15 23:12:55,030 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,030 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,031 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,031 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,032 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-15 23:12:55,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:12:55,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,034 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,034 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,035 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,035 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,035 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-15 23:12:55,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,036 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,037 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:55,037 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,040 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-15 23:12:55,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,041 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,042 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-15 23:12:55,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,044 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:55,044 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,045 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-15 23:12:55,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,047 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,047 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,048 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-15 23:12:55,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,049 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:12:55,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,053 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-15 23:12:55,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,054 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:12:55,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,054 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:12:55,055 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,056 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-15 23:12:55,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,059 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-15 23:12:55,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,060 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:55,060 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,062 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-15 23:12:55,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,064 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-15 23:12:55,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,065 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,066 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,067 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-15 23:12:55,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,068 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,069 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-15 23:12:55,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:12:55,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:12:55,099 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:12:55,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,100 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-15 23:12:55,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,101 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:55,102 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,105 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-15 23:12:55,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,107 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:55,107 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,110 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-15 23:12:55,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,113 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:55,113 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,120 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-15 23:12:55,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,122 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:55,122 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,126 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-15 23:12:55,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,127 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:12:55,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,128 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:12:55,129 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:12:55,136 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-15 23:12:55,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:12:55,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:12:55,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:12:55,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:12:55,138 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:12:55,138 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:12:55,142 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:12:55,148 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:12:55,148 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:12:55,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:12:55,149 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:12:55,150 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:12:55,150 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7 Supporting invariants [] [2019-11-15 23:12:55,191 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:12:55,192 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:12:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:55,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:12:55,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:55,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:12:55,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:55,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:12:55,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:55,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2019-11-15 23:12:55,274 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-15 23:12:55,274 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:12:55,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2019-11-15 23:12:55,323 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 130 states and 164 transitions. Complement of second has 7 states. [2019-11-15 23:12:55,323 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-15 23:12:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:12:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-15 23:12:55,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 23:12:55,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:55,324 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:12:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:55,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:12:55,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:55,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:12:55,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:55,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:12:55,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:55,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2019-11-15 23:12:55,402 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-15 23:12:55,402 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:12:55,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2019-11-15 23:12:55,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 130 states and 164 transitions. Complement of second has 7 states. [2019-11-15 23:12:55,436 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-15 23:12:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:12:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-15 23:12:55,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 23:12:55,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:55,437 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:12:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:55,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:12:55,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:55,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:12:55,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:55,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:12:55,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:55,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2019-11-15 23:12:55,513 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-15 23:12:55,514 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:12:55,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2019-11-15 23:12:55,554 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 159 states and 196 transitions. Complement of second has 6 states. [2019-11-15 23:12:55,555 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-15 23:12:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:12:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 23:12:55,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-15 23:12:55,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:55,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 5 letters. [2019-11-15 23:12:55,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:55,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-15 23:12:55,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:12:55,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 196 transitions. [2019-11-15 23:12:55,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-15 23:12:55,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 129 states and 160 transitions. [2019-11-15 23:12:55,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-15 23:12:55,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-15 23:12:55,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 160 transitions. [2019-11-15 23:12:55,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:12:55,560 INFO L688 BuchiCegarLoop]: Abstraction has 129 states and 160 transitions. [2019-11-15 23:12:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 160 transitions. [2019-11-15 23:12:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2019-11-15 23:12:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 23:12:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2019-11-15 23:12:55,576 INFO L711 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2019-11-15 23:12:55,576 INFO L591 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2019-11-15 23:12:55,577 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:12:55,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 135 transitions. [2019-11-15 23:12:55,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-15 23:12:55,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:12:55,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:12:55,578 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:12:55,578 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2019-11-15 23:12:55,578 INFO L791 eck$LassoCheckResult]: Stem: 3166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3160#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 3161#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3172#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3253#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3252#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3250#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3168#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3245#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3243#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3242#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 3179#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 3180#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3266#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3178#L550-3 [2019-11-15 23:12:55,579 INFO L793 eck$LassoCheckResult]: Loop: 3178#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3192#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3183#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3188#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3186#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3187#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3264#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3169#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 3170#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3177#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3178#L550-3 [2019-11-15 23:12:55,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash -705255448, now seen corresponding path program 2 times [2019-11-15 23:12:55,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:55,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464412328] [2019-11-15 23:12:55,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:55,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:55,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:12:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:55,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464412328] [2019-11-15 23:12:55,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691873143] [2019-11-15 23:12:55,677 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_484e4124-b4a1-4b06-b62f-6b83ca670574/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:12:55,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:12:55,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:12:55,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:12:55,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:12:55,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:12:55,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:55,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-11-15 23:12:55,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2019-11-15 23:12:55,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:12:55,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-11-15 23:12:55,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-15 23:12:55,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,881 INFO L567 ElimStorePlain]: treesize reduction 4, result has 42.9 percent of original size [2019-11-15 23:12:55,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:12:55,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2019-11-15 23:12:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:12:55,893 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:12:55,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2019-11-15 23:12:55,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273140852] [2019-11-15 23:12:55,894 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:12:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:12:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash 757834051, now seen corresponding path program 1 times [2019-11-15 23:12:55,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:12:55,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553250239] [2019-11-15 23:12:55,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:55,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:12:55,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:12:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:12:55,914 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:12:56,139 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-11-15 23:12:56,327 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-11-15 23:12:56,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:12:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:12:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:12:56,328 INFO L87 Difference]: Start difference. First operand 108 states and 135 transitions. cyclomatic complexity: 34 Second operand 13 states. [2019-11-15 23:12:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:12:56,480 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-11-15 23:12:56,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:12:56,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 103 transitions. [2019-11-15 23:12:56,483 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:12:56,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2019-11-15 23:12:56,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:12:56,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:12:56,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:12:56,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:12:56,484 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:12:56,484 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:12:56,484 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:12:56,484 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:12:56,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:12:56,484 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:12:56,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:12:56,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:12:56 BoogieIcfgContainer [2019-11-15 23:12:56,489 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:12:56,489 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:12:56,489 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:12:56,490 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:12:56,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:12:42" (3/4) ... [2019-11-15 23:12:56,493 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:12:56,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:12:56,494 INFO L168 Benchmark]: Toolchain (without parser) took 15354.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -107.6 MB). Peak memory consumption was 194.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:56,495 INFO L168 Benchmark]: CDTParser took 0.24 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-15 23:12:56,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -206.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:56,495 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:56,496 INFO L168 Benchmark]: Boogie Preprocessor took 23.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:56,496 INFO L168 Benchmark]: RCFGBuilder took 323.67 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:56,497 INFO L168 Benchmark]: BuchiAutomizer took 14443.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 76.5 MB). Peak memory consumption was 209.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:12:56,497 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:12:56,499 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.24 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 522.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -206.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.67 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14443.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 76.5 MB). Peak memory consumption was 209.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (4 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.4s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 11.9s. Construction of modules took 0.5s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 125 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 122 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 118 SDtfs, 154 SDslu, 62 SDs, 0 SdLazy, 503 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax107 hnf100 lsp81 ukn67 mio100 lsp33 div100 bol103 ite100 ukn100 eq180 hnf88 smp97 dnf161 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...