./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product55_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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_spec2_product55_true-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 d3b2c25dcf3994b536a04bc5bf3e1c9a29f5c50b .......................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-14 04:20:43,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:20:43,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:20:43,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:20:43,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:20:43,527 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:20:43,529 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:20:43,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:20:43,539 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:20:43,540 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:20:43,541 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:20:43,541 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:20:43,542 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:20:43,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:20:43,544 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:20:43,545 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:20:43,546 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:20:43,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:20:43,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:20:43,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:20:43,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:20:43,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:20:43,556 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:20:43,556 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:20:43,556 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:20:43,557 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:20:43,558 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:20:43,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:20:43,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:20:43,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:20:43,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:20:43,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:20:43,561 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:20:43,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:20:43,563 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:20:43,563 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:20:43,563 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:20:43,585 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:20:43,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:20:43,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:20:43,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:20:43,587 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:20:43,589 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:20:43,590 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:20:43,590 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:20:43,591 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:20:43,591 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:20:43,591 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:20:43,591 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:20:43,592 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:20:43,592 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:20:43,592 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:20:43,592 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:20:43,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:20:43,593 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:20:43,593 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:20:43,593 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:20:43,593 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:20:43,593 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:20:43,593 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:20:43,594 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:20:43,594 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:20:43,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:20:43,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:20:43,594 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:20:43,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:20:43,599 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:20:43,599 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:20:43,601 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:20:43,602 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 -> d3b2c25dcf3994b536a04bc5bf3e1c9a29f5c50b [2019-01-14 04:20:43,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:20:43,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:20:43,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:20:43,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:20:43,677 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:20:43,678 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product55_true-unreach-call_false-termination.cil.c [2019-01-14 04:20:43,741 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd98aaed/23cf3752a4794ef69e176e25bdb26f6e/FLAG983fa6b11 [2019-01-14 04:20:44,233 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:20:44,234 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product55_true-unreach-call_false-termination.cil.c [2019-01-14 04:20:44,260 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd98aaed/23cf3752a4794ef69e176e25bdb26f6e/FLAG983fa6b11 [2019-01-14 04:20:44,523 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd98aaed/23cf3752a4794ef69e176e25bdb26f6e [2019-01-14 04:20:44,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:20:44,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:20:44,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:20:44,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:20:44,533 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:20:44,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:20:44" (1/1) ... [2019-01-14 04:20:44,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20575267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:44, skipping insertion in model container [2019-01-14 04:20:44,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:20:44" (1/1) ... [2019-01-14 04:20:44,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:20:44,608 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:20:45,087 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:20:45,103 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:20:45,286 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:20:45,349 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:20:45,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45 WrapperNode [2019-01-14 04:20:45,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:20:45,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:20:45,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:20:45,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:20:45,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (1/1) ... [2019-01-14 04:20:45,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (1/1) ... [2019-01-14 04:20:45,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:20:45,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:20:45,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:20:45,492 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:20:45,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (1/1) ... [2019-01-14 04:20:45,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (1/1) ... [2019-01-14 04:20:45,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (1/1) ... [2019-01-14 04:20:45,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (1/1) ... [2019-01-14 04:20:45,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (1/1) ... [2019-01-14 04:20:45,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (1/1) ... [2019-01-14 04:20:45,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (1/1) ... [2019-01-14 04:20:45,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:20:45,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:20:45,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:20:45,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:20:45,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (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-14 04:20:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:20:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:20:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:20:45,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:20:47,192 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:20:47,192 INFO L286 CfgBuilder]: Removed 282 assue(true) statements. [2019-01-14 04:20:47,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:20:47 BoogieIcfgContainer [2019-01-14 04:20:47,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:20:47,195 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:20:47,196 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:20:47,199 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:20:47,200 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:20:47,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:20:44" (1/3) ... [2019-01-14 04:20:47,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c5583df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:20:47, skipping insertion in model container [2019-01-14 04:20:47,204 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:20:47,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:20:45" (2/3) ... [2019-01-14 04:20:47,204 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c5583df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:20:47, skipping insertion in model container [2019-01-14 04:20:47,205 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:20:47,205 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:20:47" (3/3) ... [2019-01-14 04:20:47,208 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec2_product55_true-unreach-call_false-termination.cil.c [2019-01-14 04:20:47,270 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:20:47,270 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:20:47,271 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:20:47,271 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:20:47,271 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:20:47,271 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:20:47,272 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:20:47,272 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:20:47,272 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:20:47,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states. [2019-01-14 04:20:47,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 125 [2019-01-14 04:20:47,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:20:47,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:20:47,350 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:47,351 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:47,352 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:20:47,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states. [2019-01-14 04:20:47,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 125 [2019-01-14 04:20:47,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:20:47,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:20:47,381 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:47,381 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:47,389 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(13);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string26.base, #t~string26.offset, 1);call write~init~int(80, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(117, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(109, #t~string26.base, 3 + #t~string26.offset, 1);call write~init~int(112, #t~string26.base, 4 + #t~string26.offset, 1);call write~init~int(58, #t~string26.base, 5 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 6 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(110, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string32.base, #t~string32.offset, 1);call write~init~int(32, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 2 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);~methAndRunningLastTime~0 := 0;~cleanupTimeShifts~0 := 4; 11#L-1true havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 15#L65true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 9#L73true main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 162#L991true assume 0 != main_~tmp~10; 69#L967true ~methAndRunningLastTime~0 := 0; 176#L875true havoc test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 178#L886-1true [2019-01-14 04:20:47,389 INFO L796 eck$LassoCheckResult]: Loop: 178#L886-1true assume !false; 192#L203true assume test_~splverifierCounter~0 < 4; 135#L204true test_~tmp~0 := test_#t~nondet11;havoc test_#t~nondet11; 123#L212true assume !(0 != test_~tmp~0); 120#L212-1true test_~tmp___0~0 := test_#t~nondet12;havoc test_#t~nondet12; 190#L222true assume !(0 != test_~tmp___0~0); 189#L222-1true test_~tmp___2~0 := test_#t~nondet13;havoc test_#t~nondet13; 60#L232true assume 0 != test_~tmp___2~0; 44#L238-1true assume !(0 != ~pumpRunning~0); 26#L271true assume !(0 != ~systemActive~0); 168#L278true havoc __utac_acc__Specification2_spec__2_#t~ret72, __utac_acc__Specification2_spec__2_#t~ret73, __utac_acc__Specification2_spec__2_~tmp~9, __utac_acc__Specification2_spec__2_~tmp___0~3;havoc __utac_acc__Specification2_spec__2_~tmp~9;havoc __utac_acc__Specification2_spec__2_~tmp___0~3;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 182#L129-1true __utac_acc__Specification2_spec__2_#t~ret72 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~9 := __utac_acc__Specification2_spec__2_#t~ret72;havoc __utac_acc__Specification2_spec__2_#t~ret72; 175#L886true assume !(0 != __utac_acc__Specification2_spec__2_~tmp~9);~methAndRunningLastTime~0 := 0; 178#L886-1true [2019-01-14 04:20:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:47,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:20:47,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:47,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:47,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:47,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:48,250 INFO L82 PathProgramCache]: Analyzing trace with hash 16390483, now seen corresponding path program 1 times [2019-01-14 04:20:48,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:48,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:48,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:48,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:48,274 INFO L82 PathProgramCache]: Analyzing trace with hash 849686989, now seen corresponding path program 1 times [2019-01-14 04:20:48,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:48,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:48,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:48,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:48,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:20:48,512 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-14 04:20:48,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:20:48,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:20:48,671 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:20:48,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:20:48,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:20:48,790 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 6 states. [2019-01-14 04:20:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:20:49,620 INFO L93 Difference]: Finished difference Result 430 states and 637 transitions. [2019-01-14 04:20:49,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:20:49,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 637 transitions. [2019-01-14 04:20:49,636 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 279 [2019-01-14 04:20:49,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 409 states and 616 transitions. [2019-01-14 04:20:49,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2019-01-14 04:20:49,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2019-01-14 04:20:49,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 616 transitions. [2019-01-14 04:20:49,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:20:49,666 INFO L706 BuchiCegarLoop]: Abstraction has 409 states and 616 transitions. [2019-01-14 04:20:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 616 transitions. [2019-01-14 04:20:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 229. [2019-01-14 04:20:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-14 04:20:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 343 transitions. [2019-01-14 04:20:49,716 INFO L729 BuchiCegarLoop]: Abstraction has 229 states and 343 transitions. [2019-01-14 04:20:49,716 INFO L609 BuchiCegarLoop]: Abstraction has 229 states and 343 transitions. [2019-01-14 04:20:49,716 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:20:49,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 343 transitions. [2019-01-14 04:20:49,720 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 156 [2019-01-14 04:20:49,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:20:49,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:20:49,721 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:49,721 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:49,723 INFO L794 eck$LassoCheckResult]: Stem: 817#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(13);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string26.base, #t~string26.offset, 1);call write~init~int(80, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(117, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(109, #t~string26.base, 3 + #t~string26.offset, 1);call write~init~int(112, #t~string26.base, 4 + #t~string26.offset, 1);call write~init~int(58, #t~string26.base, 5 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 6 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(110, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string32.base, #t~string32.offset, 1);call write~init~int(32, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 2 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);~methAndRunningLastTime~0 := 0;~cleanupTimeShifts~0 := 4; 654#L-1 havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 655#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 651#L73 main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 652#L991 assume 0 != main_~tmp~10; 739#L967 ~methAndRunningLastTime~0 := 0; 740#L875 havoc test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 748#L886-1 [2019-01-14 04:20:49,724 INFO L796 eck$LassoCheckResult]: Loop: 748#L886-1 assume !false; 825#L203 assume test_~splverifierCounter~0 < 4; 803#L204 test_~tmp~0 := test_#t~nondet11;havoc test_#t~nondet11; 791#L212 assume !(0 != test_~tmp~0); 787#L212-1 test_~tmp___0~0 := test_#t~nondet12;havoc test_#t~nondet12; 788#L222 assume !(0 != test_~tmp___0~0); 761#L222-1 test_~tmp___2~0 := test_#t~nondet13;havoc test_#t~nondet13; 732#L232 assume 0 != test_~tmp___2~0; 708#L238-1 assume !(0 != ~pumpRunning~0); 677#L271 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret17, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 678#L355 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret16, processEnvironment__wrappee__lowWaterSensor_~tmp~2;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~2; 661#L329-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret15, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 663#L303-3 assume !(0 == ~pumpRunning~0); 660#L278 havoc __utac_acc__Specification2_spec__2_#t~ret72, __utac_acc__Specification2_spec__2_#t~ret73, __utac_acc__Specification2_spec__2_~tmp~9, __utac_acc__Specification2_spec__2_~tmp___0~3;havoc __utac_acc__Specification2_spec__2_~tmp~9;havoc __utac_acc__Specification2_spec__2_~tmp___0~3;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 819#L129-1 __utac_acc__Specification2_spec__2_#t~ret72 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~9 := __utac_acc__Specification2_spec__2_#t~ret72;havoc __utac_acc__Specification2_spec__2_#t~ret72; 824#L886 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~9);~methAndRunningLastTime~0 := 0; 748#L886-1 [2019-01-14 04:20:49,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:49,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:20:49,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:49,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:49,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:49,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:50,023 INFO L82 PathProgramCache]: Analyzing trace with hash 566198012, now seen corresponding path program 1 times [2019-01-14 04:20:50,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:50,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:50,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:20:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:20:50,088 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-14 04:20:50,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:20:50,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:20:50,092 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:20:50,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:20:50,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:20:50,093 INFO L87 Difference]: Start difference. First operand 229 states and 343 transitions. cyclomatic complexity: 117 Second operand 3 states. [2019-01-14 04:20:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:20:50,858 INFO L93 Difference]: Finished difference Result 235 states and 329 transitions. [2019-01-14 04:20:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:20:50,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 329 transitions. [2019-01-14 04:20:50,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 164 [2019-01-14 04:20:50,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 235 states and 329 transitions. [2019-01-14 04:20:50,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2019-01-14 04:20:50,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2019-01-14 04:20:50,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 329 transitions. [2019-01-14 04:20:50,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:20:50,867 INFO L706 BuchiCegarLoop]: Abstraction has 235 states and 329 transitions. [2019-01-14 04:20:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 329 transitions. [2019-01-14 04:20:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-01-14 04:20:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 04:20:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 329 transitions. [2019-01-14 04:20:50,880 INFO L729 BuchiCegarLoop]: Abstraction has 235 states and 329 transitions. [2019-01-14 04:20:50,880 INFO L609 BuchiCegarLoop]: Abstraction has 235 states and 329 transitions. [2019-01-14 04:20:50,880 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:20:50,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 329 transitions. [2019-01-14 04:20:50,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 164 [2019-01-14 04:20:50,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:20:50,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:20:50,883 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:50,883 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:20:50,884 INFO L794 eck$LassoCheckResult]: Stem: 1257#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(13);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string26.base, #t~string26.offset, 1);call write~init~int(80, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(117, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(109, #t~string26.base, 3 + #t~string26.offset, 1);call write~init~int(112, #t~string26.base, 4 + #t~string26.offset, 1);call write~init~int(58, #t~string26.base, 5 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 6 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(110, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string32.base, #t~string32.offset, 1);call write~init~int(32, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 2 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);~methAndRunningLastTime~0 := 0;~cleanupTimeShifts~0 := 4; 1124#L-1 havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 1125#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 1122#L73 main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 1123#L991 assume 0 != main_~tmp~10; 1201#L967 ~methAndRunningLastTime~0 := 0; 1202#L875 havoc test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1267#L886-1 [2019-01-14 04:20:50,884 INFO L796 eck$LassoCheckResult]: Loop: 1267#L886-1 assume !false; 1330#L203 assume test_~splverifierCounter~0 < 4; 1331#L204 test_~tmp~0 := test_#t~nondet11;havoc test_#t~nondet11; 1344#L212 assume !(0 != test_~tmp~0); 1342#L212-1 test_~tmp___0~0 := test_#t~nondet12;havoc test_#t~nondet12; 1341#L222 assume !(0 != test_~tmp___0~0); 1339#L222-1 test_~tmp___2~0 := test_#t~nondet13;havoc test_#t~nondet13; 1196#L232 assume 0 != test_~tmp___2~0; 1173#L238-1 assume !(0 != ~pumpRunning~0); 1145#L271 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret17, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 1146#L355 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret16, processEnvironment__wrappee__lowWaterSensor_~tmp~2;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~2; 1132#L329-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret15, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 1133#L303-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret35, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 1149#L169-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~4 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 1150#L174-3 isHighWaterLevel_#t~ret35 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret35;havoc isHighWaterLevel_#t~ret35; 1225#L457-9 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 1224#L457-11 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 1215#L463-3 processEnvironment__wrappee__highWaterSensor_#t~ret15 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~1 := processEnvironment__wrappee__highWaterSensor_#t~ret15;havoc processEnvironment__wrappee__highWaterSensor_#t~ret15; 1140#L307-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~1); 1131#L278 havoc __utac_acc__Specification2_spec__2_#t~ret72, __utac_acc__Specification2_spec__2_#t~ret73, __utac_acc__Specification2_spec__2_~tmp~9, __utac_acc__Specification2_spec__2_~tmp___0~3;havoc __utac_acc__Specification2_spec__2_~tmp~9;havoc __utac_acc__Specification2_spec__2_~tmp___0~3;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 1336#L129-1 __utac_acc__Specification2_spec__2_#t~ret72 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~9 := __utac_acc__Specification2_spec__2_#t~ret72;havoc __utac_acc__Specification2_spec__2_#t~ret72; 1334#L886 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~9);~methAndRunningLastTime~0 := 0; 1267#L886-1 [2019-01-14 04:20:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:50,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:20:50,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:50,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:50,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:50,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:50,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:51,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:51,138 INFO L82 PathProgramCache]: Analyzing trace with hash -746930584, now seen corresponding path program 1 times [2019-01-14 04:20:51,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:51,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:51,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:51,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:20:51,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:20:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1614115026, now seen corresponding path program 1 times [2019-01-14 04:20:51,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:20:51,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:20:51,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:51,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:20:51,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:20:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:20:51,907 WARN L181 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-14 04:20:52,176 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 04:21:09,342 WARN L181 SmtUtils]: Spent 17.16 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:21:21,365 WARN L181 SmtUtils]: Spent 12.01 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:21:21,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:21:21 BoogieIcfgContainer [2019-01-14 04:21:21,445 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:21:21,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:21:21,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:21:21,446 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:21:21,448 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:20:47" (3/4) ... [2019-01-14 04:21:21,452 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:21:21,544 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:21:21,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:21:21,545 INFO L168 Benchmark]: Toolchain (without parser) took 37018.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.3 MB). Free memory was 952.7 MB in the beginning and 864.2 MB in the end (delta: 88.5 MB). Peak memory consumption was 386.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:21,548 INFO L168 Benchmark]: CDTParser took 0.16 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-14 04:21:21,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:21,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:21:21,549 INFO L168 Benchmark]: Boogie Preprocessor took 57.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:21,550 INFO L168 Benchmark]: RCFGBuilder took 1644.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:21,550 INFO L168 Benchmark]: BuchiAutomizer took 34250.25 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 873.8 MB in the end (delta: 127.1 MB). Peak memory consumption was 386.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:21,555 INFO L168 Benchmark]: Witness Printer took 98.17 ms. Allocated memory is still 1.3 GB. Free memory was 873.8 MB in the beginning and 864.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:21,565 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.16 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 820.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 141.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1644.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34250.25 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 873.8 MB in the end (delta: 127.1 MB). Peak memory consumption was 386.7 MB. Max. memory is 11.5 GB. * Witness Printer took 98.17 ms. Allocated memory is still 1.3 GB. Free memory was 873.8 MB in the beginning and 864.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 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 6 locations. The remainder module has 235 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 32.2s. Construction of modules took 1.3s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 180 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 235 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 502 SDtfs, 1249 SDslu, 1178 SDs, 0 SdLazy, 85 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.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: 202]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, NULL=0, NULL=-8, NULL=-5, NULL=0, NULL=0, NULL=-16, NULL=-23, methaneLevelCritical=0, NULL=-7, tmp=0, tmp___0=0, NULL=0, NULL=0, NULL=0, NULL=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38cf431=0, NULL=-6, NULL=0, NULL=-25, tmp___1=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-10, NULL=-4, cleanupTimeShifts=4, tmp=0, tmp=0, NULL=-14, tmp=1, NULL=0, systemActive=1, waterLevel=1, NULL=-24, NULL=0, NULL=0, NULL=-22, \result=0, retValue_acc=0, NULL=0, tmp___0=0, NULL=-17, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-1, \result=1, retValue_acc=0, head=0, pumpRunning=0, NULL=-18, \result=0, retValue_acc=1, NULL=-19, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a321a7a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34b35b5f=0, NULL=0, \result=1, NULL=-21, NULL=-9, tmp=1, retValue_acc=1, tmp___0=0, tmp___2=70, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60f58533=0, NULL=-20, NULL=-2, splverifierCounter=0, NULL=0, methAndRunningLastTime=0, \result=0, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@616d4fc6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f59374a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65bf094f=70, NULL=-15, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@794d0c95=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ca45968=0, tmp=0, head=0, NULL=0, NULL=0, NULL=-3, NULL=0, NULL=0, NULL=-13, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e37458d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61137b00=0, NULL=-12, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L86] int waterLevel = 1; [L87] int methaneLevelCritical = 0; [L263] int pumpRunning = 0; [L264] int systemActive = 1; [L671] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L869] int methAndRunningLastTime ; [L908] int cleanupTimeShifts = 4; [L982] int retValue_acc ; [L983] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L989] tmp = valid_product() [L991] COND TRUE \read(tmp) [L874] methAndRunningLastTime = 0 [L193] int splverifierCounter ; [L194] int tmp ; [L195] int tmp___0 ; [L196] int tmp___1 ; [L197] int tmp___2 ; [L200] splverifierCounter = 0 Loop: [L202] COND TRUE 1 [L204] COND TRUE splverifierCounter < 4 [L210] tmp = __VERIFIER_nondet_int() [L212] COND FALSE !(\read(tmp)) [L220] tmp___0 = __VERIFIER_nondet_int() [L222] COND FALSE !(\read(tmp___0)) [L230] tmp___2 = __VERIFIER_nondet_int() [L232] COND TRUE \read(tmp___2) [L271] COND FALSE !(\read(pumpRunning)) [L278] COND TRUE \read(systemActive) [L352] int tmp ; [L355] COND FALSE !(\read(pumpRunning)) [L326] int tmp ; [L329] COND FALSE !(\read(pumpRunning)) [L300] int tmp ; [L303] COND TRUE ! pumpRunning [L449] int retValue_acc ; [L450] int tmp ; [L451] int tmp___0 ; [L166] int retValue_acc ; [L169] COND TRUE waterLevel < 2 [L170] retValue_acc = 1 [L171] return (retValue_acc); [L455] tmp = isHighWaterSensorDry() [L457] COND TRUE \read(tmp) [L458] tmp___0 = 0 [L462] retValue_acc = tmp___0 [L463] return (retValue_acc); [L305] tmp = isHighWaterLevel() [L307] COND FALSE !(\read(tmp)) [L879] int tmp ; [L880] int tmp___0 ; [L125] int retValue_acc ; [L128] retValue_acc = methaneLevelCritical [L129] return (retValue_acc); [L884] tmp = isMethaneLevelCritical() [L886] COND FALSE !(\read(tmp)) [L902] methAndRunningLastTime = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...