./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product60_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec2_product60_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 9f9d802e48c20b812c0aeb303e5b9a04b1c7ed3d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:21:03,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:21:03,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:21:03,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:21:03,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:21:03,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:21:03,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:21:03,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:21:03,084 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:21:03,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:21:03,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:21:03,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:21:03,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:21:03,094 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:21:03,096 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:21:03,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:21:03,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:21:03,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:21:03,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:21:03,112 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:21:03,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:21:03,118 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:21:03,123 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:21:03,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:21:03,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:21:03,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:21:03,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:21:03,129 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:21:03,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:21:03,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:21:03,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:21:03,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:21:03,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:21:03,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:21:03,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:21:03,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:21:03,139 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:21:03,155 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:21:03,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:21:03,156 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:21:03,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:21:03,157 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:21:03,157 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:21:03,157 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:21:03,157 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:21:03,157 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:21:03,158 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:21:03,158 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:21:03,158 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:21:03,158 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:21:03,158 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:21:03,159 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:21:03,159 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:21:03,159 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:21:03,159 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:21:03,159 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:21:03,159 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:21:03,160 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:21:03,160 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:21:03,160 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:21:03,160 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:21:03,160 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:21:03,160 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:21:03,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:21:03,161 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:21:03,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:21:03,161 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:21:03,161 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:21:03,162 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:21:03,162 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 -> 9f9d802e48c20b812c0aeb303e5b9a04b1c7ed3d [2019-01-14 04:21:03,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:21:03,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:21:03,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:21:03,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:21:03,214 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:21:03,215 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product60_true-unreach-call_false-termination.cil.c [2019-01-14 04:21:03,272 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397caac4e/ba5aa13426c748418ec804cf0d21c7ee/FLAG2238cf3d6 [2019-01-14 04:21:03,745 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:21:03,747 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product60_true-unreach-call_false-termination.cil.c [2019-01-14 04:21:03,760 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397caac4e/ba5aa13426c748418ec804cf0d21c7ee/FLAG2238cf3d6 [2019-01-14 04:21:04,060 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397caac4e/ba5aa13426c748418ec804cf0d21c7ee [2019-01-14 04:21:04,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:21:04,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:21:04,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:21:04,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:21:04,071 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:21:04,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:04,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b00d126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04, skipping insertion in model container [2019-01-14 04:21:04,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:04,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:21:04,142 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:21:04,540 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:21:04,576 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:21:04,721 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:21:04,878 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:21:04,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04 WrapperNode [2019-01-14 04:21:04,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:21:04,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:21:04,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:21:04,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:21:04,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:04,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:05,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:21:05,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:21:05,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:21:05,001 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:21:05,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:05,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:05,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:05,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:05,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:05,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:05,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... [2019-01-14 04:21:05,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:21:05,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:21:05,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:21:05,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:21:05,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:21:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:21:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:21:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:21:05,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:21:06,511 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:21:06,511 INFO L286 CfgBuilder]: Removed 200 assue(true) statements. [2019-01-14 04:21:06,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:21:06 BoogieIcfgContainer [2019-01-14 04:21:06,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:21:06,513 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:21:06,514 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:21:06,517 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:21:06,518 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:21:06,518 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:21:04" (1/3) ... [2019-01-14 04:21:06,519 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6eea1258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:21:06, skipping insertion in model container [2019-01-14 04:21:06,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:21:06,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:21:04" (2/3) ... [2019-01-14 04:21:06,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6eea1258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:21:06, skipping insertion in model container [2019-01-14 04:21:06,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:21:06,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:21:06" (3/3) ... [2019-01-14 04:21:06,522 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec2_product60_true-unreach-call_false-termination.cil.c [2019-01-14 04:21:06,587 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:21:06,588 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:21:06,588 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:21:06,588 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:21:06,588 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:21:06,589 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:21:06,589 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:21:06,589 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:21:06,589 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:21:06,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states. [2019-01-14 04:21:06,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2019-01-14 04:21:06,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:06,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:06,650 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:06,650 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:06,650 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:21:06,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states. [2019-01-14 04:21:06,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2019-01-14 04:21:06,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:06,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:06,660 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:06,660 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:06,666 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);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(75, #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(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(21);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(13);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(80, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(117, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(109, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(112, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(110, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 2 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string70.base, #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 1 + #t~string70.offset, 1);~methAndRunningLastTime~0 := 0; 5#L-1true havoc main_#res;havoc main_#t~ret10, main_~retValue_acc~4, main_~tmp~0;havoc main_~retValue_acc~4;havoc main_~tmp~0; 112#L286true havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 130#L294true main_#t~ret10 := valid_product_#res;main_~tmp~0 := main_#t~ret10;havoc main_#t~ret10; 129#L250true assume 0 != main_~tmp~0; 41#L221true ~methAndRunningLastTime~0 := 0; 18#L984true havoc test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_#t~nondet15, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 21#L995-1true [2019-01-14 04:21:06,667 INFO L796 eck$LassoCheckResult]: Loop: 21#L995-1true assume !false; 39#L312true assume test_~splverifierCounter~0 < 4; 137#L313true test_~tmp~1 := test_#t~nondet12;havoc test_#t~nondet12; 3#L321true assume !(0 != test_~tmp~1); 4#L321-1true test_~tmp___0~0 := test_#t~nondet13;havoc test_#t~nondet13; 55#L331true assume !(0 != test_~tmp___0~0); 59#L331-1true test_~tmp___2~0 := test_#t~nondet14;havoc test_#t~nondet14; 131#L341true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 134#L349-1true assume !(0 != ~pumpRunning~0); 42#L747true assume !(0 != ~systemActive~0); 120#L754true havoc __utac_acc__Specification2_spec__2_#t~ret73, __utac_acc__Specification2_spec__2_#t~ret74, __utac_acc__Specification2_spec__2_~tmp~10, __utac_acc__Specification2_spec__2_~tmp___0~3;havoc __utac_acc__Specification2_spec__2_~tmp~10;havoc __utac_acc__Specification2_spec__2_~tmp___0~3;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 96#L91-2true __utac_acc__Specification2_spec__2_#t~ret73 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~10 := __utac_acc__Specification2_spec__2_#t~ret73;havoc __utac_acc__Specification2_spec__2_#t~ret73; 16#L995true assume !(0 != __utac_acc__Specification2_spec__2_~tmp~10);~methAndRunningLastTime~0 := 0; 21#L995-1true [2019-01-14 04:21:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:06,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:21:06,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:06,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash 14728148, now seen corresponding path program 1 times [2019-01-14 04:21:07,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:07,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:07,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:21:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:21:07,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:21:07,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:21:07,711 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:21:07,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:21:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:21:07,734 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-01-14 04:21:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:21:07,916 INFO L93 Difference]: Finished difference Result 269 states and 391 transitions. [2019-01-14 04:21:07,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:21:07,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 269 states and 391 transitions. [2019-01-14 04:21:07,938 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 174 [2019-01-14 04:21:07,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 269 states to 255 states and 376 transitions. [2019-01-14 04:21:07,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2019-01-14 04:21:07,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 255 [2019-01-14 04:21:07,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 376 transitions. [2019-01-14 04:21:07,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:21:07,956 INFO L706 BuchiCegarLoop]: Abstraction has 255 states and 376 transitions. [2019-01-14 04:21:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 376 transitions. [2019-01-14 04:21:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-01-14 04:21:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-14 04:21:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 373 transitions. [2019-01-14 04:21:08,007 INFO L729 BuchiCegarLoop]: Abstraction has 253 states and 373 transitions. [2019-01-14 04:21:08,007 INFO L609 BuchiCegarLoop]: Abstraction has 253 states and 373 transitions. [2019-01-14 04:21:08,007 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:21:08,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 253 states and 373 transitions. [2019-01-14 04:21:08,011 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 172 [2019-01-14 04:21:08,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:08,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:08,012 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:08,012 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:08,013 INFO L794 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);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(75, #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(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(21);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(13);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(80, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(117, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(109, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(112, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(110, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 2 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string70.base, #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 1 + #t~string70.offset, 1);~methAndRunningLastTime~0 := 0; 420#L-1 havoc main_#res;havoc main_#t~ret10, main_~retValue_acc~4, main_~tmp~0;havoc main_~retValue_acc~4;havoc main_~tmp~0; 421#L286 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 552#L294 main_#t~ret10 := valid_product_#res;main_~tmp~0 := main_#t~ret10;havoc main_#t~ret10; 557#L250 assume 0 != main_~tmp~0; 484#L221 ~methAndRunningLastTime~0 := 0; 449#L984 havoc test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_#t~nondet15, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 450#L995-1 [2019-01-14 04:21:08,013 INFO L796 eck$LassoCheckResult]: Loop: 450#L995-1 assume !false; 580#L312 assume test_~splverifierCounter~0 < 4; 579#L313 test_~tmp~1 := test_#t~nondet12;havoc test_#t~nondet12; 578#L321 assume !(0 != test_~tmp~1); 576#L321-1 test_~tmp___0~0 := test_#t~nondet13;havoc test_#t~nondet13; 575#L331 assume !(0 != test_~tmp___0~0); 573#L331-1 test_~tmp___2~0 := test_#t~nondet14;havoc test_#t~nondet14; 572#L341 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 559#L349-1 assume !(0 != ~pumpRunning~0); 429#L747 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret52, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 485#L805 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret51, processEnvironment__wrappee__highWaterSensor_~tmp~5;havoc processEnvironment__wrappee__highWaterSensor_~tmp~5; 593#L779-1 assume !(0 == ~pumpRunning~0); 586#L754 havoc __utac_acc__Specification2_spec__2_#t~ret73, __utac_acc__Specification2_spec__2_#t~ret74, __utac_acc__Specification2_spec__2_~tmp~10, __utac_acc__Specification2_spec__2_~tmp___0~3;havoc __utac_acc__Specification2_spec__2_~tmp~10;havoc __utac_acc__Specification2_spec__2_~tmp___0~3;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 585#L91-2 __utac_acc__Specification2_spec__2_#t~ret73 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~10 := __utac_acc__Specification2_spec__2_#t~ret73;havoc __utac_acc__Specification2_spec__2_#t~ret73; 583#L995 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~10);~methAndRunningLastTime~0 := 0; 450#L995-1 [2019-01-14 04:21:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:21:08,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:08,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:08,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:08,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:08,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:08,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2011842179, now seen corresponding path program 1 times [2019-01-14 04:21:08,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:08,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:08,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:21:08,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:21:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:21:08,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:21:08,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:21:08,471 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:21:08,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:21:08,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:21:08,472 INFO L87 Difference]: Start difference. First operand 253 states and 373 transitions. cyclomatic complexity: 123 Second operand 3 states. [2019-01-14 04:21:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:21:09,082 INFO L93 Difference]: Finished difference Result 342 states and 485 transitions. [2019-01-14 04:21:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:21:09,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 485 transitions. [2019-01-14 04:21:09,089 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 239 [2019-01-14 04:21:09,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 485 transitions. [2019-01-14 04:21:09,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2019-01-14 04:21:09,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2019-01-14 04:21:09,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 485 transitions. [2019-01-14 04:21:09,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:21:09,098 INFO L706 BuchiCegarLoop]: Abstraction has 342 states and 485 transitions. [2019-01-14 04:21:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 485 transitions. [2019-01-14 04:21:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-01-14 04:21:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-14 04:21:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 485 transitions. [2019-01-14 04:21:09,124 INFO L729 BuchiCegarLoop]: Abstraction has 342 states and 485 transitions. [2019-01-14 04:21:09,124 INFO L609 BuchiCegarLoop]: Abstraction has 342 states and 485 transitions. [2019-01-14 04:21:09,125 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:21:09,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 485 transitions. [2019-01-14 04:21:09,129 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 239 [2019-01-14 04:21:09,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:09,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:09,130 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:09,131 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:09,131 INFO L794 eck$LassoCheckResult]: Stem: 1156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);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(75, #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(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(21);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(13);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(80, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(117, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(109, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(112, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(110, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 2 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string70.base, #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 1 + #t~string70.offset, 1);~methAndRunningLastTime~0 := 0; 1021#L-1 havoc main_#res;havoc main_#t~ret10, main_~retValue_acc~4, main_~tmp~0;havoc main_~retValue_acc~4;havoc main_~tmp~0; 1022#L286 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 1154#L294 main_#t~ret10 := valid_product_#res;main_~tmp~0 := main_#t~ret10;havoc main_#t~ret10; 1161#L250 assume 0 != main_~tmp~0; 1084#L221 ~methAndRunningLastTime~0 := 0; 1048#L984 havoc test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_#t~nondet15, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1049#L995-1 [2019-01-14 04:21:09,131 INFO L796 eck$LassoCheckResult]: Loop: 1049#L995-1 assume !false; 1185#L312 assume test_~splverifierCounter~0 < 4; 1183#L313 test_~tmp~1 := test_#t~nondet12;havoc test_#t~nondet12; 1184#L321 assume !(0 != test_~tmp~1); 1266#L321-1 test_~tmp___0~0 := test_#t~nondet13;havoc test_#t~nondet13; 1178#L331 assume !(0 != test_~tmp___0~0); 1175#L331-1 test_~tmp___2~0 := test_#t~nondet14;havoc test_#t~nondet14; 1176#L341 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1166#L349-1 assume !(0 != ~pumpRunning~0); 1085#L747 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret52, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 1076#L805 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret51, processEnvironment__wrappee__highWaterSensor_~tmp~5;havoc processEnvironment__wrappee__highWaterSensor_~tmp~5; 1077#L779-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret71, isHighWaterLevel_~retValue_acc~12, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~12;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 1033#L131-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 1034#L136-1 isHighWaterLevel_#t~ret71 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret71;havoc isHighWaterLevel_#t~ret71; 1057#L925-3 assume !(0 != isHighWaterLevel_~tmp~8);isHighWaterLevel_~tmp___0~1 := 1; 1140#L925-5 isHighWaterLevel_~retValue_acc~12 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~12; 1242#L931-1 processEnvironment__wrappee__highWaterSensor_#t~ret51 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~5 := processEnvironment__wrappee__highWaterSensor_#t~ret51;havoc processEnvironment__wrappee__highWaterSensor_#t~ret51; 1235#L783-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~5); 1232#L754 havoc __utac_acc__Specification2_spec__2_#t~ret73, __utac_acc__Specification2_spec__2_#t~ret74, __utac_acc__Specification2_spec__2_~tmp~10, __utac_acc__Specification2_spec__2_~tmp___0~3;havoc __utac_acc__Specification2_spec__2_~tmp~10;havoc __utac_acc__Specification2_spec__2_~tmp___0~3;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 1230#L91-2 __utac_acc__Specification2_spec__2_#t~ret73 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~10 := __utac_acc__Specification2_spec__2_#t~ret73;havoc __utac_acc__Specification2_spec__2_#t~ret73; 1193#L995 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~10);~methAndRunningLastTime~0 := 0; 1049#L995-1 [2019-01-14 04:21:09,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:09,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:21:09,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:09,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:09,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:09,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:09,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash 235083, now seen corresponding path program 1 times [2019-01-14 04:21:09,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:09,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:09,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:21:09,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:21:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:21:09,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:21:09,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:21:09,784 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:21:09,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:21:09,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:21:09,785 INFO L87 Difference]: Start difference. First operand 342 states and 485 transitions. cyclomatic complexity: 146 Second operand 4 states. [2019-01-14 04:21:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:21:10,549 INFO L93 Difference]: Finished difference Result 665 states and 927 transitions. [2019-01-14 04:21:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:21:10,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 665 states and 927 transitions. [2019-01-14 04:21:10,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 470 [2019-01-14 04:21:10,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 665 states to 665 states and 927 transitions. [2019-01-14 04:21:10,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 665 [2019-01-14 04:21:10,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 665 [2019-01-14 04:21:10,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 665 states and 927 transitions. [2019-01-14 04:21:10,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:21:10,572 INFO L706 BuchiCegarLoop]: Abstraction has 665 states and 927 transitions. [2019-01-14 04:21:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states and 927 transitions. [2019-01-14 04:21:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 366. [2019-01-14 04:21:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-14 04:21:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 509 transitions. [2019-01-14 04:21:10,590 INFO L729 BuchiCegarLoop]: Abstraction has 366 states and 509 transitions. [2019-01-14 04:21:10,591 INFO L609 BuchiCegarLoop]: Abstraction has 366 states and 509 transitions. [2019-01-14 04:21:10,591 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:21:10,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 509 transitions. [2019-01-14 04:21:10,595 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 255 [2019-01-14 04:21:10,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:21:10,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:21:10,597 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:10,597 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:21:10,598 INFO L794 eck$LassoCheckResult]: Stem: 2199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);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(75, #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(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(21);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(13);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(80, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(117, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(109, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(112, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(110, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 2 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string70.base, #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 1 + #t~string70.offset, 1);~methAndRunningLastTime~0 := 0; 2038#L-1 havoc main_#res;havoc main_#t~ret10, main_~retValue_acc~4, main_~tmp~0;havoc main_~retValue_acc~4;havoc main_~tmp~0; 2039#L286 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 2196#L294 main_#t~ret10 := valid_product_#res;main_~tmp~0 := main_#t~ret10;havoc main_#t~ret10; 2201#L250 assume 0 != main_~tmp~0; 2107#L221 ~methAndRunningLastTime~0 := 0; 2071#L984 havoc test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_#t~nondet15, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2072#L995-1 [2019-01-14 04:21:10,598 INFO L796 eck$LassoCheckResult]: Loop: 2072#L995-1 assume !false; 2291#L312 assume test_~splverifierCounter~0 < 4; 2290#L313 test_~tmp~1 := test_#t~nondet12;havoc test_#t~nondet12; 2289#L321 assume !(0 != test_~tmp~1); 2287#L321-1 test_~tmp___0~0 := test_#t~nondet13;havoc test_#t~nondet13; 2124#L331 assume !(0 != test_~tmp___0~0); 2116#L331-1 test_~tmp___2~0 := test_#t~nondet14;havoc test_#t~nondet14; 2277#L341 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2203#L349-1 assume !(0 != ~pumpRunning~0); 2108#L747 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret52, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 2109#L805 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret51, processEnvironment__wrappee__highWaterSensor_~tmp~5;havoc processEnvironment__wrappee__highWaterSensor_~tmp~5; 2311#L779-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret71, isHighWaterLevel_~retValue_acc~12, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~12;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 2053#L131-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 2054#L136-1 isHighWaterLevel_#t~ret71 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret71;havoc isHighWaterLevel_#t~ret71; 2179#L925-3 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~1 := 0; 2144#L925-5 isHighWaterLevel_~retValue_acc~12 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~12; 2121#L931-1 processEnvironment__wrappee__highWaterSensor_#t~ret51 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~5 := processEnvironment__wrappee__highWaterSensor_#t~ret51;havoc processEnvironment__wrappee__highWaterSensor_#t~ret51; 2063#L783-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~5); 2064#L754 havoc __utac_acc__Specification2_spec__2_#t~ret73, __utac_acc__Specification2_spec__2_#t~ret74, __utac_acc__Specification2_spec__2_~tmp~10, __utac_acc__Specification2_spec__2_~tmp___0~3;havoc __utac_acc__Specification2_spec__2_~tmp~10;havoc __utac_acc__Specification2_spec__2_~tmp___0~3;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 2177#L91-2 __utac_acc__Specification2_spec__2_#t~ret73 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~10 := __utac_acc__Specification2_spec__2_#t~ret73;havoc __utac_acc__Specification2_spec__2_#t~ret73; 2178#L995 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~10);~methAndRunningLastTime~0 := 0; 2072#L995-1 [2019-01-14 04:21:10,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-14 04:21:10,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:10,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:10,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:10,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1774772279, now seen corresponding path program 1 times [2019-01-14 04:21:10,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:10,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:10,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:10,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:21:10,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:21:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1630653, now seen corresponding path program 1 times [2019-01-14 04:21:10,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:21:10,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:21:10,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:10,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:21:10,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:21:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:21:12,022 WARN L181 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-01-14 04:21:39,192 WARN L181 SmtUtils]: Spent 27.07 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:21:51,835 WARN L181 SmtUtils]: Spent 12.63 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:21:51,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:21:51 BoogieIcfgContainer [2019-01-14 04:21:51,915 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:21:51,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:21:51,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:21:51,916 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:21:51,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:21:06" (3/4) ... [2019-01-14 04:21:51,921 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:21:52,014 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:21:52,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:21:52,015 INFO L168 Benchmark]: Toolchain (without parser) took 47950.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.1 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -299.9 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:52,017 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:21:52,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:52,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.70 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:52,026 INFO L168 Benchmark]: Boogie Preprocessor took 58.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:21:52,028 INFO L168 Benchmark]: RCFGBuilder took 1453.27 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: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:52,029 INFO L168 Benchmark]: BuchiAutomizer took 45401.92 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.3 GB in the end (delta: -191.8 MB). Peak memory consumption was 412.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:52,029 INFO L168 Benchmark]: Witness Printer took 98.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:21:52,038 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 812.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.70 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1453.27 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: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 45401.92 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.3 GB in the end (delta: -191.8 MB). Peak memory consumption was 412.6 MB. Max. memory is 11.5 GB. * Witness Printer took 98.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 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 4 locations. The remainder module has 366 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 43.4s. Construction of modules took 1.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 301 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 366 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 602 SDtfs, 646 SDslu, 592 SDs, 0 SdLazy, 99 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 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: 311]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=22473} State at position 1 is {NULL=0, retValue_acc=0, NULL=0, NULL=0, NULL=0, NULL=-13, NULL=0, NULL=22473, NULL=-1, tmp=0, retValue_acc=0, NULL=0, NULL=0, NULL=-3, NULL=0, NULL=-15, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@481b21b6=0, NULL=-22, NULL=-20, methaneLevelCritical=0, NULL=-4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5753a44d=0, tmp___0=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5dbb2a6e=0, NULL=-19, tmp___1=0, NULL=-12, NULL=-14, cleanupTimeShifts=4, NULL=-21, tmp=0, NULL=-9, tmp=0, NULL=0, systemActive=1, waterLevel=1, NULL=0, NULL=-5, \result=0, NULL=-8, NULL=-18, tmp___0=0, NULL=-10, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, tmp=1, \result=0, NULL=0, NULL=13082, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@689d1750=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e3e978a=0, NULL=0, NULL=-2, \result=1, NULL=-6, retValue_acc=1, retValue_acc=0, NULL=22472, tmp___0=0, tmp=1, tmp___2=64, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, methAndRunningLastTime=0, \result=0, NULL=-7, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42b7a432=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4413d945=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c90d096=64, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ebc031a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a49c70d=0, head=0, tmp=0, NULL=0, NULL=0, NULL=-11, NULL=-17, NULL=9871, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L160] int cleanupTimeShifts = 4; [L539] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L739] int pumpRunning = 0; [L740] int systemActive = 1; [L978] int methAndRunningLastTime ; [L241] int retValue_acc ; [L242] int tmp ; [L290] int retValue_acc ; [L293] retValue_acc = 1 [L294] return (retValue_acc); [L248] tmp = valid_product() [L250] COND TRUE \read(tmp) [L983] methAndRunningLastTime = 0 [L302] int splverifierCounter ; [L303] int tmp ; [L304] int tmp___0 ; [L305] int tmp___1 ; [L306] int tmp___2 ; [L309] splverifierCounter = 0 Loop: [L311] COND TRUE 1 [L313] COND TRUE splverifierCounter < 4 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L329] tmp___0 = __VERIFIER_nondet_int() [L331] COND FALSE !(\read(tmp___0)) [L339] tmp___2 = __VERIFIER_nondet_int() [L341] COND TRUE \read(tmp___2) [L973] systemActive = 1 [L747] COND FALSE !(\read(pumpRunning)) [L754] COND TRUE \read(systemActive) [L802] int tmp ; [L805] COND FALSE !(\read(pumpRunning)) [L776] int tmp ; [L779] COND TRUE ! pumpRunning [L917] int retValue_acc ; [L918] int tmp ; [L919] int tmp___0 ; [L128] int retValue_acc ; [L131] COND TRUE waterLevel < 2 [L132] retValue_acc = 1 [L133] return (retValue_acc); [L923] tmp = isHighWaterSensorDry() [L925] COND TRUE \read(tmp) [L926] tmp___0 = 0 [L930] retValue_acc = tmp___0 [L931] return (retValue_acc); [L781] tmp = isHighWaterLevel() [L783] COND FALSE !(\read(tmp)) [L988] int tmp ; [L989] int tmp___0 ; [L87] int retValue_acc ; [L90] retValue_acc = methaneLevelCritical [L91] return (retValue_acc); [L993] tmp = isMethaneLevelCritical() [L995] COND FALSE !(\read(tmp)) [L1011] methAndRunningLastTime = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...