./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product49_true-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_spec5_product49_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 c3f15e5f0b48b2733d67e168986a8e79f37fa442 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:52:18,445 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:52:18,447 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:52:18,459 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:52:18,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:52:18,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:52:18,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:52:18,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:52:18,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:52:18,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:52:18,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:52:18,469 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:52:18,470 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:52:18,471 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:52:18,473 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:52:18,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:52:18,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:52:18,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:52:18,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:52:18,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:52:18,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:52:18,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:52:18,486 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:52:18,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:52:18,487 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:52:18,488 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:52:18,489 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:52:18,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:52:18,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:52:18,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:52:18,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:52:18,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:52:18,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:52:18,494 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:52:18,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:52:18,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:52:18,497 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:52:18,514 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:52:18,514 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:52:18,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:52:18,516 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:52:18,516 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:52:18,517 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:52:18,517 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:52:18,517 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:52:18,517 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:52:18,517 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:52:18,518 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:52:18,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:52:18,518 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:52:18,518 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:52:18,518 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:52:18,518 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:52:18,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:52:18,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:52:18,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:52:18,522 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:52:18,522 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:52:18,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:52:18,522 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:52:18,522 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:52:18,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:52:18,523 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:52:18,523 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:52:18,523 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:52:18,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:52:18,523 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:52:18,525 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:52:18,526 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:52:18,527 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 -> c3f15e5f0b48b2733d67e168986a8e79f37fa442 [2019-01-01 23:52:18,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:52:18,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:52:18,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:52:18,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:52:18,619 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:52:18,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product49_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:18,692 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e6c95a4/504e4ddc1a084040b6b7c9ab48c57f58/FLAGf9b371372 [2019-01-01 23:52:19,212 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:52:19,213 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product49_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:19,231 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e6c95a4/504e4ddc1a084040b6b7c9ab48c57f58/FLAGf9b371372 [2019-01-01 23:52:19,518 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e6c95a4/504e4ddc1a084040b6b7c9ab48c57f58 [2019-01-01 23:52:19,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:52:19,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:52:19,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:52:19,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:52:19,534 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:52:19,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:52:19" (1/1) ... [2019-01-01 23:52:19,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fb2347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:19, skipping insertion in model container [2019-01-01 23:52:19,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:52:19" (1/1) ... [2019-01-01 23:52:19,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:52:19,609 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:52:19,995 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:52:20,014 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:52:20,168 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:52:20,302 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:52:20,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20 WrapperNode [2019-01-01 23:52:20,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:52:20,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:52:20,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:52:20,305 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:52:20,315 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:52:20" (1/1) ... [2019-01-01 23:52:20,346 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:52:20" (1/1) ... [2019-01-01 23:52:20,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:52:20,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:52:20,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:52:20,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:52:20,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20" (1/1) ... [2019-01-01 23:52:20,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20" (1/1) ... [2019-01-01 23:52:20,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20" (1/1) ... [2019-01-01 23:52:20,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20" (1/1) ... [2019-01-01 23:52:20,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20" (1/1) ... [2019-01-01 23:52:20,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20" (1/1) ... [2019-01-01 23:52:20,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20" (1/1) ... [2019-01-01 23:52:20,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:52:20,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:52:20,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:52:20,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:52:20,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20" (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:52:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:52:20,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:52:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:52:20,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:52:22,082 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:52:22,083 INFO L280 CfgBuilder]: Removed 170 assue(true) statements. [2019-01-01 23:52:22,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:22 BoogieIcfgContainer [2019-01-01 23:52:22,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:52:22,084 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:52:22,084 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:52:22,088 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:52:22,089 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:22,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:52:19" (1/3) ... [2019-01-01 23:52:22,090 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@366bad0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:52:22, skipping insertion in model container [2019-01-01 23:52:22,090 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:22,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:20" (2/3) ... [2019-01-01 23:52:22,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@366bad0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:52:22, skipping insertion in model container [2019-01-01 23:52:22,091 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:22,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:22" (3/3) ... [2019-01-01 23:52:22,093 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product49_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:22,153 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:52:22,153 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:52:22,154 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:52:22,154 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:52:22,154 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:52:22,154 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:52:22,154 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:52:22,154 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:52:22,155 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:52:22,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states. [2019-01-01 23:52:22,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2019-01-01 23:52:22,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:22,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:22,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:22,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:22,214 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:52:22,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states. [2019-01-01 23:52:22,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2019-01-01 23:52:22,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:22,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:22,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:22,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:22,231 INFO L794 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(77, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(101, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(116, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(104, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string30.base, #t~string30.offset, 1);call write~init~int(82, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(73, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(84, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 4 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(75, #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(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~cleanupTimeShifts~0 := 4;~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);~switchedOnBeforeTS~0 := 0; 15#L-1true havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~8, main_~tmp~5;havoc main_~retValue_acc~8;havoc main_~tmp~5; 69#L556true havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 74#L564true main_#t~ret35 := valid_product_#res;main_~tmp~5 := main_#t~ret35;havoc main_#t~ret35; 76#L520true assume 0 != main_~tmp~5; 110#L492true ~switchedOnBeforeTS~0 := 0; 83#L941true havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 32#L962-1true [2019-01-01 23:52:22,231 INFO L796 eck$LassoCheckResult]: Loop: 32#L962-1true assume !false; 17#L266true assume test_~splverifierCounter~0 < 4; 77#L267true test_~tmp~4 := test_#t~nondet21;havoc test_#t~nondet21; 72#L275true assume !(0 != test_~tmp~4); 70#L275-1true test_~tmp___0~2 := test_#t~nondet22;havoc test_#t~nondet22; 11#L285true assume !(0 != test_~tmp___0~2); 7#L285-1true test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 51#L295true assume 0 != test_~tmp___2~0; 41#L301-2true havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 102#L173true __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 30#L951true assume !(0 != ~pumpRunning~0); 13#L62true assume !(0 != ~systemActive~0); 59#L69true havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 84#L396true __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 29#L962true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 32#L962-1true [2019-01-01 23:52:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:52:22,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:22,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:22,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:23,242 INFO L82 PathProgramCache]: Analyzing trace with hash 96105516, now seen corresponding path program 1 times [2019-01-01 23:52:23,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:23,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:23,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:23,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:23,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:23,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:23,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2030130726, now seen corresponding path program 1 times [2019-01-01 23:52:23,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:23,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:23,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:23,653 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:52:23,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:23,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:52:23,807 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:52:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:52:23,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:52:23,931 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 6 states. [2019-01-01 23:52:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:24,134 INFO L93 Difference]: Finished difference Result 123 states and 175 transitions. [2019-01-01 23:52:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:52:24,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 175 transitions. [2019-01-01 23:52:24,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2019-01-01 23:52:24,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 116 states and 168 transitions. [2019-01-01 23:52:24,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-01 23:52:24,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-01 23:52:24,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 168 transitions. [2019-01-01 23:52:24,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:24,156 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 168 transitions. [2019-01-01 23:52:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 168 transitions. [2019-01-01 23:52:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-01-01 23:52:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 23:52:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2019-01-01 23:52:24,199 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 168 transitions. [2019-01-01 23:52:24,199 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 168 transitions. [2019-01-01 23:52:24,199 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:52:24,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 168 transitions. [2019-01-01 23:52:24,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2019-01-01 23:52:24,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:24,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:24,207 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:24,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:24,209 INFO L794 eck$LassoCheckResult]: Stem: 357#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(77, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(101, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(116, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(104, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string30.base, #t~string30.offset, 1);call write~init~int(82, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(73, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(84, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 4 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(75, #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(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~cleanupTimeShifts~0 := 4;~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);~switchedOnBeforeTS~0 := 0; 287#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~8, main_~tmp~5;havoc main_~retValue_acc~8;havoc main_~tmp~5; 288#L556 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 353#L564 main_#t~ret35 := valid_product_#res;main_~tmp~5 := main_#t~ret35;havoc main_#t~ret35; 356#L520 assume 0 != main_~tmp~5; 358#L492 ~switchedOnBeforeTS~0 := 0; 364#L941 havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 315#L962-1 [2019-01-01 23:52:24,212 INFO L796 eck$LassoCheckResult]: Loop: 315#L962-1 assume !false; 291#L266 assume test_~splverifierCounter~0 < 4; 292#L267 test_~tmp~4 := test_#t~nondet21;havoc test_#t~nondet21; 354#L275 assume !(0 != test_~tmp~4); 342#L275-1 test_~tmp___0~2 := test_#t~nondet22;havoc test_#t~nondet22; 277#L285 assume !(0 != test_~tmp___0~2); 271#L285-1 test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 272#L295 assume 0 != test_~tmp___2~0; 326#L301-2 havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 327#L173 __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 316#L951 assume !(0 != ~pumpRunning~0); 285#L62 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 286#L120 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 310#L94-1 assume !(0 == ~pumpRunning~0); 304#L69 havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 345#L396 __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 313#L962 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 315#L962-1 [2019-01-01 23:52:24,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:24,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:52:24,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:24,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:24,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:24,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:24,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:24,552 INFO L82 PathProgramCache]: Analyzing trace with hash -477603702, now seen corresponding path program 1 times [2019-01-01 23:52:24,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:24,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:24,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:24,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:24,612 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:52:24,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:24,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:52:24,613 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:24,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:52:24,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:52:24,614 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. cyclomatic complexity: 54 Second operand 3 states. [2019-01-01 23:52:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:24,936 INFO L93 Difference]: Finished difference Result 165 states and 227 transitions. [2019-01-01 23:52:24,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:52:24,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 227 transitions. [2019-01-01 23:52:24,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 114 [2019-01-01 23:52:24,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 165 states and 227 transitions. [2019-01-01 23:52:24,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2019-01-01 23:52:24,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2019-01-01 23:52:24,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 227 transitions. [2019-01-01 23:52:24,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:24,963 INFO L705 BuchiCegarLoop]: Abstraction has 165 states and 227 transitions. [2019-01-01 23:52:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 227 transitions. [2019-01-01 23:52:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-01 23:52:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-01 23:52:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 227 transitions. [2019-01-01 23:52:24,980 INFO L728 BuchiCegarLoop]: Abstraction has 165 states and 227 transitions. [2019-01-01 23:52:24,980 INFO L608 BuchiCegarLoop]: Abstraction has 165 states and 227 transitions. [2019-01-01 23:52:24,980 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:52:24,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 227 transitions. [2019-01-01 23:52:24,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 114 [2019-01-01 23:52:24,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:24,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:24,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:24,985 INFO L867 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, 1] [2019-01-01 23:52:24,986 INFO L794 eck$LassoCheckResult]: Stem: 644#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(77, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(101, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(116, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(104, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string30.base, #t~string30.offset, 1);call write~init~int(82, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(73, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(84, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 4 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(75, #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(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~cleanupTimeShifts~0 := 4;~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);~switchedOnBeforeTS~0 := 0; 574#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~8, main_~tmp~5;havoc main_~retValue_acc~8;havoc main_~tmp~5; 575#L556 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 640#L564 main_#t~ret35 := valid_product_#res;main_~tmp~5 := main_#t~ret35;havoc main_#t~ret35; 643#L520 assume 0 != main_~tmp~5; 645#L492 ~switchedOnBeforeTS~0 := 0; 653#L941 havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 601#L962-1 [2019-01-01 23:52:24,986 INFO L796 eck$LassoCheckResult]: Loop: 601#L962-1 assume !false; 579#L266 assume test_~splverifierCounter~0 < 4; 580#L267 test_~tmp~4 := test_#t~nondet21;havoc test_#t~nondet21; 641#L275 assume !(0 != test_~tmp~4); 628#L275-1 test_~tmp___0~2 := test_#t~nondet22;havoc test_#t~nondet22; 564#L285 assume !(0 != test_~tmp___0~2); 560#L285-1 test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 561#L295 assume 0 != test_~tmp___2~0; 609#L301-2 havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 610#L173 __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 602#L951 assume !(0 != ~pumpRunning~0); 572#L62 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 573#L120 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 597#L94-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret19, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 624#L404-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 555#L409-1 isHighWaterLevel_#t~ret19 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret19;havoc isHighWaterLevel_#t~ret19; 556#L222-3 assume !(0 != isHighWaterLevel_~tmp~2);isHighWaterLevel_~tmp___0~0 := 1; 667#L222-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 664#L228-1 processEnvironment__wrappee__highWaterSensor_#t~ret0 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret0;havoc processEnvironment__wrappee__highWaterSensor_#t~ret0; 590#L98-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 592#L69 havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 632#L396 __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 599#L962 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 601#L962-1 [2019-01-01 23:52:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:24,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:52:24,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:24,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:24,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:24,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:24,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:25,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1457587912, now seen corresponding path program 1 times [2019-01-01 23:52:25,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:25,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:25,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:25,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:25,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:25,472 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:52:25,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:25,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:52:25,473 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:25,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:52:25,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:52:25,474 INFO L87 Difference]: Start difference. First operand 165 states and 227 transitions. cyclomatic complexity: 64 Second operand 4 states. [2019-01-01 23:52:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:26,177 INFO L93 Difference]: Finished difference Result 317 states and 429 transitions. [2019-01-01 23:52:26,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 23:52:26,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 429 transitions. [2019-01-01 23:52:26,181 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 224 [2019-01-01 23:52:26,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 317 states and 429 transitions. [2019-01-01 23:52:26,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2019-01-01 23:52:26,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2019-01-01 23:52:26,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 429 transitions. [2019-01-01 23:52:26,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:26,188 INFO L705 BuchiCegarLoop]: Abstraction has 317 states and 429 transitions. [2019-01-01 23:52:26,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 429 transitions. [2019-01-01 23:52:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 177. [2019-01-01 23:52:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-01 23:52:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2019-01-01 23:52:26,200 INFO L728 BuchiCegarLoop]: Abstraction has 177 states and 239 transitions. [2019-01-01 23:52:26,200 INFO L608 BuchiCegarLoop]: Abstraction has 177 states and 239 transitions. [2019-01-01 23:52:26,200 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:52:26,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 239 transitions. [2019-01-01 23:52:26,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 122 [2019-01-01 23:52:26,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:26,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:26,203 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:26,203 INFO L867 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, 1] [2019-01-01 23:52:26,203 INFO L794 eck$LassoCheckResult]: Stem: 1137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(77, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(101, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(116, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(104, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string30.base, #t~string30.offset, 1);call write~init~int(82, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(73, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(84, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 4 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(75, #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(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~cleanupTimeShifts~0 := 4;~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);~switchedOnBeforeTS~0 := 0; 1066#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~8, main_~tmp~5;havoc main_~retValue_acc~8;havoc main_~tmp~5; 1067#L556 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 1133#L564 main_#t~ret35 := valid_product_#res;main_~tmp~5 := main_#t~ret35;havoc main_#t~ret35; 1136#L520 assume 0 != main_~tmp~5; 1138#L492 ~switchedOnBeforeTS~0 := 0; 1146#L941 havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1093#L962-1 [2019-01-01 23:52:26,203 INFO L796 eck$LassoCheckResult]: Loop: 1093#L962-1 assume !false; 1071#L266 assume test_~splverifierCounter~0 < 4; 1072#L267 test_~tmp~4 := test_#t~nondet21;havoc test_#t~nondet21; 1134#L275 assume !(0 != test_~tmp~4); 1120#L275-1 test_~tmp___0~2 := test_#t~nondet22;havoc test_#t~nondet22; 1056#L285 assume !(0 != test_~tmp___0~2); 1050#L285-1 test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 1051#L295 assume 0 != test_~tmp___2~0; 1101#L301-2 havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 1102#L173 __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 1094#L951 assume !(0 != ~pumpRunning~0); 1062#L62 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 1063#L120 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 1089#L94-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret19, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 1116#L404-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 1154#L409-1 isHighWaterLevel_#t~ret19 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret19;havoc isHighWaterLevel_#t~ret19; 1167#L222-3 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~0 := 0; 1168#L222-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 1162#L228-1 processEnvironment__wrappee__highWaterSensor_#t~ret0 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret0;havoc processEnvironment__wrappee__highWaterSensor_#t~ret0; 1082#L98-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 1084#L69 havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 1124#L396 __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 1091#L962 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 1093#L962-1 [2019-01-01 23:52:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-01 23:52:26,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:26,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:26,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:26,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:26,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:26,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1062372022, now seen corresponding path program 1 times [2019-01-01 23:52:26,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:26,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:26,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:26,718 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:52:26,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:26,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:52:26,719 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:52:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:52:26,719 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. cyclomatic complexity: 64 Second operand 5 states. [2019-01-01 23:52:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:28,336 INFO L93 Difference]: Finished difference Result 457 states and 605 transitions. [2019-01-01 23:52:28,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:52:28,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 457 states and 605 transitions. [2019-01-01 23:52:28,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 295 [2019-01-01 23:52:28,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 457 states to 457 states and 605 transitions. [2019-01-01 23:52:28,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 457 [2019-01-01 23:52:28,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2019-01-01 23:52:28,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 457 states and 605 transitions. [2019-01-01 23:52:28,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:28,358 INFO L705 BuchiCegarLoop]: Abstraction has 457 states and 605 transitions. [2019-01-01 23:52:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states and 605 transitions. [2019-01-01 23:52:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 323. [2019-01-01 23:52:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-01-01 23:52:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 427 transitions. [2019-01-01 23:52:28,387 INFO L728 BuchiCegarLoop]: Abstraction has 323 states and 427 transitions. [2019-01-01 23:52:28,387 INFO L608 BuchiCegarLoop]: Abstraction has 323 states and 427 transitions. [2019-01-01 23:52:28,387 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:52:28,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 427 transitions. [2019-01-01 23:52:28,394 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 228 [2019-01-01 23:52:28,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:28,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:28,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:28,395 INFO L867 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, 1, 1, 1] [2019-01-01 23:52:28,395 INFO L794 eck$LassoCheckResult]: Stem: 1790#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(77, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(101, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(116, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(104, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string30.base, #t~string30.offset, 1);call write~init~int(82, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(73, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(84, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 4 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(75, #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(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~cleanupTimeShifts~0 := 4;~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);~switchedOnBeforeTS~0 := 0; 1716#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~8, main_~tmp~5;havoc main_~retValue_acc~8;havoc main_~tmp~5; 1717#L556 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 1783#L564 main_#t~ret35 := valid_product_#res;main_~tmp~5 := main_#t~ret35;havoc main_#t~ret35; 1789#L520 assume 0 != main_~tmp~5; 1791#L492 ~switchedOnBeforeTS~0 := 0; 1800#L941 havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1744#L962-1 [2019-01-01 23:52:28,396 INFO L796 eck$LassoCheckResult]: Loop: 1744#L962-1 assume !false; 1721#L266 assume test_~splverifierCounter~0 < 4; 1722#L267 test_~tmp~4 := test_#t~nondet21;havoc test_#t~nondet21; 1792#L275 assume !(0 != test_~tmp~4); 2015#L275-1 test_~tmp___0~2 := test_#t~nondet22;havoc test_#t~nondet22; 1706#L285 assume !(0 != test_~tmp___0~2); 1700#L285-1 test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 1701#L295 assume 0 != test_~tmp___2~0; 1755#L301-2 havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 2010#L173 __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 1743#L951 assume !(0 != ~pumpRunning~0); 1712#L62 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 1713#L120 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 1739#L94-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret19, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 1767#L404-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 1807#L409-1 isHighWaterLevel_#t~ret19 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret19;havoc isHighWaterLevel_#t~ret19; 1982#L222-3 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~0 := 0; 1981#L222-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 1813#L228-1 processEnvironment__wrappee__highWaterSensor_#t~ret0 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret0;havoc processEnvironment__wrappee__highWaterSensor_#t~ret0; 1732#L98-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 1734#L69 havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 1775#L396 __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 1741#L962 assume 2 != __utac_acc__Specification5_spec__3_~tmp~9;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 1742#L173-1 __utac_acc__Specification5_spec__3_#t~ret74 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~3 := __utac_acc__Specification5_spec__3_#t~ret74;havoc __utac_acc__Specification5_spec__3_#t~ret74; 1793#L966 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~3); 1744#L962-1 [2019-01-01 23:52:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 5 times [2019-01-01 23:52:28,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:28,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:28,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:28,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:28,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1262715471, now seen corresponding path program 1 times [2019-01-01 23:52:28,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:28,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:28,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1326141653, now seen corresponding path program 1 times [2019-01-01 23:52:28,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:30,380 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-01 23:52:30,776 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 23:52:57,877 WARN L181 SmtUtils]: Spent 27.08 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:53:11,851 WARN L181 SmtUtils]: Spent 13.96 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:53:11,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:53:11 BoogieIcfgContainer [2019-01-01 23:53:11,979 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:53:11,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:53:11,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:53:11,980 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:53:11,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:22" (3/4) ... [2019-01-01 23:53:11,987 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:53:12,097 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:53:12,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:53:12,098 INFO L168 Benchmark]: Toolchain (without parser) took 52572.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 211.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:12,107 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-01 23:53:12,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:12,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.34 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:12,109 INFO L168 Benchmark]: Boogie Preprocessor took 77.46 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:12,112 INFO L168 Benchmark]: RCFGBuilder took 1606.55 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:12,113 INFO L168 Benchmark]: BuchiAutomizer took 49895.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.3 MB). Peak memory consumption was 409.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:12,113 INFO L168 Benchmark]: Witness Printer took 117.96 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 23:53:12,123 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 774.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.34 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.46 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1606.55 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 49895.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.3 MB). Peak memory consumption was 409.0 MB. Max. memory is 11.5 GB. * Witness Printer took 117.96 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 323 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 49.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 46.5s. Construction of modules took 2.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 274 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 323 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 757 SDtfs, 1415 SDslu, 874 SDs, 0 SdLazy, 200 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time LassoAnalysisResults: nont1 unkn0 SFLI3 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: 265]: 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=-5, NULL=-21, NULL=0, NULL=0, retValue_acc=0, NULL=-15, NULL=-1, methaneLevelCritical=0, NULL=-4, retValue_acc=1, tmp=1, tmp___0=0, NULL=0, tmp=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, NULL=-22, NULL=0, tmp___1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e00b48f=0, NULL=0, NULL=0, NULL=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c0a82f8=0, NULL=-8, cleanupTimeShifts=4, NULL=-12, switchedOnBeforeTS=0, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ec8c8fa=0, \result=0, NULL=0, systemActive=1, waterLevel=1, NULL=-2, \result=1, NULL=0, NULL=0, NULL=0, NULL=-19, NULL=0, NULL=-11, \result=0, NULL=0, NULL=-3, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-36, \result=1, NULL=-10, head=0, pumpRunning=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34536ba5=0, NULL=-14, \result=0, retValue_acc=1, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5023e2e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74fb75c7=0, NULL=-37, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59f81cf1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7793339e=72, NULL=0, tmp=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b302ffa=0, \result=1, NULL=-17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d922c=0, tmp=1, tmp___2=72, tmp___0=0, NULL=-38, NULL=-7, retValue_acc=1, splverifierCounter=0, NULL=0, NULL=-6, NULL=-20, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26c16918=0, head=0, retValue_acc=0, NULL=0, NULL=0, NULL=-13, NULL=-9, NULL=-18} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L50] int pumpRunning = 0; [L51] int systemActive = 1; [L321] int waterLevel = 1; [L322] int methaneLevelCritical = 0; [L433] int cleanupTimeShifts = 4; [L738] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L935] int switchedOnBeforeTS ; [L511] int retValue_acc ; [L512] int tmp ; [L560] int retValue_acc ; [L563] retValue_acc = 1 [L564] return (retValue_acc); [L518] tmp = valid_product() [L520] COND TRUE \read(tmp) [L940] switchedOnBeforeTS = 0 [L256] int splverifierCounter ; [L257] int tmp ; [L258] int tmp___0 ; [L259] int tmp___1 ; [L260] int tmp___2 ; [L263] splverifierCounter = 0 Loop: [L265] COND TRUE 1 [L267] COND TRUE splverifierCounter < 4 [L273] tmp = __VERIFIER_nondet_int() [L275] COND FALSE !(\read(tmp)) [L283] tmp___0 = __VERIFIER_nondet_int() [L285] COND FALSE !(\read(tmp___0)) [L293] tmp___2 = __VERIFIER_nondet_int() [L295] COND TRUE \read(tmp___2) [L169] int retValue_acc ; [L172] retValue_acc = pumpRunning [L173] return (retValue_acc); [L949] switchedOnBeforeTS = isPumpRunning() [L62] COND FALSE !(\read(pumpRunning)) [L69] COND TRUE \read(systemActive) [L117] int tmp ; [L120] COND FALSE !(\read(pumpRunning)) [L91] int tmp ; [L94] COND TRUE ! pumpRunning [L214] int retValue_acc ; [L215] int tmp ; [L216] int tmp___0 ; [L401] int retValue_acc ; [L404] COND TRUE waterLevel < 2 [L405] retValue_acc = 1 [L406] return (retValue_acc); [L220] tmp = isHighWaterSensorDry() [L222] COND TRUE \read(tmp) [L223] tmp___0 = 0 [L227] retValue_acc = tmp___0 [L228] return (retValue_acc); [L96] tmp = isHighWaterLevel() [L98] COND FALSE !(\read(tmp)) [L955] int tmp ; [L956] int tmp___0 ; [L392] int retValue_acc ; [L395] retValue_acc = waterLevel [L396] return (retValue_acc); [L960] tmp = getWaterLevel() [L962] COND TRUE tmp != 2 [L169] int retValue_acc ; [L172] retValue_acc = pumpRunning [L173] return (retValue_acc); [L964] tmp___0 = isPumpRunning() [L966] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...