./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-lit/mcmillan2006.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-lit/mcmillan2006.i -s /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 025e0289c8e9b33528493c96bf0a22ba3200731b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:48,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:48,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:48,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:48,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:48,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:48,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:48,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:48,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:48,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:48,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:48,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:48,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:48,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:48,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:48,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:48,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:48,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:48,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:48,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:48,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:48,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:48,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:48,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:48,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:48,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:48,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:48,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:48,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:48,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:48,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:48,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:48,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:48,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:48,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:48,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:48,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:48,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:48,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:48,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:48,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:48,478 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:48,494 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:48,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:48,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:48,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:48,496 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:48,496 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:48,496 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:48,496 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:48,496 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:48,497 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:48,497 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:48,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:48,497 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:48,497 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:48,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:48,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:48,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:48,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:48,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:48,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:48,507 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:48,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:48,508 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:48,508 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:48,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:48,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:48,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:48,508 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:48,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:48,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:48,509 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:48,509 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:48,510 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/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 025e0289c8e9b33528493c96bf0a22ba3200731b [2019-10-22 08:59:48,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:48,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:48,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:48,556 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:48,556 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:48,557 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/../../sv-benchmarks/c/loop-lit/mcmillan2006.i [2019-10-22 08:59:48,603 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/data/a1d658f16/4f5ab4fe5bab4525b2562881935dbe8e/FLAG7594f2400 [2019-10-22 08:59:48,990 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:48,990 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/sv-benchmarks/c/loop-lit/mcmillan2006.i [2019-10-22 08:59:48,996 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/data/a1d658f16/4f5ab4fe5bab4525b2562881935dbe8e/FLAG7594f2400 [2019-10-22 08:59:49,406 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/bin/uautomizer/data/a1d658f16/4f5ab4fe5bab4525b2562881935dbe8e [2019-10-22 08:59:49,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:49,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:49,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:49,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:49,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:49,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4720b07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49, skipping insertion in model container [2019-10-22 08:59:49,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:49,439 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:49,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:49,620 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:49,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:49,712 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:49,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49 WrapperNode [2019-10-22 08:59:49,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:49,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:49,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:49,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:49,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:49,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:49,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:49,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:49,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... [2019-10-22 08:59:49,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:49,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:49,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:49,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:49,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_228e817a-5269-4147-a89d-262a195e0f1b/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-10-22 08:59:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:59:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:49,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:50,078 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:50,079 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:59:50,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:50 BoogieIcfgContainer [2019-10-22 08:59:50,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:50,081 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:50,081 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:50,084 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:50,085 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:50,085 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:49" (1/3) ... [2019-10-22 08:59:50,086 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9d949e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:50, skipping insertion in model container [2019-10-22 08:59:50,087 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:50,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:49" (2/3) ... [2019-10-22 08:59:50,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9d949e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:50, skipping insertion in model container [2019-10-22 08:59:50,087 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:50,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:50" (3/3) ... [2019-10-22 08:59:50,089 INFO L371 chiAutomizerObserver]: Analyzing ICFG mcmillan2006.i [2019-10-22 08:59:50,124 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:50,124 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:50,124 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:50,125 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:50,125 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:50,125 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:50,125 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:50,125 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:50,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:59:50,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:50,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:50,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:50,161 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:59:50,161 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:50,161 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:50,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:59:50,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:59:50,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:50,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:50,163 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:59:50,163 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:50,168 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 15#L14true assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 11#L16-3true [2019-10-22 08:59:50,169 INFO L793 eck$LassoCheckResult]: Loop: 11#L16-3true assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 16#L16-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 11#L16-3true [2019-10-22 08:59:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:50,173 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 08:59:50,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:50,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976417178] [2019-10-22 08:59:50,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,278 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2019-10-22 08:59:50,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:50,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854214964] [2019-10-22 08:59:50,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,294 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:50,295 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2019-10-22 08:59:50,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:50,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981644354] [2019-10-22 08:59:50,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:50,327 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:50,485 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:50,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:50,486 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:50,486 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:50,486 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:50,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:50,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:50,487 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:50,487 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006.i_Iteration1_Lasso [2019-10-22 08:59:50,487 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:50,487 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:50,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,674 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-10-22 08:59:50,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,933 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:50,938 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:50,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:50,941 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:50,941 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:50,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:50,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:50,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:50,944 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:50,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:50,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:50,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-10-22 08:59:50,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:50,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:50,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:50,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:50,949 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:50,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:50,950 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:50,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:50,951 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-10-22 08:59:50,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:50,952 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:50,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:50,952 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:50,952 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:50,953 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:50,953 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:50,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:50,954 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-10-22 08:59:50,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:50,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:50,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:50,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:50,958 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:50,958 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:50,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:50,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-10-22 08:59:50,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:50,964 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:50,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:50,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:50,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:50,965 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:50,965 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:50,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:50,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:50,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:50,967 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:50,967 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:50,967 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:50,967 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:50,968 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:50,968 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:50,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:50,969 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-10-22 08:59:50,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:50,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:50,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:50,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:50,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:50,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:50,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:50,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:50,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-10-22 08:59:50,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:50,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:50,973 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:50,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:50,978 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:50,978 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,092 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:51,153 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:51,153 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:51,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:51,164 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:51,165 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:51,165 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:59:51,186 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:59:51,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:51,266 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:51,267 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-10-22 08:59:51,329 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 40 states and 51 transitions. Complement of second has 7 states. [2019-10-22 08:59:51,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-10-22 08:59:51,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:59:51,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:51,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:59:51,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:51,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2019-10-22 08:59:51,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:51,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-10-22 08:59:51,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:51,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 11 states and 13 transitions. [2019-10-22 08:59:51,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:51,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:59:51,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-10-22 08:59:51,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:51,352 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 08:59:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-10-22 08:59:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:59:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:59:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-10-22 08:59:51,380 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 08:59:51,380 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 08:59:51,380 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:51,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2019-10-22 08:59:51,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:51,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:51,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:51,382 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:51,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:51,383 INFO L791 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 112#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 117#L16-3 assume !(main_~i~0 < main_~n~0); 116#L16-4 main_~i~1 := 0; 110#L17-3 [2019-10-22 08:59:51,383 INFO L793 eck$LassoCheckResult]: Loop: 110#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 113#L5 assume !(0 == __VERIFIER_assert_~cond); 114#L5-2 havoc main_#t~mem5; 109#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 110#L17-3 [2019-10-22 08:59:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2019-10-22 08:59:51,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294606304] [2019-10-22 08:59:51,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,403 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 1 times [2019-10-22 08:59:51,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061161508] [2019-10-22 08:59:51,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,432 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1304171029, now seen corresponding path program 1 times [2019-10-22 08:59:51,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588061650] [2019-10-22 08:59:51,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:51,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588061650] [2019-10-22 08:59:51,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:51,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:51,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204855348] [2019-10-22 08:59:51,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:51,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:51,555 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-10-22 08:59:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:51,585 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-10-22 08:59:51,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:51,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2019-10-22 08:59:51,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:51,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 13 transitions. [2019-10-22 08:59:51,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:59:51,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:59:51,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-10-22 08:59:51,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:51,587 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-10-22 08:59:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-10-22 08:59:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-10-22 08:59:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:59:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-10-22 08:59:51,589 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 08:59:51,589 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 08:59:51,589 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:51,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-10-22 08:59:51,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:51,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:51,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:51,590 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:51,590 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:51,591 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 153#L16-3 assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 154#L16-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 155#L16-3 assume !(main_~i~0 < main_~n~0); 152#L16-4 main_~i~1 := 0; 146#L17-3 [2019-10-22 08:59:51,591 INFO L793 eck$LassoCheckResult]: Loop: 146#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 149#L5 assume !(0 == __VERIFIER_assert_~cond); 150#L5-2 havoc main_#t~mem5; 145#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 146#L17-3 [2019-10-22 08:59:51,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2019-10-22 08:59:51,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211729600] [2019-10-22 08:59:51,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,608 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 2 times [2019-10-22 08:59:51,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332754858] [2019-10-22 08:59:51,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,617 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:51,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1358706313, now seen corresponding path program 1 times [2019-10-22 08:59:51,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296182110] [2019-10-22 08:59:51,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:51,648 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:51,842 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-22 08:59:51,887 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:51,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:51,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:51,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:51,888 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:51,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:51,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:51,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:51,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006.i_Iteration3_Lasso [2019-10-22 08:59:51,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:51,889 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:51,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:51,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:52,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:52,320 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:52,320 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:52,320 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-10-22 08:59:52,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,321 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:52,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,322 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:52,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:52,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,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-10-22 08:59:52,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,324 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:52,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,325 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:52,325 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:52,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,326 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-10-22 08:59:52,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:52,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,327 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:52,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:52,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,328 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-10-22 08:59:52,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,331 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:52,331 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:52,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,334 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-10-22 08:59:52,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:52,335 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,335 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,335 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:52,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:52,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,336 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-10-22 08:59:52,337 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:52,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,338 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:52,339 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:52,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,341 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-10-22 08:59:52,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,343 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,344 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:52,344 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:52,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,346 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-10-22 08:59:52,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,349 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:52,349 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:52,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,357 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-10-22 08:59:52,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,358 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:52,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,360 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:59:52,360 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:52,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,372 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-10-22 08:59:52,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,379 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:52,380 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:52,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:52,382 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-10-22 08:59:52,382 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:52,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:52,382 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:52,382 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:52,385 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:52,385 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:52,425 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:52,456 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:52,456 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:52,456 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:52,457 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:52,457 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:52,458 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~1) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [] [2019-10-22 08:59:52,466 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:59:52,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:52,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:52,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:52,504 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:52,505 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-10-22 08:59:52,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 17 transitions. Complement of second has 4 states. [2019-10-22 08:59:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-10-22 08:59:52,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:59:52,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 08:59:52,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 8 letters. [2019-10-22 08:59:52,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-10-22 08:59:52,516 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:52,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-10-22 08:59:52,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:52,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:52,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:52,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:52,517 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:52,517 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:52,517 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:52,517 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:52,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:52,517 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:52,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:52,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:52 BoogieIcfgContainer [2019-10-22 08:59:52,524 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:52,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:52,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:52,525 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:52,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:50" (3/4) ... [2019-10-22 08:59:52,528 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:52,529 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:52,530 INFO L168 Benchmark]: Toolchain (without parser) took 3120.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,531 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:52,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:52,532 INFO L168 Benchmark]: Boogie Preprocessor took 19.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:52,533 INFO L168 Benchmark]: RCFGBuilder took 320.19 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,533 INFO L168 Benchmark]: BuchiAutomizer took 2443.43 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: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,534 INFO L168 Benchmark]: Witness Printer took 4.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:52,537 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 320.19 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2443.43 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: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function n + -1 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 30 SDslu, 28 SDs, 0 SdLazy, 29 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital113 mio100 ax100 hnf99 lsp92 ukn84 mio100 lsp63 div100 bol100 ite100 ukn100 eq164 hnf89 smp90 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...