./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product26_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec3_product26_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c4608a8062f27af1fb75c6b614ba3695c40f562a ............................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:42:36,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:42:36,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:42:36,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:42:36,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:42:36,438 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:42:36,440 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:42:36,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:42:36,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:42:36,447 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:42:36,448 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:42:36,448 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:42:36,449 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:42:36,451 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:42:36,452 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:42:36,453 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:42:36,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:42:36,456 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:42:36,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:42:36,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:42:36,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:42:36,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:42:36,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:42:36,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:42:36,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:42:36,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:42:36,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:42:36,472 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:42:36,473 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:42:36,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:42:36,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:42:36,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:42:36,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:42:36,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:42:36,479 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:42:36,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:42:36,481 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:42:36,507 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:42:36,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:42:36,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:42:36,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:42:36,509 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:42:36,509 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:42:36,510 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:42:36,510 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:42:36,510 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:42:36,510 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:42:36,510 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:42:36,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:42:36,512 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:42:36,512 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:42:36,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:42:36,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:42:36,513 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:42:36,513 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:42:36,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:42:36,513 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:42:36,514 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:42:36,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:42:36,515 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:42:36,515 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:42:36,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:42:36,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:42:36,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:42:36,516 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:42:36,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:42:36,516 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:42:36,516 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:42:36,518 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:42:36,519 INFO L133 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c4608a8062f27af1fb75c6b614ba3695c40f562a [2019-01-01 23:42:36,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:42:36,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:42:36,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:42:36,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:42:36,592 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:42:36,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product26_false-unreach-call_false-termination.cil.c [2019-01-01 23:42:36,667 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e165cc5e/3b30fbef4db0474f9ca2122b50ea754a/FLAG512a81996 [2019-01-01 23:42:37,191 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:42:37,192 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product26_false-unreach-call_false-termination.cil.c [2019-01-01 23:42:37,205 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e165cc5e/3b30fbef4db0474f9ca2122b50ea754a/FLAG512a81996 [2019-01-01 23:42:37,487 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e165cc5e/3b30fbef4db0474f9ca2122b50ea754a [2019-01-01 23:42:37,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:42:37,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:42:37,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:42:37,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:42:37,497 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:42:37,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:42:37" (1/1) ... [2019-01-01 23:42:37,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:37, skipping insertion in model container [2019-01-01 23:42:37,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:42:37" (1/1) ... [2019-01-01 23:42:37,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:42:37,563 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:42:38,013 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:42:38,033 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:42:38,220 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:42:38,264 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:42:38,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38 WrapperNode [2019-01-01 23:42:38,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:42:38,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:42:38,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:42:38,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:42:38,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... [2019-01-01 23:42:38,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... [2019-01-01 23:42:38,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:42:38,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:42:38,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:42:38,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:42:38,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... [2019-01-01 23:42:38,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... [2019-01-01 23:42:38,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... [2019-01-01 23:42:38,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... [2019-01-01 23:42:38,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... [2019-01-01 23:42:38,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... [2019-01-01 23:42:38,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... [2019-01-01 23:42:38,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:42:38,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:42:38,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:42:38,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:42:38,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 23:42:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:42:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:42:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:42:38,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:42:39,670 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:42:39,671 INFO L280 CfgBuilder]: Removed 104 assue(true) statements. [2019-01-01 23:42:39,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:42:39 BoogieIcfgContainer [2019-01-01 23:42:39,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:42:39,672 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:42:39,672 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:42:39,676 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:42:39,677 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:42:39,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:42:37" (1/3) ... [2019-01-01 23:42:39,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d310875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:42:39, skipping insertion in model container [2019-01-01 23:42:39,678 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:42:39,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:38" (2/3) ... [2019-01-01 23:42:39,679 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d310875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:42:39, skipping insertion in model container [2019-01-01 23:42:39,679 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:42:39,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:42:39" (3/3) ... [2019-01-01 23:42:39,681 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product26_false-unreach-call_false-termination.cil.c [2019-01-01 23:42:39,739 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:42:39,739 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:42:39,740 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:42:39,740 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:42:39,740 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:42:39,740 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:42:39,740 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:42:39,740 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:42:39,741 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:42:39,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states. [2019-01-01 23:42:39,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:42:39,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:39,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:39,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:39,796 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:42:39,796 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:42:39,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states. [2019-01-01 23:42:39,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:42:39,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:39,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:39,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:39,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:42:39,810 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(13);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string5.base, #t~string5.offset, 1);call write~init~int(77, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(101, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(116, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(104, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(58, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string7.base, #t~string7.offset, 1);call write~init~int(82, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(73, #t~string7.base, 2 + #t~string7.offset, 1);call write~init~int(84, #t~string7.base, 3 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 4 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(75, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string11.base, #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 1 + #t~string11.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(21);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(30);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(9);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(25);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(13);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(110, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string57.base, #t~string57.offset, 1);call write~init~int(80, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(117, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(109, #t~string57.base, 3 + #t~string57.offset, 1);call write~init~int(112, #t~string57.base, 4 + #t~string57.offset, 1);call write~init~int(58, #t~string57.base, 5 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 6 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string63.base, #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string65.base, #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 1 + #t~string65.offset, 1); 10#L-1true havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 39#L166true havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 78#L174true main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 71#L130true assume 0 != main_~tmp~0; 23#L103true havoc test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 76#L913-1true [2019-01-01 23:42:39,811 INFO L796 eck$LassoCheckResult]: Loop: 76#L913-1true assume !false; 43#L842true assume test_~splverifierCounter~0 < 4; 63#L843true test_~tmp~7 := test_#t~nondet67;havoc test_#t~nondet67; 65#L851true assume !(0 != test_~tmp~7); 69#L851-1true test_~tmp___0~1 := test_#t~nondet68;havoc test_#t~nondet68; 49#L861true assume !(0 != test_~tmp___0~1); 52#L861-1true test_~tmp___2~0 := test_#t~nondet69;havoc test_#t~nondet69; 34#L871true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 40#L879-2true assume !(0 != ~pumpRunning~0); 44#L660true assume !(0 != ~systemActive~0); 56#L667true havoc __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_#t~ret73, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 36#L227true __utac_acc__Specification3_spec__1_#t~ret71 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret71;havoc __utac_acc__Specification3_spec__1_#t~ret71; 26#L907true assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 76#L913-1true [2019-01-01 23:42:39,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:42:39,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:39,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:39,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:39,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:39,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1680729482, now seen corresponding path program 1 times [2019-01-01 23:42:40,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:40,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:40,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:40,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:40,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:42:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:42:40,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:42:40,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:42:40,955 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:42:40,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:42:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:42:40,977 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2019-01-01 23:42:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:42:41,070 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2019-01-01 23:42:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:42:41,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 107 transitions. [2019-01-01 23:42:41,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-01 23:42:41,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 99 transitions. [2019-01-01 23:42:41,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-01-01 23:42:41,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-01 23:42:41,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2019-01-01 23:42:41,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:42:41,090 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-01 23:42:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2019-01-01 23:42:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-01 23:42:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 23:42:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-01-01 23:42:41,138 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-01 23:42:41,138 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-01 23:42:41,138 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:42:41,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2019-01-01 23:42:41,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-01 23:42:41,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:41,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:41,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:41,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:42:41,145 INFO L794 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(13);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string5.base, #t~string5.offset, 1);call write~init~int(77, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(101, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(116, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(104, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(58, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string7.base, #t~string7.offset, 1);call write~init~int(82, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(73, #t~string7.base, 2 + #t~string7.offset, 1);call write~init~int(84, #t~string7.base, 3 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 4 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(75, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string11.base, #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 1 + #t~string11.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(21);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(30);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(9);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(25);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(13);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(110, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string57.base, #t~string57.offset, 1);call write~init~int(80, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(117, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(109, #t~string57.base, 3 + #t~string57.offset, 1);call write~init~int(112, #t~string57.base, 4 + #t~string57.offset, 1);call write~init~int(58, #t~string57.base, 5 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 6 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string63.base, #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string65.base, #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 1 + #t~string65.offset, 1); 173#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 174#L166 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 217#L174 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 234#L130 assume 0 != main_~tmp~0; 195#L103 havoc test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 170#L913-1 [2019-01-01 23:42:41,146 INFO L796 eck$LassoCheckResult]: Loop: 170#L913-1 assume !false; 220#L842 assume test_~splverifierCounter~0 < 4; 221#L843 test_~tmp~7 := test_#t~nondet67;havoc test_#t~nondet67; 231#L851 assume !(0 != test_~tmp~7); 223#L851-1 test_~tmp___0~1 := test_#t~nondet68;havoc test_#t~nondet68; 224#L861 assume !(0 != test_~tmp___0~1); 225#L861-1 test_~tmp___2~0 := test_#t~nondet69;havoc test_#t~nondet69; 211#L871 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 212#L879-2 assume !(0 != ~pumpRunning~0); 172#L660 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret47, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 200#L692 assume !(0 != ~pumpRunning~0); 202#L667 havoc __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_#t~ret73, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 215#L227 __utac_acc__Specification3_spec__1_#t~ret71 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret71;havoc __utac_acc__Specification3_spec__1_#t~ret71; 198#L907 assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 170#L913-1 [2019-01-01 23:42:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:42:41,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:41,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:41,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:41,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash -589998930, now seen corresponding path program 1 times [2019-01-01 23:42:41,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:41,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:41,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:41,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:42:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:41,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:41,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1013040596, now seen corresponding path program 1 times [2019-01-01 23:42:41,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:41,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:41,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:41,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:41,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:42:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:42:41,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:42:41,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:42:42,108 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-01 23:42:42,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:42:42,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:42:42,177 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 30 Second operand 5 states. [2019-01-01 23:42:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:42:42,711 INFO L93 Difference]: Finished difference Result 241 states and 345 transitions. [2019-01-01 23:42:42,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:42:42,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 345 transitions. [2019-01-01 23:42:42,729 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-01-01 23:42:42,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 241 states and 345 transitions. [2019-01-01 23:42:42,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2019-01-01 23:42:42,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2019-01-01 23:42:42,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 345 transitions. [2019-01-01 23:42:42,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:42:42,748 INFO L705 BuchiCegarLoop]: Abstraction has 241 states and 345 transitions. [2019-01-01 23:42:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 345 transitions. [2019-01-01 23:42:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 136. [2019-01-01 23:42:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-01 23:42:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2019-01-01 23:42:42,769 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 188 transitions. [2019-01-01 23:42:42,769 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 188 transitions. [2019-01-01 23:42:42,769 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:42:42,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 188 transitions. [2019-01-01 23:42:42,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 94 [2019-01-01 23:42:42,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:42,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:42,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:42,774 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:42:42,774 INFO L794 eck$LassoCheckResult]: Stem: 533#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(13);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string5.base, #t~string5.offset, 1);call write~init~int(77, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(101, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(116, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(104, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(58, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string7.base, #t~string7.offset, 1);call write~init~int(82, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(73, #t~string7.base, 2 + #t~string7.offset, 1);call write~init~int(84, #t~string7.base, 3 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 4 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(75, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string11.base, #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 1 + #t~string11.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(21);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(30);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(9);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(25);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(13);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(110, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string57.base, #t~string57.offset, 1);call write~init~int(80, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(117, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(109, #t~string57.base, 3 + #t~string57.offset, 1);call write~init~int(112, #t~string57.base, 4 + #t~string57.offset, 1);call write~init~int(58, #t~string57.base, 5 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 6 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string63.base, #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string65.base, #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 1 + #t~string65.offset, 1); 503#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 504#L166 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 550#L174 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 583#L130 assume 0 != main_~tmp~0; 521#L103 havoc test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 522#L913-1 [2019-01-01 23:42:42,778 INFO L796 eck$LassoCheckResult]: Loop: 522#L913-1 assume !false; 616#L842 assume test_~splverifierCounter~0 < 4; 617#L843 test_~tmp~7 := test_#t~nondet67;havoc test_#t~nondet67; 630#L851 assume !(0 != test_~tmp~7); 628#L851-1 test_~tmp___0~1 := test_#t~nondet68;havoc test_#t~nondet68; 561#L861 assume !(0 != test_~tmp___0~1); 562#L861-1 test_~tmp___2~0 := test_#t~nondet69;havoc test_#t~nondet69; 567#L871 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 622#L879-2 assume !(0 != ~pumpRunning~0); 621#L660 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret47, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 620#L692 assume !(0 != ~pumpRunning~0); 618#L667 havoc __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_#t~ret73, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 546#L227 __utac_acc__Specification3_spec__1_#t~ret71 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret71;havoc __utac_acc__Specification3_spec__1_#t~ret71; 547#L907 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~8);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~4;havoc getWaterLevel_~retValue_acc~4;getWaterLevel_~retValue_acc~4 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~4; 517#L259 __utac_acc__Specification3_spec__1_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret72;havoc __utac_acc__Specification3_spec__1_#t~ret72; 518#L913 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 522#L913-1 [2019-01-01 23:42:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:42,778 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:42:42,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:42,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:42,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:42,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:42,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:43,107 INFO L82 PathProgramCache]: Analyzing trace with hash -53282720, now seen corresponding path program 1 times [2019-01-01 23:42:43,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:43,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:43,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:43,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:42:43,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1425557498, now seen corresponding path program 1 times [2019-01-01 23:42:43,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:43,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:43,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:43,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:43,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:44,026 WARN L181 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-01-01 23:42:44,272 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:43:07,863 WARN L181 SmtUtils]: Spent 23.58 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:43:21,772 WARN L181 SmtUtils]: Spent 13.91 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:43:21,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:43:21 BoogieIcfgContainer [2019-01-01 23:43:21,864 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:43:21,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:43:21,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:43:21,865 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:43:21,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:42:39" (3/4) ... [2019-01-01 23:43:21,870 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:43:21,956 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:43:21,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:43:21,958 INFO L168 Benchmark]: Toolchain (without parser) took 44465.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.5 MB). Free memory was 948.7 MB in the beginning and 876.4 MB in the end (delta: 72.3 MB). Peak memory consumption was 385.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:21,959 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:43:21,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:21,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.48 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:21,962 INFO L168 Benchmark]: Boogie Preprocessor took 45.73 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-01-01 23:43:21,963 INFO L168 Benchmark]: RCFGBuilder took 1282.86 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:21,963 INFO L168 Benchmark]: BuchiAutomizer took 42191.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 878.5 MB in the end (delta: 177.7 MB). Peak memory consumption was 426.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:21,965 INFO L168 Benchmark]: Witness Printer took 92.53 ms. Allocated memory is still 1.3 GB. Free memory was 878.5 MB in the beginning and 876.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:21,969 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 771.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.48 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.73 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 1282.86 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42191.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 878.5 MB in the end (delta: 177.7 MB). Peak memory consumption was 426.9 MB. Max. memory is 11.5 GB. * Witness Printer took 92.53 ms. Allocated memory is still 1.3 GB. Free memory was 878.5 MB in the beginning and 876.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. 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 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 136 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 41.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 105 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 136 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 239 SDtfs, 466 SDslu, 400 SDs, 0 SdLazy, 46 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 841]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=746} State at position 1 is {NULL=0, NULL=-10, NULL=0, retValue_acc=0, NULL=746, NULL=0, NULL=0, NULL=0, NULL=-2, NULL=0, NULL=-22, NULL=0, NULL=0, NULL=-14, methaneLevelCritical=0, NULL=0, NULL=-15, NULL=-9, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cac3ae5=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8e7c666=0, tmp___1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a64e390=0, NULL=-11, cleanupTimeShifts=4, NULL=-7, NULL=-8, NULL=-16, NULL=-6, tmp=0, tmp___0=1, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cadcbe8=0, NULL=-17, NULL=0, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, tmp=1, NULL=745, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b408e16=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e365039=64, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27fad56b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18f6ca8=0, NULL=0, NULL=0, NULL=-12, NULL=-3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22d214f2=0, NULL=-23, retValue_acc=1, tmp___2=64, retValue_acc=1, NULL=-4, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=0, NULL=743, NULL=-18, tmp___1=0, head=0, tmp=0, NULL=-5, NULL=0, NULL=-24, NULL=0, NULL=-21, NULL=-13, NULL=0, NULL=-20, NULL=-19} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L40] int cleanupTimeShifts = 4; [L184] int waterLevel = 1; [L185] int methaneLevelCritical = 0; [L442] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L652] int pumpRunning = 0; [L653] int systemActive = 1; [L121] int retValue_acc ; [L122] int tmp ; [L170] int retValue_acc ; [L173] retValue_acc = 1 [L174] return (retValue_acc); [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) [L832] int splverifierCounter ; [L833] int tmp ; [L834] int tmp___0 ; [L835] int tmp___1 ; [L836] int tmp___2 ; [L839] splverifierCounter = 0 Loop: [L841] COND TRUE 1 [L843] COND TRUE splverifierCounter < 4 [L849] tmp = __VERIFIER_nondet_int() [L851] COND FALSE !(\read(tmp)) [L859] tmp___0 = __VERIFIER_nondet_int() [L861] COND FALSE !(\read(tmp___0)) [L869] tmp___2 = __VERIFIER_nondet_int() [L871] COND TRUE \read(tmp___2) [L826] systemActive = 1 [L660] COND FALSE !(\read(pumpRunning)) [L667] COND TRUE \read(systemActive) [L689] int tmp ; [L692] COND FALSE !(\read(pumpRunning)) [L899] int tmp ; [L900] int tmp___0 ; [L901] int tmp___1 ; [L223] int retValue_acc ; [L226] retValue_acc = methaneLevelCritical [L227] return (retValue_acc); [L905] tmp = isMethaneLevelCritical() [L907] COND FALSE !(\read(tmp)) [L255] int retValue_acc ; [L258] retValue_acc = waterLevel [L259] return (retValue_acc); [L911] tmp___0 = getWaterLevel() [L913] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...