./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-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_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/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 4ab4fc7901859c456c176827e7d5fcf9e4988b17 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 22:07:00,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:07:00,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:07:00,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:07:00,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:07:00,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:07:00,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:07:00,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:07:00,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:07:00,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:07:00,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:07:00,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:07:00,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:07:00,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:07:00,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:07:00,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:07:00,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:07:00,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:07:00,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:07:00,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:07:00,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:07:00,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:07:00,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:07:00,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:07:00,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:07:00,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:07:00,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:07:00,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:07:00,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:07:00,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:07:00,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:07:00,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:07:00,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:07:00,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:07:00,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:07:00,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:07:00,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:07:00,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:07:00,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:07:00,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:07:00,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:07:00,475 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:07:00,490 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:07:00,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:07:00,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:07:00,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:07:00,492 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:07:00,492 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:07:00,492 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:07:00,492 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:07:00,493 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:07:00,493 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:07:00,493 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:07:00,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:07:00,494 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:07:00,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:07:00,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:07:00,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:07:00,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:07:00,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:07:00,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:07:00,495 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:07:00,495 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:07:00,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:07:00,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:07:00,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:07:00,496 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:07:00,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:07:00,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:07:00,497 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:07:00,498 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:07:00,498 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_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/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 -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2019-11-15 22:07:00,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:07:00,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:07:00,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:07:00,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:07:00,536 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:07:00,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-11-15 22:07:00,586 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/data/3cd250a7d/6ed3c7bf34fb4b2dbc76810fd3ef7cdf/FLAG1be3d02f1 [2019-11-15 22:07:01,099 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:07:01,111 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-11-15 22:07:01,127 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/data/3cd250a7d/6ed3c7bf34fb4b2dbc76810fd3ef7cdf/FLAG1be3d02f1 [2019-11-15 22:07:01,555 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/bin/uautomizer/data/3cd250a7d/6ed3c7bf34fb4b2dbc76810fd3ef7cdf [2019-11-15 22:07:01,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:07:01,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:07:01,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:07:01,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:07:01,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:07:01,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:07:01" (1/1) ... [2019-11-15 22:07:01,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf580bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:01, skipping insertion in model container [2019-11-15 22:07:01,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:07:01" (1/1) ... [2019-11-15 22:07:01,572 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:07:01,604 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:07:01,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:07:01,960 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:07:01,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:07:02,044 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:07:02,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02 WrapperNode [2019-11-15 22:07:02,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:07:02,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:07:02,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:07:02,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:07:02,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... [2019-11-15 22:07:02,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... [2019-11-15 22:07:02,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:07:02,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:07:02,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:07:02,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:07:02,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... [2019-11-15 22:07:02,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... [2019-11-15 22:07:02,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... [2019-11-15 22:07:02,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... [2019-11-15 22:07:02,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... [2019-11-15 22:07:02,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... [2019-11-15 22:07:02,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... [2019-11-15 22:07:02,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:07:02,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:07:02,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:07:02,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:07:02,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/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 22:07:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:07:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:07:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:07:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:07:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:07:02,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:07:02,454 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:07:02,454 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 22:07:02,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:07:02 BoogieIcfgContainer [2019-11-15 22:07:02,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:07:02,456 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:07:02,456 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:07:02,459 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:07:02,461 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:07:02,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:07:01" (1/3) ... [2019-11-15 22:07:02,462 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c2541be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:07:02, skipping insertion in model container [2019-11-15 22:07:02,462 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:07:02,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:07:02" (2/3) ... [2019-11-15 22:07:02,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c2541be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:07:02, skipping insertion in model container [2019-11-15 22:07:02,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:07:02,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:07:02" (3/3) ... [2019-11-15 22:07:02,464 INFO L371 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-11-15 22:07:02,518 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:07:02,518 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:07:02,519 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:07:02,519 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:07:02,519 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:07:02,519 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:07:02,519 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:07:02,520 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:07:02,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 22:07:02,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:02,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:07:02,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:07:02,551 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:07:02,551 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:07:02,551 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:07:02,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 22:07:02,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:02,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:07:02,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:07:02,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:07:02,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:07:02,558 INFO L791 eck$LassoCheckResult]: Stem: 7#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~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 5#L555-2true [2019-11-15 22:07:02,559 INFO L793 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 6#L554-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 9#L554-3true main_#t~short12 := main_#t~short10; 11#L554-4true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 4#L554-6true assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 5#L555-2true [2019-11-15 22:07:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:02,562 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 22:07:02,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:02,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295601483] [2019-11-15 22:07:02,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:02,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:02,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:02,712 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:02,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2019-11-15 22:07:02,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:02,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292991418] [2019-11-15 22:07:02,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:02,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:02,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:02,753 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2019-11-15 22:07:02,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:02,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566002938] [2019-11-15 22:07:02,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:02,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:02,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:02,840 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:03,197 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-15 22:07:03,632 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-15 22:07:03,799 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-15 22:07:03,816 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:07:03,818 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:07:03,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:07:03,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:07:03,819 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:07:03,819 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:07:03,819 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:07:03,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:07:03,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration1_Lasso [2019-11-15 22:07:03,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:07:03,820 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:07:03,860 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 22:07:03,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:07:03,870 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 22:07:03,872 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 22:07:04,266 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-11-15 22:07:04,428 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-15 22:07:04,429 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 22:07:04,435 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 22:07:04,438 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 22:07:04,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 22:07:04,447 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 22:07:04,450 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 22:07:04,454 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 22:07:04,456 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 22:07:04,460 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 22:07:04,464 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 22:07:04,467 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 22:07:04,470 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 22:07:04,472 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 22:07:04,475 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 22:07:04,478 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 22:07:04,481 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 22:07:04,484 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 22:07:04,488 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 22:07:04,759 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-15 22:07:05,370 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 22:07:05,562 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:07:05,567 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:07:05,571 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 22:07:05,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,574 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:05,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:05,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:05,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:05,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:05,598 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 22:07:05,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,599 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:05,599 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:05,599 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,599 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,600 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:05,600 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:05,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:05,602 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 22:07:05,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,610 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:05,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:05,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,611 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,611 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:05,612 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:05,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:05,620 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 22:07:05,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:05,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,625 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:05,626 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:05,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:05,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 22:07:05,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:05,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,674 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:05,677 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:05,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:05,699 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 22:07:05,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:05,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,703 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:05,706 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:05,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:05,712 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 22:07:05,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,713 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 22:07:05,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,731 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 22:07:05,731 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:05,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:05,835 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 22:07:05,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:05,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,843 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:05,844 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:05,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:05,890 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 22:07:05,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:05,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,894 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:05,894 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:05,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:05,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:07:05,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:05,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:05,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:05,904 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:05,907 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:05,908 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:05,937 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:07:05,958 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:07:05,958 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:07:05,960 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:07:05,962 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:07:05,962 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:07:05,963 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, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*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_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2019-11-15 22:07:06,056 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 22:07:06,065 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:07:06,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:07:06,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:07:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:06,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:07:06,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:06,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:07:06,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:06,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:06,242 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 22:07:06,261 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 22:07:06,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-11-15 22:07:06,382 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2019-11-15 22:07:06,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:07:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:07:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-11-15 22:07:06,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 22:07:06,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:06,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 22:07:06,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:06,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2019-11-15 22:07:06,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:06,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-11-15 22:07:06,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:06,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2019-11-15 22:07:06,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:07:06,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:07:06,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-11-15 22:07:06,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:07:06,399 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-15 22:07:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-11-15 22:07:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 22:07:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:07:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-15 22:07:06,425 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-15 22:07:06,425 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-15 22:07:06,425 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:07:06,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-15 22:07:06,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:06,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:07:06,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:07:06,427 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:06,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:07:06,428 INFO L791 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 210#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 215#L554-1 assume !main_#t~short10; 216#L554-3 main_#t~short12 := main_#t~short10; 219#L554-4 assume !main_#t~short12; 205#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 206#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 211#L555-2 [2019-11-15 22:07:06,428 INFO L793 eck$LassoCheckResult]: Loop: 211#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 212#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 224#L554-3 main_#t~short12 := main_#t~short10; 223#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 222#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 211#L555-2 [2019-11-15 22:07:06,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:06,428 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2019-11-15 22:07:06,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:06,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353312941] [2019-11-15 22:07:06,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:06,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:06,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:06,475 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 22:07:06,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353312941] [2019-11-15 22:07:06,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:06,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:07:06,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229280954] [2019-11-15 22:07:06,478 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:07:06,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2019-11-15 22:07:06,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:06,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474381903] [2019-11-15 22:07:06,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:06,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:06,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:06,499 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:06,731 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-15 22:07:06,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:06,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:07:06,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:07:06,783 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:07:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:06,794 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-11-15 22:07:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:07:06,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-11-15 22:07:06,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:06,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2019-11-15 22:07:06,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:07:06,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:07:06,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-15 22:07:06,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:07:06,798 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-15 22:07:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-15 22:07:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 22:07:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:07:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-11-15 22:07:06,833 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-15 22:07:06,834 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-15 22:07:06,834 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:07:06,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-11-15 22:07:06,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:06,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:07:06,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:07:06,835 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:06,835 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:07:06,836 INFO L791 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 255#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 264#L554-1 assume !main_#t~short10; 265#L554-3 main_#t~short12 := main_#t~short10; 268#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 256#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 257#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 260#L555-2 [2019-11-15 22:07:06,836 INFO L793 eck$LassoCheckResult]: Loop: 260#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 261#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 273#L554-3 main_#t~short12 := main_#t~short10; 272#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 271#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 270#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 260#L555-2 [2019-11-15 22:07:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2019-11-15 22:07:06,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:06,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611562819] [2019-11-15 22:07:06,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:06,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:06,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:06,879 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 22:07:06,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611562819] [2019-11-15 22:07:06,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:07:06,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:07:06,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113311011] [2019-11-15 22:07:06,881 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:07:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2019-11-15 22:07:06,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:06,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188708681] [2019-11-15 22:07:06,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:06,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:06,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:06,908 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:07,212 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-15 22:07:07,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:07,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:07:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:07:07,276 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 22:07:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:07,306 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-11-15 22:07:07,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:07:07,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2019-11-15 22:07:07,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:07,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2019-11-15 22:07:07,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:07:07,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:07:07,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-11-15 22:07:07,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:07:07,310 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 22:07:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-11-15 22:07:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 22:07:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:07:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-15 22:07:07,312 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 22:07:07,312 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 22:07:07,312 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:07:07,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-15 22:07:07,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:07,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:07:07,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:07:07,313 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:07,313 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:07:07,314 INFO L791 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 313#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 314#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 319#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 320#L554-3 main_#t~short12 := main_#t~short10; 323#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 309#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 310#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 315#L555-2 [2019-11-15 22:07:07,314 INFO L793 eck$LassoCheckResult]: Loop: 315#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 316#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 328#L554-3 main_#t~short12 := main_#t~short10; 327#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 326#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 325#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 315#L555-2 [2019-11-15 22:07:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:07,314 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2019-11-15 22:07:07,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:07,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845687491] [2019-11-15 22:07:07,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:07,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:07,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:07,380 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2019-11-15 22:07:07,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:07,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732708247] [2019-11-15 22:07:07,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:07,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:07,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:07,395 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:07,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2019-11-15 22:07:07,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:07,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580882290] [2019-11-15 22:07:07,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:07,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:07,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:07,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580882290] [2019-11-15 22:07:07,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241499886] [2019-11-15 22:07:07,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a6b6ec-ccdb-4679-9ac0-40c4db65849f/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 22:07:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:07,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:07:07,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:07,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:07,686 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 3 case distinctions, treesize of input 85 treesize of output 100 [2019-11-15 22:07:07,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:07,722 INFO L567 ElimStorePlain]: treesize reduction 55, result has 32.9 percent of original size [2019-11-15 22:07:07,723 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 22:07:07,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:92, output treesize:24 [2019-11-15 22:07:07,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:07,755 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 22:07:07,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:07,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:07,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2019-11-15 22:07:07,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:07,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:07,767 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:07,773 INFO L567 ElimStorePlain]: treesize reduction 20, result has 13.0 percent of original size [2019-11-15 22:07:07,773 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 22:07:07,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:3 [2019-11-15 22:07:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:07:07,775 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:07:07,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 22:07:07,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353046692] [2019-11-15 22:07:08,038 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-15 22:07:08,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:07:08,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:07:08,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:07:08,110 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-15 22:07:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:07:08,225 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-15 22:07:08,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:07:08,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-15 22:07:08,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:08,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-15 22:07:08,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:07:08,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:07:08,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-15 22:07:08,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:07:08,228 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 22:07:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-15 22:07:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-15 22:07:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:07:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 22:07:08,229 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 22:07:08,230 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 22:07:08,230 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:07:08,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-15 22:07:08,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:08,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:07:08,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:07:08,231 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 22:07:08,231 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:07:08,231 INFO L791 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 412#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-11-15 22:07:08,233 INFO L793 eck$LassoCheckResult]: Loop: 414#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 417#L554-3 main_#t~short12 := main_#t~short10; 420#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 407#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 408#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 413#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-11-15 22:07:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 22:07:08,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:08,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80886429] [2019-11-15 22:07:08,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:08,258 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2019-11-15 22:07:08,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:08,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207580899] [2019-11-15 22:07:08,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:08,288 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2019-11-15 22:07:08,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:08,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619197610] [2019-11-15 22:07:08,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:08,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:08,333 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:08,649 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-11-15 22:07:08,821 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 22:07:09,095 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-15 22:07:09,463 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 22:07:09,467 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:07:09,467 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:07:09,467 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:07:09,467 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:07:09,467 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:07:09,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:07:09,468 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:07:09,468 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:07:09,468 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration5_Lasso [2019-11-15 22:07:09,468 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:07:09,468 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:07:09,477 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 22:07:10,121 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-11-15 22:07:10,307 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-15 22:07:10,307 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 22:07:10,309 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 22:07:10,311 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 22:07:10,315 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 22:07:10,316 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 22:07:10,321 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 22:07:10,323 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 22:07:10,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 22:07:10,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 22:07:10,335 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 22:07:10,337 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 22:07:10,339 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 22:07:10,342 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 22:07:10,344 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 22:07:10,346 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 22:07:10,348 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 22:07:10,350 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 22:07:10,353 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 22:07:10,355 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 22:07:10,357 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 22:07:10,361 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 22:07:11,088 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 22:07:11,300 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:07:11,301 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:07:11,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:07:11,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:11,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:11,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:11,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:11,305 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:11,306 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:11,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:11,317 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 22:07:11,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:11,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:11,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:11,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:11,319 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:11,320 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:11,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:11,323 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 22:07:11,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:11,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:11,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:11,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:11,325 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:11,325 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:11,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:11,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 22:07:11,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:11,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:11,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:11,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:11,328 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:11,328 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:11,333 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:07:11,336 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:07:11,337 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:07:11,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:07:11,338 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:07:11,338 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:07:11,338 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2019-11-15 22:07:11,430 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 22:07:11,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:07:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:11,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:07:11,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:11,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:11,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 22:07:11,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:11,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:11,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:11,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-15 22:07:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:11,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:07:11,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:11,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:11,626 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:11,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-15 22:07:11,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:11,658 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-15 22:07:11,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:11,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-15 22:07:11,700 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 22:07:11,700 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 22:07:11,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-15 22:07:11,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 37 states and 40 transitions. Complement of second has 10 states. [2019-11-15 22:07:11,770 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 22:07:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:07:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-11-15 22:07:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-15 22:07:11,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 22:07:11,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2019-11-15 22:07:11,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:11,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-11-15 22:07:11,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:11,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2019-11-15 22:07:11,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:07:11,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 22:07:11,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-11-15 22:07:11,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:07:11,774 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-15 22:07:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-11-15 22:07:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-15 22:07:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 22:07:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-15 22:07:11,776 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-15 22:07:11,776 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-15 22:07:11,776 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:07:11,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-15 22:07:11,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:07:11,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:07:11,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:07:11,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:07:11,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:07:11,777 INFO L791 eck$LassoCheckResult]: Stem: 630#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 623#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 624#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 625#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 629#L554-3 main_#t~short12 := main_#t~short10; 632#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 621#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 622#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 626#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-11-15 22:07:11,777 INFO L793 eck$LassoCheckResult]: Loop: 627#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 628#L554-3 main_#t~short12 := main_#t~short10; 631#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 619#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 620#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 633#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-11-15 22:07:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2019-11-15 22:07:11,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:11,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694302481] [2019-11-15 22:07:11,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:11,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:11,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:11,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2019-11-15 22:07:11,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:11,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783921561] [2019-11-15 22:07:11,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:11,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:11,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:11,817 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:11,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:11,818 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2019-11-15 22:07:11,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:07:11,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913585429] [2019-11-15 22:07:11,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:11,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:07:11,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:07:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:07:11,856 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:07:12,165 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-11-15 22:07:12,319 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 22:07:13,155 WARN L191 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 128 [2019-11-15 22:07:13,984 WARN L191 SmtUtils]: Spent 799.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-15 22:07:13,988 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:07:13,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:07:13,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:07:13,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:07:13,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:07:13,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:07:13,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:07:13,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:07:13,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration6_Lasso [2019-11-15 22:07:13,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:07:13,988 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:07:13,994 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 22:07:14,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 22:07:14,009 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 22:07:14,011 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 22:07:14,013 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 22:07:14,014 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 22:07:14,016 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 22:07:14,018 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 22:07:14,020 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 22:07:14,026 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 22:07:14,028 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 22:07:14,030 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 22:07:14,031 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 22:07:14,033 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 22:07:14,824 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-11-15 22:07:14,973 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-15 22:07:14,973 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 22:07:14,975 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 22:07:14,977 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 22:07:14,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 22:07:14,980 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 22:07:14,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 22:07:15,548 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-15 22:07:15,925 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 22:07:15,946 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:07:15,946 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:07:15,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:07:15,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,947 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,947 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,947 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,948 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 22:07:15,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,949 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 22:07:15,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,951 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:15,951 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:15,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,952 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 22:07:15,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,953 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,954 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,954 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,955 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 22:07:15,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,956 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,957 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 22:07:15,957 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,958 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,958 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:15,959 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:15,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,960 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 22:07:15,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,961 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:07:15,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,964 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,965 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 22:07:15,966 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,967 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:15,967 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:15,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,968 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 22:07:15,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,969 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,969 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,970 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,971 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 22:07:15,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,971 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,972 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,972 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,972 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:07:15,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,974 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,974 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,975 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 22:07:15,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,976 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:07:15,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,977 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:07:15,977 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:07:15,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,977 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 22:07:15,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,978 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,978 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,979 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:15,979 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:15,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,983 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 22:07:15,984 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,985 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:15,985 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:15,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,988 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 22:07:15,989 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,990 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:15,990 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:15,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,991 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 22:07:15,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:07:15,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:07:15,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:15,993 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:07:15,993 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:07:15,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:07:15,995 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 22:07:15,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:07:15,995 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:07:15,995 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:07:15,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:07:16,000 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 22:07:16,000 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 22:07:16,137 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:07:16,204 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:07:16,205 INFO L444 ModelExtractionUtils]: 33 out of 36 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:07:16,205 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:07:16,206 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 22:07:16,207 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:07:16,207 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2019-11-15 22:07:16,311 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 22:07:16,318 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:07:16,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:16,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:07:16,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:16,385 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:16,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 22:07:16,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:16,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:16,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:16,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-15 22:07:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:16,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:07:16,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:16,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:16,515 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:16,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-15 22:07:16,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:16,566 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-15 22:07:16,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:16,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-15 22:07:16,602 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 22:07:16,602 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 22:07:16,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-15 22:07:16,688 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-11-15 22:07:16,689 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 22:07:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:07:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-15 22:07:16,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 22:07:16,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:16,690 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:07:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:16,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:07:16,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:16,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:16,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 22:07:16,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:16,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:16,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:16,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-15 22:07:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:16,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:07:16,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:16,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:16,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:16,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-15 22:07:16,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:16,934 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-15 22:07:16,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:16,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-15 22:07:16,969 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 22:07:16,969 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 22:07:16,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-15 22:07:17,036 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-11-15 22:07:17,036 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 22:07:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:07:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-15 22:07:17,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 22:07:17,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:17,037 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:07:17,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:07:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:17,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:07:17,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:17,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:17,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 22:07:17,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:17,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:17,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:07:17,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-15 22:07:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:07:17,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:07:17,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:07:17,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:07:17,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:07:17,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-15 22:07:17,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:07:17,232 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-15 22:07:17,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:07:17,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-15 22:07:17,260 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 22:07:17,260 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 22:07:17,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-15 22:07:17,345 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 26 states and 28 transitions. Complement of second has 11 states. [2019-11-15 22:07:17,346 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 22:07:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 22:07:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-11-15 22:07:17,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 22:07:17,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:17,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 22:07:17,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:17,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2019-11-15 22:07:17,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:07:17,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-15 22:07:17,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:07:17,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-11-15 22:07:17,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:07:17,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:07:17,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:07:17,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:07:17,350 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:07:17,350 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:07:17,350 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:07:17,351 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:07:17,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:07:17,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:07:17,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:07:17,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:07:17 BoogieIcfgContainer [2019-11-15 22:07:17,363 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:07:17,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:07:17,364 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:07:17,364 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:07:17,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:07:02" (3/4) ... [2019-11-15 22:07:17,368 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:07:17,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:07:17,369 INFO L168 Benchmark]: Toolchain (without parser) took 15810.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.4 MB). Free memory was 943.4 MB in the beginning and 984.2 MB in the end (delta: -40.8 MB). Peak memory consumption was 259.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:17,373 INFO L168 Benchmark]: CDTParser took 0.23 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 22:07:17,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:17,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.62 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:17,376 INFO L168 Benchmark]: Boogie Preprocessor took 25.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:17,378 INFO L168 Benchmark]: RCFGBuilder took 339.47 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 22:07:17,381 INFO L168 Benchmark]: BuchiAutomizer took 14906.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 984.2 MB in the end (delta: 117.0 MB). Peak memory consumption was 276.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:07:17,381 INFO L168 Benchmark]: Witness Printer took 4.98 ms. Allocated memory is still 1.3 GB. Free memory is still 984.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:07:17,383 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.23 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 485.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.62 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 339.47 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 14906.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 984.2 MB in the end (delta: 117.0 MB). Peak memory consumption was 276.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.98 ms. Allocated memory is still 1.3 GB. Free memory is still 984.2 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 12.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 55 SDslu, 45 SDs, 0 SdLazy, 134 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1031 mio100 ax103 hnf99 lsp64 ukn56 mio100 lsp28 div100 bol104 ite100 ukn100 eq174 hnf88 smp97 dnf301 smp90 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 118ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...