./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product47_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_product47_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 c5a0b2bcaab730b804e6efb5bb851b66755fb542 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:11,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:52:11,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:52:11,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:52:11,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:52:11,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:52:11,301 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:52:11,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:52:11,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:52:11,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:52:11,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:52:11,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:52:11,313 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:52:11,316 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:52:11,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:52:11,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:52:11,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:52:11,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:52:11,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:52:11,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:52:11,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:52:11,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:52:11,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:52:11,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:52:11,335 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:52:11,336 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:52:11,337 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:52:11,338 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:52:11,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:52:11,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:52:11,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:52:11,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:52:11,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:52:11,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:52:11,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:52:11,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:52:11,343 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:11,365 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:52:11,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:52:11,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:52:11,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:52:11,368 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:52:11,368 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:52:11,368 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:52:11,368 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:52:11,368 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:52:11,369 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:52:11,369 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:52:11,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:52:11,369 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:52:11,369 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:52:11,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:52:11,370 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:52:11,371 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:52:11,371 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:52:11,371 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:52:11,371 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:52:11,371 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:52:11,371 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:52:11,372 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:52:11,372 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:52:11,372 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:52:11,372 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:52:11,372 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:52:11,372 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:52:11,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:52:11,376 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:52:11,376 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:52:11,377 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:52:11,377 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 -> c5a0b2bcaab730b804e6efb5bb851b66755fb542 [2019-01-01 23:52:11,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:52:11,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:52:11,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:52:11,450 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:52:11,451 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:52:11,452 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product47_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:11,517 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b9a39f3/ba154ae502ed4ee5aeb7fe452af6c0ff/FLAGd5af5f6c9 [2019-01-01 23:52:12,105 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:52:12,108 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product47_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:12,124 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b9a39f3/ba154ae502ed4ee5aeb7fe452af6c0ff/FLAGd5af5f6c9 [2019-01-01 23:52:12,322 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b9a39f3/ba154ae502ed4ee5aeb7fe452af6c0ff [2019-01-01 23:52:12,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:52:12,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:52:12,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:52:12,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:52:12,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:52:12,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:52:12" (1/1) ... [2019-01-01 23:52:12,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52869081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:12, skipping insertion in model container [2019-01-01 23:52:12,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:52:12" (1/1) ... [2019-01-01 23:52:12,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:52:12,413 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:52:12,825 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:52:12,842 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:52:12,922 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:52:12,963 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:52:12,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:12 WrapperNode [2019-01-01 23:52:12,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:52:12,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:52:12,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:52:12,966 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:52:13,047 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:12" (1/1) ... [2019-01-01 23:52:13,079 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:12" (1/1) ... [2019-01-01 23:52:13,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:52:13,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:52:13,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:52:13,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:52:13,155 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:12" (1/1) ... [2019-01-01 23:52:13,155 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:12" (1/1) ... [2019-01-01 23:52:13,168 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:12" (1/1) ... [2019-01-01 23:52:13,169 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:12" (1/1) ... [2019-01-01 23:52:13,195 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:12" (1/1) ... [2019-01-01 23:52:13,213 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:12" (1/1) ... [2019-01-01 23:52:13,216 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:12" (1/1) ... [2019-01-01 23:52:13,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:52:13,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:52:13,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:52:13,222 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:52:13,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:12" (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:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:52:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:52:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:52:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:52:14,684 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:52:14,685 INFO L280 CfgBuilder]: Removed 210 assue(true) statements. [2019-01-01 23:52:14,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:14 BoogieIcfgContainer [2019-01-01 23:52:14,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:52:14,686 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:52:14,686 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:52:14,691 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:52:14,692 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:14,692 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:52:12" (1/3) ... [2019-01-01 23:52:14,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c562624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:52:14, skipping insertion in model container [2019-01-01 23:52:14,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:14,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:12" (2/3) ... [2019-01-01 23:52:14,695 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c562624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:52:14, skipping insertion in model container [2019-01-01 23:52:14,695 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:14,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:14" (3/3) ... [2019-01-01 23:52:14,697 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product47_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:14,757 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:52:14,758 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:52:14,758 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:52:14,758 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:52:14,758 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:52:14,758 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:52:14,759 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:52:14,759 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:52:14,759 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:52:14,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states. [2019-01-01 23:52:14,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2019-01-01 23:52:14,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:14,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:14,825 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:14,825 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:14,825 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:52:14,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states. [2019-01-01 23:52:14,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2019-01-01 23:52:14,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:14,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:14,839 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:14,839 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:14,845 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(110, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 5#L-1true havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 4#L833true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 7#L841true main_#t~ret25 := valid_product_#res;main_~tmp~5 := main_#t~ret25;havoc main_#t~ret25; 19#L431true assume 0 != main_~tmp~5; 30#L403true ~switchedOnBeforeTS~0 := 0; 121#L853true havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 8#L874-1true [2019-01-01 23:52:14,846 INFO L796 eck$LassoCheckResult]: Loop: 8#L874-1true assume !false; 10#L288true assume test_~splverifierCounter~0 < 4; 113#L289true test_~tmp~4 := test_#t~nondet21;havoc test_#t~nondet21; 106#L297true assume !(0 != test_~tmp~4); 104#L297-1true test_~tmp___0~1 := test_#t~nondet22;havoc test_#t~nondet22; 11#L307true assume !(0 != test_~tmp___0~1); 15#L307-1true test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 73#L317true assume 0 != test_~tmp___2~0; 44#L323-1true havoc __utac_acc__Specification5_spec__2_#t~ret62;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; 46#L199true __utac_acc__Specification5_spec__2_#t~ret62 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret62;havoc __utac_acc__Specification5_spec__2_#t~ret62; 28#L863true assume !(0 != ~pumpRunning~0); 120#L71true assume !(0 != ~systemActive~0); 57#L78true havoc __utac_acc__Specification5_spec__3_#t~ret63, __utac_acc__Specification5_spec__3_#t~ret64, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 130#L971true __utac_acc__Specification5_spec__3_#t~ret63 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret63;havoc __utac_acc__Specification5_spec__3_#t~ret63; 27#L874true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 8#L874-1true [2019-01-01 23:52:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:52:14,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:14,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:14,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:14,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:14,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:15,747 INFO L82 PathProgramCache]: Analyzing trace with hash -239583083, now seen corresponding path program 1 times [2019-01-01 23:52:15,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:15,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:15,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:15,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1694442127, now seen corresponding path program 1 times [2019-01-01 23:52:15,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:15,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:15,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:15,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:15,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:16,212 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:16,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:16,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:52:16,333 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:52:16,447 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:52:16,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:52:16,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:52:16,488 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 6 states. [2019-01-01 23:52:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:17,349 INFO L93 Difference]: Finished difference Result 325 states and 460 transitions. [2019-01-01 23:52:17,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:52:17,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 460 transitions. [2019-01-01 23:52:17,375 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 211 [2019-01-01 23:52:17,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 304 states and 439 transitions. [2019-01-01 23:52:17,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2019-01-01 23:52:17,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2019-01-01 23:52:17,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 304 states and 439 transitions. [2019-01-01 23:52:17,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:17,404 INFO L705 BuchiCegarLoop]: Abstraction has 304 states and 439 transitions. [2019-01-01 23:52:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states and 439 transitions. [2019-01-01 23:52:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 179. [2019-01-01 23:52:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-01 23:52:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 257 transitions. [2019-01-01 23:52:17,472 INFO L728 BuchiCegarLoop]: Abstraction has 179 states and 257 transitions. [2019-01-01 23:52:17,473 INFO L608 BuchiCegarLoop]: Abstraction has 179 states and 257 transitions. [2019-01-01 23:52:17,473 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:52:17,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 257 transitions. [2019-01-01 23:52:17,475 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 124 [2019-01-01 23:52:17,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:17,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:17,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:17,478 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:17,478 INFO L794 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(110, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 482#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 480#L833 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 481#L841 main_#t~ret25 := valid_product_#res;main_~tmp~5 := main_#t~ret25;havoc main_#t~ret25; 485#L431 assume 0 != main_~tmp~5; 509#L403 ~switchedOnBeforeTS~0 := 0; 531#L853 havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 486#L874-1 [2019-01-01 23:52:17,478 INFO L796 eck$LassoCheckResult]: Loop: 486#L874-1 assume !false; 487#L288 assume test_~splverifierCounter~0 < 4; 491#L289 test_~tmp~4 := test_#t~nondet21;havoc test_#t~nondet21; 606#L297 assume !(0 != test_~tmp~4); 604#L297-1 test_~tmp___0~1 := test_#t~nondet22;havoc test_#t~nondet22; 493#L307 assume !(0 != test_~tmp___0~1); 495#L307-1 test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 504#L317 assume 0 != test_~tmp___2~0; 549#L323-1 havoc __utac_acc__Specification5_spec__2_#t~ret62;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; 554#L199 __utac_acc__Specification5_spec__2_#t~ret62 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret62;havoc __utac_acc__Specification5_spec__2_#t~ret62; 528#L863 assume !(0 != ~pumpRunning~0); 530#L71 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 610#L129 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret0, processEnvironment__wrappee__methaneQuery_~tmp~0;havoc processEnvironment__wrappee__methaneQuery_~tmp~0; 515#L103-1 assume !(0 == ~pumpRunning~0); 517#L78 havoc __utac_acc__Specification5_spec__3_#t~ret63, __utac_acc__Specification5_spec__3_#t~ret64, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 568#L971 __utac_acc__Specification5_spec__3_#t~ret63 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret63;havoc __utac_acc__Specification5_spec__3_#t~ret63; 526#L874 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 486#L874-1 [2019-01-01 23:52:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:52:17,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:17,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:17,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:17,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:17,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1391395369, now seen corresponding path program 1 times [2019-01-01 23:52:17,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:17,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:17,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:17,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:17,927 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:17,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:17,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:52:17,931 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:17,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:52:17,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:52:17,932 INFO L87 Difference]: Start difference. First operand 179 states and 257 transitions. cyclomatic complexity: 81 Second operand 3 states. [2019-01-01 23:52:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:18,769 INFO L93 Difference]: Finished difference Result 226 states and 308 transitions. [2019-01-01 23:52:18,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:52:18,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 308 transitions. [2019-01-01 23:52:18,774 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 160 [2019-01-01 23:52:18,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 308 transitions. [2019-01-01 23:52:18,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2019-01-01 23:52:18,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2019-01-01 23:52:18,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 308 transitions. [2019-01-01 23:52:18,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:18,787 INFO L705 BuchiCegarLoop]: Abstraction has 226 states and 308 transitions. [2019-01-01 23:52:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 308 transitions. [2019-01-01 23:52:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-01-01 23:52:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-01 23:52:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 308 transitions. [2019-01-01 23:52:18,809 INFO L728 BuchiCegarLoop]: Abstraction has 226 states and 308 transitions. [2019-01-01 23:52:18,809 INFO L608 BuchiCegarLoop]: Abstraction has 226 states and 308 transitions. [2019-01-01 23:52:18,809 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:52:18,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 308 transitions. [2019-01-01 23:52:18,812 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 160 [2019-01-01 23:52:18,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:18,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:18,813 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:18,813 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:18,813 INFO L794 eck$LassoCheckResult]: Stem: 1031#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(110, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 893#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 891#L833 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 892#L841 main_#t~ret25 := valid_product_#res;main_~tmp~5 := main_#t~ret25;havoc main_#t~ret25; 896#L431 assume 0 != main_~tmp~5; 921#L403 ~switchedOnBeforeTS~0 := 0; 942#L853 havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1035#L874-1 [2019-01-01 23:52:18,814 INFO L796 eck$LassoCheckResult]: Loop: 1035#L874-1 assume !false; 901#L288 assume test_~splverifierCounter~0 < 4; 902#L289 test_~tmp~4 := test_#t~nondet21;havoc test_#t~nondet21; 1030#L297 assume !(0 != test_~tmp~4); 1024#L297-1 test_~tmp___0~1 := test_#t~nondet22;havoc test_#t~nondet22; 1029#L307 assume !(0 != test_~tmp___0~1); 1094#L307-1 test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 1092#L317 assume 0 != test_~tmp___2~0; 1091#L323-1 havoc __utac_acc__Specification5_spec__2_#t~ret62;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; 971#L199 __utac_acc__Specification5_spec__2_#t~ret62 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret62;havoc __utac_acc__Specification5_spec__2_#t~ret62; 940#L863 assume !(0 != ~pumpRunning~0); 941#L71 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 1034#L129 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret0, processEnvironment__wrappee__methaneQuery_~tmp~0;havoc processEnvironment__wrappee__methaneQuery_~tmp~0; 927#L103-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret20, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 928#L979-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 929#L984-1 isHighWaterLevel_#t~ret20 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret20;havoc isHighWaterLevel_#t~ret20; 930#L248-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~0 := 0; 1001#L248-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 974#L254-1 processEnvironment__wrappee__methaneQuery_#t~ret0 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~0 := processEnvironment__wrappee__methaneQuery_#t~ret0;havoc processEnvironment__wrappee__methaneQuery_#t~ret0; 975#L107-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~0); 960#L78 havoc __utac_acc__Specification5_spec__3_#t~ret63, __utac_acc__Specification5_spec__3_#t~ret64, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 987#L971 __utac_acc__Specification5_spec__3_#t~ret63 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret63;havoc __utac_acc__Specification5_spec__3_#t~ret63; 1039#L874 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 1035#L874-1 [2019-01-01 23:52:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:18,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:52:18,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:18,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:18,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:18,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:18,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:19,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1936550109, now seen corresponding path program 1 times [2019-01-01 23:52:19,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:19,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:19,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:19,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:19,377 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2019-01-01 23:52:19,544 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:19,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:19,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:52:19,545 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:19,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:52:19,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:52:19,545 INFO L87 Difference]: Start difference. First operand 226 states and 308 transitions. cyclomatic complexity: 85 Second operand 5 states. [2019-01-01 23:52:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:20,980 INFO L93 Difference]: Finished difference Result 925 states and 1267 transitions. [2019-01-01 23:52:20,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:52:20,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 925 states and 1267 transitions. [2019-01-01 23:52:20,989 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 647 [2019-01-01 23:52:20,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 925 states to 925 states and 1267 transitions. [2019-01-01 23:52:20,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 925 [2019-01-01 23:52:20,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 925 [2019-01-01 23:52:20,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 925 states and 1267 transitions. [2019-01-01 23:52:21,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:21,001 INFO L705 BuchiCegarLoop]: Abstraction has 925 states and 1267 transitions. [2019-01-01 23:52:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states and 1267 transitions. [2019-01-01 23:52:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 442. [2019-01-01 23:52:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-01-01 23:52:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 594 transitions. [2019-01-01 23:52:21,022 INFO L728 BuchiCegarLoop]: Abstraction has 442 states and 594 transitions. [2019-01-01 23:52:21,023 INFO L608 BuchiCegarLoop]: Abstraction has 442 states and 594 transitions. [2019-01-01 23:52:21,023 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:52:21,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 594 transitions. [2019-01-01 23:52:21,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 318 [2019-01-01 23:52:21,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:21,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:21,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:21,027 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:21,027 INFO L794 eck$LassoCheckResult]: Stem: 2206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(110, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 2063#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 2061#L833 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 2062#L841 main_#t~ret25 := valid_product_#res;main_~tmp~5 := main_#t~ret25;havoc main_#t~ret25; 2066#L431 assume 0 != main_~tmp~5; 2089#L403 ~switchedOnBeforeTS~0 := 0; 2110#L853 havoc test_#t~nondet21, test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2213#L874-1 [2019-01-01 23:52:21,028 INFO L796 eck$LassoCheckResult]: Loop: 2213#L874-1 assume !false; 2390#L288 assume test_~splverifierCounter~0 < 4; 2391#L289 test_~tmp~4 := test_#t~nondet21;havoc test_#t~nondet21; 2456#L297 assume !(0 != test_~tmp~4); 2453#L297-1 test_~tmp___0~1 := test_#t~nondet22;havoc test_#t~nondet22; 2452#L307 assume !(0 != test_~tmp___0~1); 2450#L307-1 test_~tmp___2~0 := test_#t~nondet23;havoc test_#t~nondet23; 2449#L317 assume 0 != test_~tmp___2~0; 2448#L323-1 havoc __utac_acc__Specification5_spec__2_#t~ret62;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; 2459#L199 __utac_acc__Specification5_spec__2_#t~ret62 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret62;havoc __utac_acc__Specification5_spec__2_#t~ret62; 2458#L863 assume !(0 != ~pumpRunning~0); 2211#L71 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 2212#L129 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret0, processEnvironment__wrappee__methaneQuery_~tmp~0;havoc processEnvironment__wrappee__methaneQuery_~tmp~0; 2095#L103-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret20, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 2096#L979-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 2097#L984-1 isHighWaterLevel_#t~ret20 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret20;havoc isHighWaterLevel_#t~ret20; 2098#L248-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~0 := 0; 2173#L248-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 2144#L254-1 processEnvironment__wrappee__methaneQuery_#t~ret0 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~0 := processEnvironment__wrappee__methaneQuery_#t~ret0;havoc processEnvironment__wrappee__methaneQuery_#t~ret0; 2145#L107-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~0); 2128#L78 havoc __utac_acc__Specification5_spec__3_#t~ret63, __utac_acc__Specification5_spec__3_#t~ret64, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 2401#L971 __utac_acc__Specification5_spec__3_#t~ret63 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret63;havoc __utac_acc__Specification5_spec__3_#t~ret63; 2397#L874 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; 2398#L199-1 __utac_acc__Specification5_spec__3_#t~ret64 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret64;havoc __utac_acc__Specification5_spec__3_#t~ret64; 2394#L878 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 2213#L874-1 [2019-01-01 23:52:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:21,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-01 23:52:21,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:21,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:21,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1303826978, now seen corresponding path program 1 times [2019-01-01 23:52:21,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:21,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:21,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:21,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:21,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1367253160, now seen corresponding path program 1 times [2019-01-01 23:52:21,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:21,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:21,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:22,250 WARN L181 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-01 23:52:22,367 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 23:52:55,819 WARN L181 SmtUtils]: Spent 33.44 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:53:11,293 WARN L181 SmtUtils]: Spent 15.47 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:53:11,381 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,382 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:53:11,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:53:11,382 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:53:11,382 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:53:11,384 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:14" (3/4) ... [2019-01-01 23:53:11,388 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:53:11,541 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:53:11,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:53:11,542 INFO L168 Benchmark]: Toolchain (without parser) took 59215.27 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -261.1 MB). Peak memory consumption was 82.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:11,546 INFO L168 Benchmark]: CDTParser took 0.15 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:11,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:11,551 INFO L168 Benchmark]: Boogie Procedure Inliner took 172.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -205.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:11,552 INFO L168 Benchmark]: Boogie Preprocessor took 82.90 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:11,552 INFO L168 Benchmark]: RCFGBuilder took 1463.75 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: 64.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:11,553 INFO L168 Benchmark]: BuchiAutomizer took 56695.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -166.7 MB). Peak memory consumption was 398.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:11,558 INFO L168 Benchmark]: Witness Printer took 159.44 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:11,564 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.15 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 635.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 172.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -205.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.90 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1463.75 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: 64.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 56695.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -166.7 MB). Peak memory consumption was 398.2 MB. Max. memory is 11.5 GB. * Witness Printer took 159.44 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 442 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 56.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 53.1s. Construction of modules took 2.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 608 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 442 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 663 SDtfs, 1791 SDslu, 1810 SDs, 0 SdLazy, 209 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 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: 287]: 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=-15, NULL=0, NULL=0, NULL=-21, NULL=0, retValue_acc=1, NULL=0, NULL=-25, retValue_acc=0, NULL=0, NULL=0, NULL=-11, NULL=-6, NULL=-8, NULL=-24, methaneLevelCritical=0, tmp=1, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@359fb3d=0, tmp=0, NULL=0, retValue_acc=0, NULL=0, NULL=-19, tmp___1=0, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-5, \result=0, NULL=-7, NULL=-4, NULL=0, systemActive=1, waterLevel=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10f7f35d=0, NULL=-20, NULL=0, \result=0, NULL=-10, NULL=-9, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49ac2a6f=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a63a969=0, head=0, pumpRunning=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e0d9379=0, NULL=-17, NULL=-23, \result=0, NULL=-16, NULL=0, NULL=-12, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c97c87d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ac460dc=57, tmp=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c8d6374=0, \result=1, NULL=-18, NULL=0, retValue_acc=1, tmp=1, NULL=0, NULL=-13, tmp___2=57, retValue_acc=1, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=-3, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@248bae33=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50bf61dc=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c5b03ee=0, head=0, retValue_acc=0, tmp=0, NULL=-14, NULL=0, NULL=0, NULL=-1, NULL=-22, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L59] int pumpRunning = 0; [L60] int systemActive = 1; [L344] int cleanupTimeShifts = 4; [L614] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L847] int switchedOnBeforeTS ; [L896] int waterLevel = 1; [L897] int methaneLevelCritical = 0; [L422] int retValue_acc ; [L423] int tmp ; [L837] int retValue_acc ; [L840] retValue_acc = 1 [L841] return (retValue_acc); [L429] tmp = valid_product() [L431] COND TRUE \read(tmp) [L852] switchedOnBeforeTS = 0 [L278] int splverifierCounter ; [L279] int tmp ; [L280] int tmp___0 ; [L281] int tmp___1 ; [L282] int tmp___2 ; [L285] splverifierCounter = 0 Loop: [L287] COND TRUE 1 [L289] COND TRUE splverifierCounter < 4 [L295] tmp = __VERIFIER_nondet_int() [L297] COND FALSE !(\read(tmp)) [L305] tmp___0 = __VERIFIER_nondet_int() [L307] COND FALSE !(\read(tmp___0)) [L315] tmp___2 = __VERIFIER_nondet_int() [L317] COND TRUE \read(tmp___2) [L195] int retValue_acc ; [L198] retValue_acc = pumpRunning [L199] return (retValue_acc); [L861] switchedOnBeforeTS = isPumpRunning() [L71] COND FALSE !(\read(pumpRunning)) [L78] COND TRUE \read(systemActive) [L126] int tmp ; [L129] COND FALSE !(\read(pumpRunning)) [L100] int tmp ; [L103] COND TRUE ! pumpRunning [L240] int retValue_acc ; [L241] int tmp ; [L242] int tmp___0 ; [L976] int retValue_acc ; [L979] COND TRUE waterLevel < 2 [L980] retValue_acc = 1 [L981] return (retValue_acc); [L246] tmp = isHighWaterSensorDry() [L248] COND TRUE \read(tmp) [L249] tmp___0 = 0 [L253] retValue_acc = tmp___0 [L254] return (retValue_acc); [L105] tmp = isHighWaterLevel() [L107] COND FALSE !(\read(tmp)) [L867] int tmp ; [L868] int tmp___0 ; [L967] int retValue_acc ; [L970] retValue_acc = waterLevel [L971] return (retValue_acc); [L872] tmp = getWaterLevel() [L874] COND TRUE tmp != 2 [L195] int retValue_acc ; [L198] retValue_acc = pumpRunning [L199] return (retValue_acc); [L876] tmp___0 = isPumpRunning() [L878] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...