./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/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 e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:36:40,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:36:40,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:36:40,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:36:40,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:36:40,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:36:40,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:36:40,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:36:40,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:36:40,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:36:40,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:36:40,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:36:40,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:36:40,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:36:40,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:36:40,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:36:40,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:36:40,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:36:40,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:36:40,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:36:40,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:36:40,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:36:40,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:36:40,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:36:40,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:36:40,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:36:40,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:36:40,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:36:40,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:36:40,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:36:40,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:36:40,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:36:40,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:36:40,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:36:40,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:36:40,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:36:40,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:36:40,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:36:40,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:36:40,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:36:40,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:36:40,544 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:36:40,561 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:36:40,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:36:40,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:36:40,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:36:40,563 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:36:40,563 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:36:40,564 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:36:40,564 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:36:40,564 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:36:40,564 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:36:40,565 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:36:40,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:36:40,565 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:36:40,565 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:36:40,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:36:40,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:36:40,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:36:40,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:36:40,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:36:40,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:36:40,567 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:36:40,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:36:40,567 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:36:40,568 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:36:40,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:36:40,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:36:40,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:36:40,569 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:36:40,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:36:40,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:36:40,569 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:36:40,570 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:36:40,571 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_1a6d6a88-b758-482d-aa03-860d4335f265/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 -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-15 21:36:40,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:36:40,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:36:40,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:36:40,611 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:36:40,611 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:36:40,612 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-15 21:36:40,667 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/data/b2c9fa599/13f7ddf74bce4bc7854a6d2f2ec92d32/FLAG22097a4b9 [2019-11-15 21:36:41,116 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:36:41,118 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-15 21:36:41,130 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/data/b2c9fa599/13f7ddf74bce4bc7854a6d2f2ec92d32/FLAG22097a4b9 [2019-11-15 21:36:41,449 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/data/b2c9fa599/13f7ddf74bce4bc7854a6d2f2ec92d32 [2019-11-15 21:36:41,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:36:41,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:36:41,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:36:41,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:36:41,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:36:41,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:36:41" (1/1) ... [2019-11-15 21:36:41,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c611b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:41, skipping insertion in model container [2019-11-15 21:36:41,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:36:41" (1/1) ... [2019-11-15 21:36:41,464 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:36:41,497 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:36:41,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:36:41,953 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:36:41,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:36:42,038 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:36:42,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42 WrapperNode [2019-11-15 21:36:42,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:36:42,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:36:42,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:36:42,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:36:42,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... [2019-11-15 21:36:42,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... [2019-11-15 21:36:42,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:36:42,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:36:42,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:36:42,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:36:42,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... [2019-11-15 21:36:42,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... [2019-11-15 21:36:42,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... [2019-11-15 21:36:42,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... [2019-11-15 21:36:42,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... [2019-11-15 21:36:42,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... [2019-11-15 21:36:42,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... [2019-11-15 21:36:42,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:36:42,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:36:42,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:36:42,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:36:42,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/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 21:36:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:36:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:36:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:36:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:36:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:36:42,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:36:42,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:36:42,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:36:42,556 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:36:42,556 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 21:36:42,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:36:42 BoogieIcfgContainer [2019-11-15 21:36:42,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:36:42,558 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:36:42,559 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:36:42,561 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:36:42,562 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:36:42,562 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:36:41" (1/3) ... [2019-11-15 21:36:42,563 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d37be92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:36:42, skipping insertion in model container [2019-11-15 21:36:42,563 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:36:42,563 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:36:42" (2/3) ... [2019-11-15 21:36:42,563 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d37be92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:36:42, skipping insertion in model container [2019-11-15 21:36:42,564 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:36:42,564 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:36:42" (3/3) ... [2019-11-15 21:36:42,565 INFO L371 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2019-11-15 21:36:42,612 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:36:42,612 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:36:42,612 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:36:42,612 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:36:42,612 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:36:42,612 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:36:42,613 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:36:42,613 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:36:42,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-15 21:36:42,646 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-15 21:36:42,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:36:42,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:36:42,651 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:36:42,651 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:36:42,651 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:36:42,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-15 21:36:42,653 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-15 21:36:42,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:36:42,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:36:42,654 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:36:42,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:36:42,659 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 11#L522true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L514true [2019-11-15 21:36:42,659 INFO L793 eck$LassoCheckResult]: Loop: 5#L514true assume true; 5#L514true [2019-11-15 21:36:42,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:42,664 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-15 21:36:42,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:42,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026329783] [2019-11-15 21:36:42,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:42,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:42,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:42,797 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 21:36:42,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026329783] [2019-11-15 21:36:42,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:36:42,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:36:42,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349196759] [2019-11-15 21:36:42,803 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:36:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:42,803 INFO L82 PathProgramCache]: Analyzing trace with hash 101, now seen corresponding path program 1 times [2019-11-15 21:36:42,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:42,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491056118] [2019-11-15 21:36:42,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:42,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:42,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:42,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:42,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:36:42,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:36:42,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:36:42,857 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-11-15 21:36:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:36:42,891 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-11-15 21:36:42,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:36:42,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-11-15 21:36:42,894 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 21:36:42,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 17 transitions. [2019-11-15 21:36:42,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 21:36:42,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 21:36:42,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-11-15 21:36:42,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:36:42,900 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 21:36:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-11-15 21:36:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 21:36:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 21:36:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-15 21:36:42,925 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 21:36:42,926 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 21:36:42,926 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:36:42,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-15 21:36:42,927 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-15 21:36:42,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:36:42,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:36:42,927 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:36:42,927 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:36:42,928 INFO L791 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 57#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 58#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 53#L526-2 [2019-11-15 21:36:42,928 INFO L793 eck$LassoCheckResult]: Loop: 53#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 55#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 61#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 53#L526-2 [2019-11-15 21:36:42,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:42,928 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-11-15 21:36:42,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:42,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469653008] [2019-11-15 21:36:42,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:42,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:42,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:42,969 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:42,971 INFO L82 PathProgramCache]: Analyzing trace with hash 48852, now seen corresponding path program 1 times [2019-11-15 21:36:42,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:42,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368418277] [2019-11-15 21:36:42,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:42,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:42,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:43,011 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:43,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:43,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1807773776, now seen corresponding path program 1 times [2019-11-15 21:36:43,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:43,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811235482] [2019-11-15 21:36:43,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:43,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:43,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:43,060 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:43,390 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-11-15 21:36:43,434 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:36:43,547 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 21:36:43,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:43,554 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 21:36:43,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:43,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:36:43,646 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2019-11-15 21:36:43,878 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:36:43,882 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:36:43,883 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:36:43,883 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:36:43,883 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:36:43,883 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:36:43,883 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:36:43,883 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:36:43,883 INFO L131 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2019-11-15 21:36:43,884 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:36:43,884 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:36:43,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:36:43,922 INFO 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 21:36:43,925 INFO 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 21:36:43,928 INFO 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 21:36:43,930 INFO 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 21:36:43,936 INFO 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 21:36:43,940 INFO 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 21:36:43,945 INFO 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 21:36:43,947 INFO 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 21:36:43,951 INFO 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 21:36:44,198 INFO 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 21:36:44,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:36:44,206 INFO 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 21:36:44,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:36:44,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:36:44,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:36:44,221 INFO 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 21:36:44,225 INFO 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 21:36:44,229 INFO 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 21:36:44,693 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:36:44,698 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:36:44,702 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 21:36:44,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,705 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:36:44,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,708 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:36:44,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:36:44,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,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 21:36:44,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:36:44,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,715 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:36:44,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:36:44,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,717 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 21:36:44,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,723 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:36:44,723 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:36:44,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:36:44,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,739 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:36:44,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,740 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:36:44,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:36:44,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,742 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 21:36:44,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:36:44,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,750 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:36:44,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,751 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:36:44,751 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:36:44,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:36:44,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,763 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:36:44,765 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:36:44,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,770 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 21:36:44,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,774 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:36:44,774 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:36:44,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:36:44,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:36:44,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,780 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:36:44,780 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:36:44,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,782 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 21:36:44,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:36:44,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:36:44,784 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:36:44,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,785 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 21:36:44,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,789 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:36:44,789 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:36:44,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,806 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 21:36:44,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:36:44,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:36:44,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:36:44,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:36:44,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:36:44,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:36:44,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:36:44,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:36:44,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:36:44,813 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:36:44,813 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:36:44,827 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:36:44,842 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:36:44,842 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:36:44,844 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:36:44,846 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:36:44,846 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:36:44,847 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2019-11-15 21:36:44,858 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 21:36:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:44,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:36:44,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:36:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:44,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:36:44,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:36:44,928 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 21:36:44,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:36:44,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 21:36:44,973 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 7 states. [2019-11-15 21:36:44,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:36:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:36:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 21:36:44,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-15 21:36:44,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:36:44,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 21:36:44,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:36:44,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 21:36:44,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:36:44,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-15 21:36:44,980 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-15 21:36:44,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2019-11-15 21:36:44,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:36:44,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:36:44,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-15 21:36:44,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:36:44,981 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 21:36:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-15 21:36:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 21:36:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 21:36:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-15 21:36:44,983 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 21:36:44,984 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 21:36:44,984 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:36:44,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-15 21:36:44,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-15 21:36:44,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:36:44,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:36:44,985 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:36:44,985 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:36:44,986 INFO L791 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 145#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 146#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 139#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 140#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 135#L538-2 [2019-11-15 21:36:44,986 INFO L793 eck$LassoCheckResult]: Loop: 135#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 137#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 134#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 135#L538-2 [2019-11-15 21:36:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash 889599219, now seen corresponding path program 1 times [2019-11-15 21:36:44,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:44,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915230433] [2019-11-15 21:36:44,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:44,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:44,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,013 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:45,013 INFO L82 PathProgramCache]: Analyzing trace with hash 69737, now seen corresponding path program 1 times [2019-11-15 21:36:45,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:45,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297560657] [2019-11-15 21:36:45,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,026 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:45,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:45,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2102156855, now seen corresponding path program 1 times [2019-11-15 21:36:45,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:45,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645746930] [2019-11-15 21:36:45,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:45,091 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 21:36:45,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645746930] [2019-11-15 21:36:45,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:36:45,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:36:45,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716429602] [2019-11-15 21:36:45,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:36:45,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:36:45,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:36:45,199 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-15 21:36:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:36:45,316 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-15 21:36:45,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:36:45,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-11-15 21:36:45,319 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2019-11-15 21:36:45,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2019-11-15 21:36:45,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 21:36:45,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 21:36:45,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-11-15 21:36:45,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:36:45,322 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-11-15 21:36:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-11-15 21:36:45,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2019-11-15 21:36:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 21:36:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-11-15 21:36:45,325 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-15 21:36:45,325 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-15 21:36:45,325 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:36:45,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-11-15 21:36:45,326 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-15 21:36:45,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:36:45,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:36:45,327 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:36:45,327 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:36:45,327 INFO L791 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 208#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 206#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 207#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 199#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 202#L529 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 205#L514-1 [2019-11-15 21:36:45,327 INFO L793 eck$LassoCheckResult]: Loop: 205#L514-1 assume true; 205#L514-1 [2019-11-15 21:36:45,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:45,328 INFO L82 PathProgramCache]: Analyzing trace with hash 889599272, now seen corresponding path program 1 times [2019-11-15 21:36:45,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:45,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478755177] [2019-11-15 21:36:45,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:45,384 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 21:36:45,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478755177] [2019-11-15 21:36:45,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:36:45,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:36:45,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111344903] [2019-11-15 21:36:45,386 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:36:45,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:45,386 INFO L82 PathProgramCache]: Analyzing trace with hash 102, now seen corresponding path program 1 times [2019-11-15 21:36:45,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:45,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680039954] [2019-11-15 21:36:45,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,390 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:45,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:36:45,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:36:45,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:36:45,393 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 21:36:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:36:45,401 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-11-15 21:36:45,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:36:45,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-11-15 21:36:45,403 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2019-11-15 21:36:45,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2019-11-15 21:36:45,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 21:36:45,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 21:36:45,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-15 21:36:45,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:36:45,405 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 21:36:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-15 21:36:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-15 21:36:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 21:36:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-15 21:36:45,407 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 21:36:45,407 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 21:36:45,407 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:36:45,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-15 21:36:45,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 21:36:45,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:36:45,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:36:45,408 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:36:45,409 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:36:45,409 INFO L791 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 247#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 248#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 242#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 243#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 239#L538-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 240#L538-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 241#L546-2 [2019-11-15 21:36:45,409 INFO L793 eck$LassoCheckResult]: Loop: 241#L546-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 241#L546-2 [2019-11-15 21:36:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:45,409 INFO L82 PathProgramCache]: Analyzing trace with hash 206358786, now seen corresponding path program 1 times [2019-11-15 21:36:45,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:45,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761510490] [2019-11-15 21:36:45,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:45,448 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 21:36:45,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761510490] [2019-11-15 21:36:45,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:36:45,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:36:45,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630020044] [2019-11-15 21:36:45,449 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:36:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2019-11-15 21:36:45,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:45,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101499041] [2019-11-15 21:36:45,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,458 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:45,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:36:45,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:36:45,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:36:45,531 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 21:36:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:36:45,564 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-15 21:36:45,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:36:45,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-11-15 21:36:45,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 21:36:45,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2019-11-15 21:36:45,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 21:36:45,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 21:36:45,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-15 21:36:45,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:36:45,567 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 21:36:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-15 21:36:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-15 21:36:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 21:36:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 21:36:45,569 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 21:36:45,569 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 21:36:45,570 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:36:45,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-15 21:36:45,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 21:36:45,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:36:45,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:36:45,571 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:36:45,571 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:36:45,572 INFO L791 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 296#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 294#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 295#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 290#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 291#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 298#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 292#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 293#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 286#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L539 [2019-11-15 21:36:45,572 INFO L793 eck$LassoCheckResult]: Loop: 287#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 284#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 285#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 287#L539 [2019-11-15 21:36:45,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:45,572 INFO L82 PathProgramCache]: Analyzing trace with hash 793653610, now seen corresponding path program 1 times [2019-11-15 21:36:45,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:45,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589928240] [2019-11-15 21:36:45,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,608 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 2 times [2019-11-15 21:36:45,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:45,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258720439] [2019-11-15 21:36:45,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:45,618 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:45,619 INFO L82 PathProgramCache]: Analyzing trace with hash -60222244, now seen corresponding path program 1 times [2019-11-15 21:36:45,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:45,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138699575] [2019-11-15 21:36:45,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:45,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:36:45,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138699575] [2019-11-15 21:36:45,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280798071] [2019-11-15 21:36:45,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/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 21:36:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:45,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 21:36:45,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:36:45,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:45,852 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 11 treesize of output 15 [2019-11-15 21:36:45,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:45,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:45,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:36:45,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:45,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:45,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:36:45,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-11-15 21:36:45,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:36:45,937 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 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 21:36:45,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:45,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:45,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:36:45,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2019-11-15 21:36:46,001 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 21:36:46,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2019-11-15 21:36:46,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:46,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:46,016 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 21:36:46,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:14 [2019-11-15 21:36:46,048 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 21:36:46,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:46,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:46,059 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 21:36:46,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-15 21:36:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:36:46,083 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:36:46,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-15 21:36:46,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066748654] [2019-11-15 21:36:46,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:36:46,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:36:46,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:36:46,152 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2019-11-15 21:36:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:36:46,451 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-15 21:36:46,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:36:46,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-15 21:36:46,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 21:36:46,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2019-11-15 21:36:46,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 21:36:46,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 21:36:46,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-15 21:36:46,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:36:46,454 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-15 21:36:46,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-15 21:36:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-11-15 21:36:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 21:36:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-15 21:36:46,456 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 21:36:46,456 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 21:36:46,456 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:36:46,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-15 21:36:46,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 21:36:46,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:36:46,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:36:46,460 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:36:46,460 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:36:46,461 INFO L791 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 405#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~post6, main_#t~nondet3, main_#t~mem7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~mem10.base, main_#t~mem10.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 403#L522 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 404#L522-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 398#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 399#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 407#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 400#L526-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 401#L529 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 409#L529-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 408#L526-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet3);havoc main_#t~nondet3; 402#L526-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 394#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 395#L539 [2019-11-15 21:36:46,461 INFO L793 eck$LassoCheckResult]: Loop: 395#L539 assume !(1 != main_#t~mem7);havoc main_#t~mem7; 392#L539-2 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 393#L538-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); 395#L539 [2019-11-15 21:36:46,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash -8921739, now seen corresponding path program 2 times [2019-11-15 21:36:46,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:46,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553924449] [2019-11-15 21:36:46,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:46,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:46,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:46,505 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash 76517, now seen corresponding path program 3 times [2019-11-15 21:36:46,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:46,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028477617] [2019-11-15 21:36:46,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:46,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:46,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:36:46,515 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:36:46,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:46,515 INFO L82 PathProgramCache]: Analyzing trace with hash 500492529, now seen corresponding path program 2 times [2019-11-15 21:36:46,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:46,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654318895] [2019-11-15 21:36:46,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:46,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:46,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:36:46,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654318895] [2019-11-15 21:36:46,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468019268] [2019-11-15 21:36:46,677 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a6d6a88-b758-482d-aa03-860d4335f265/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:36:46,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:36:46,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:36:46,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 21:36:46,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:36:46,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:36:46,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:46,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:46,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:36:46,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:36:46,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:46,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:36:46,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:46,960 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-15 21:36:46,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:36:46,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:46,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:46,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:36:46,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-15 21:36:47,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:36:47,031 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 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 21:36:47,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:47,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:47,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:36:47,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-15 21:36:47,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:47,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:36:47,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:47,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:47,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:36:47,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:47,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:47,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:36:47,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:26 [2019-11-15 21:36:47,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 21:36:47,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:47,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:47,208 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 21:36:47,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2019-11-15 21:36:47,239 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 0 case distinctions, treesize of input 26 treesize of output 18 [2019-11-15 21:36:47,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:47,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:47,250 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 21:36:47,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:11 [2019-11-15 21:36:47,276 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:36:47,279 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:47,279 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 15 treesize of output 10 [2019-11-15 21:36:47,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:47,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:47,286 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 21:36:47,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-15 21:36:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:36:47,299 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:36:47,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-15 21:36:47,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127604958] [2019-11-15 21:36:47,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:36:47,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:36:47,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:36:47,352 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 18 states. [2019-11-15 21:36:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:36:47,656 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-15 21:36:47,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:36:47,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2019-11-15 21:36:47,657 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:36:47,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-11-15 21:36:47,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:36:47,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:36:47,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:36:47,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:36:47,658 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:36:47,658 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:36:47,658 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:36:47,658 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:36:47,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:36:47,658 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:36:47,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:36:47,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:36:47 BoogieIcfgContainer [2019-11-15 21:36:47,663 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:36:47,663 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:36:47,663 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:36:47,664 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:36:47,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:36:42" (3/4) ... [2019-11-15 21:36:47,666 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:36:47,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:36:47,668 INFO L168 Benchmark]: Toolchain (without parser) took 6216.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.9 MB). Free memory was 935.7 MB in the beginning and 926.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 243.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:47,668 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:36:47,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:47,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.79 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:47,669 INFO L168 Benchmark]: Boogie Preprocessor took 58.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:36:47,670 INFO L168 Benchmark]: RCFGBuilder took 382.56 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:47,670 INFO L168 Benchmark]: BuchiAutomizer took 5104.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 926.7 MB in the end (delta: 167.7 MB). Peak memory consumption was 247.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:47,671 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 1.3 GB. Free memory is still 926.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:36:47,673 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 588.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.79 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.29 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 382.56 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5104.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 926.7 MB in the end (delta: 167.7 MB). Peak memory consumption was 247.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.38 ms. Allocated memory is still 1.3 GB. Free memory is still 926.7 MB. 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 7 terminating modules (6 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.9s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 131 SDslu, 68 SDs, 0 SdLazy, 279 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital188 mio100 ax109 hnf100 lsp86 ukn50 mio100 lsp31 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf170 smp100 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...