./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product34_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_spec3_product34_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 5f0a99b238839eec8a869cf6a8a47d3d1cc483bf ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:23:17,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:23:17,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:23:17,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:23:17,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:23:17,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:23:17,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:23:17,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:23:17,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:23:17,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:23:17,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:23:17,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:23:17,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:23:17,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:23:17,991 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:23:17,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:23:17,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:23:17,995 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:23:17,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:23:17,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:23:18,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:23:18,002 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:23:18,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:23:18,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:23:18,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:23:18,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:23:18,008 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:23:18,009 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:23:18,010 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:23:18,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:23:18,012 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:23:18,013 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:23:18,013 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:23:18,014 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:23:18,015 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:23:18,016 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:23:18,016 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:23:18,036 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:23:18,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:23:18,038 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:23:18,038 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:23:18,039 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:23:18,039 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:23:18,039 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:23:18,039 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:23:18,039 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:23:18,039 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:23:18,040 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:23:18,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:23:18,042 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:23:18,043 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:23:18,043 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:23:18,043 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:23:18,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:23:18,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:23:18,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:23:18,044 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:23:18,044 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:23:18,044 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:23:18,044 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:23:18,044 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:23:18,044 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:23:18,045 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:23:18,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:23:18,048 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:23:18,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:23:18,049 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:23:18,049 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:23:18,050 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:23:18,050 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 -> 5f0a99b238839eec8a869cf6a8a47d3d1cc483bf [2019-01-14 04:23:18,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:23:18,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:23:18,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:23:18,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:23:18,139 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:23:18,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product34_true-unreach-call_false-termination.cil.c [2019-01-14 04:23:18,200 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8858932e1/2a981ceb2eb846928a4998e00d2bdc54/FLAGbea33110c [2019-01-14 04:23:18,673 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:23:18,674 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product34_true-unreach-call_false-termination.cil.c [2019-01-14 04:23:18,688 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8858932e1/2a981ceb2eb846928a4998e00d2bdc54/FLAGbea33110c [2019-01-14 04:23:18,996 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8858932e1/2a981ceb2eb846928a4998e00d2bdc54 [2019-01-14 04:23:19,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:23:19,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:23:19,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:23:19,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:23:19,012 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:23:19,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:23:18" (1/1) ... [2019-01-14 04:23:19,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19, skipping insertion in model container [2019-01-14 04:23:19,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:23:18" (1/1) ... [2019-01-14 04:23:19,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:23:19,096 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:23:19,429 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:23:19,458 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:23:19,606 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:23:19,655 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:23:19,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19 WrapperNode [2019-01-14 04:23:19,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:23:19,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:23:19,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:23:19,657 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:23:19,664 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:23:19" (1/1) ... [2019-01-14 04:23:19,684 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:23:19" (1/1) ... [2019-01-14 04:23:19,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:23:19,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:23:19,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:23:19,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:23:19,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19" (1/1) ... [2019-01-14 04:23:19,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19" (1/1) ... [2019-01-14 04:23:19,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19" (1/1) ... [2019-01-14 04:23:19,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19" (1/1) ... [2019-01-14 04:23:19,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19" (1/1) ... [2019-01-14 04:23:19,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19" (1/1) ... [2019-01-14 04:23:19,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19" (1/1) ... [2019-01-14 04:23:19,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:23:19,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:23:19,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:23:19,776 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:23:19,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19" (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:23:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:23:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:23:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:23:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:23:20,946 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:23:20,947 INFO L286 CfgBuilder]: Removed 104 assue(true) statements. [2019-01-14 04:23:20,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:23:20 BoogieIcfgContainer [2019-01-14 04:23:20,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:23:20,949 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:23:20,949 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:23:20,953 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:23:20,954 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:23:20,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:23:18" (1/3) ... [2019-01-14 04:23:20,955 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47c6f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:23:20, skipping insertion in model container [2019-01-14 04:23:20,955 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:23:20,955 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:23:19" (2/3) ... [2019-01-14 04:23:20,956 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47c6f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:23:20, skipping insertion in model container [2019-01-14 04:23:20,956 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:23:20,956 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:23:20" (3/3) ... [2019-01-14 04:23:20,958 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product34_true-unreach-call_false-termination.cil.c [2019-01-14 04:23:21,012 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:23:21,013 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:23:21,013 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:23:21,013 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:23:21,013 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:23:21,014 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:23:21,014 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:23:21,014 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:23:21,014 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:23:21,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states. [2019-01-14 04:23:21,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:23:21,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:23:21,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:23:21,066 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:23:21,067 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:23:21,067 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:23:21,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states. [2019-01-14 04:23:21,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:23:21,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:23:21,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:23:21,075 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:23:21,075 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:23:21,080 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(110, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(102, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(102, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 3 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string14.base, #t~string14.offset, 1);call write~init~int(80, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(117, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(109, #t~string14.base, 3 + #t~string14.offset, 1);call write~init~int(112, #t~string14.base, 4 + #t~string14.offset, 1);call write~init~int(58, #t~string14.base, 5 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 6 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string20.base, #t~string20.offset, 1);call write~init~int(32, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string22.base, #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 1 + #t~string22.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(21);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(25);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 14#L-1true havoc main_#res;havoc main_#t~ret4, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 37#L907true havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 44#L915true main_#t~ret4 := valid_product_#res;main_~tmp~1 := main_#t~ret4;havoc main_#t~ret4; 33#L198true assume 0 != main_~tmp~1; 47#L172true havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 81#L763-1true [2019-01-14 04:23:21,080 INFO L796 eck$LassoCheckResult]: Loop: 81#L763-1true assume !false; 60#L56true assume test_~splverifierCounter~0 < 4; 82#L57true test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 21#L65true assume !(0 != test_~tmp~0); 17#L65-1true test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 75#L75true assume !(0 != test_~tmp___0~0); 73#L75-1true test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 59#L85true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 52#L93-2true assume !(0 != ~pumpRunning~0); 49#L227true assume !(0 != ~systemActive~0); 42#L234true havoc __utac_acc__Specification3_spec__1_#t~ret59, __utac_acc__Specification3_spec__1_#t~ret60, __utac_acc__Specification3_spec__1_#t~ret61, __utac_acc__Specification3_spec__1_~tmp~7, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~7;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~7;havoc isMethaneLevelCritical_~retValue_acc~7;isMethaneLevelCritical_~retValue_acc~7 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~7; 34#L834true __utac_acc__Specification3_spec__1_#t~ret59 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~7 := __utac_acc__Specification3_spec__1_#t~ret59;havoc __utac_acc__Specification3_spec__1_#t~ret59; 39#L757true assume 0 != __utac_acc__Specification3_spec__1_~tmp~7; 81#L763-1true [2019-01-14 04:23:21,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:21,094 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:23:21,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:21,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:21,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:21,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:21,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1680575562, now seen corresponding path program 1 times [2019-01-14 04:23:21,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:21,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:21,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:23:21,888 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:23:21,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:23:21,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:23:21,893 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:23:21,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:23:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:23:21,908 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2019-01-14 04:23:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:23:21,990 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2019-01-14 04:23:21,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:23:21,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 113 transitions. [2019-01-14 04:23:21,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-14 04:23:22,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 74 states and 105 transitions. [2019-01-14 04:23:22,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-01-14 04:23:22,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2019-01-14 04:23:22,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 105 transitions. [2019-01-14 04:23:22,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:23:22,007 INFO L706 BuchiCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-01-14 04:23:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 105 transitions. [2019-01-14 04:23:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-14 04:23:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 04:23:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-01-14 04:23:22,035 INFO L729 BuchiCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-01-14 04:23:22,035 INFO L609 BuchiCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-01-14 04:23:22,036 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:23:22,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 105 transitions. [2019-01-14 04:23:22,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-14 04:23:22,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:23:22,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:23:22,039 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:23:22,039 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:23:22,039 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(110, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(102, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(102, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 3 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string14.base, #t~string14.offset, 1);call write~init~int(80, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(117, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(109, #t~string14.base, 3 + #t~string14.offset, 1);call write~init~int(112, #t~string14.base, 4 + #t~string14.offset, 1);call write~init~int(58, #t~string14.base, 5 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 6 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string20.base, #t~string20.offset, 1);call write~init~int(32, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string22.base, #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 1 + #t~string22.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(21);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(25);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 192#L-1 havoc main_#res;havoc main_#t~ret4, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 193#L907 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 220#L915 main_#t~ret4 := valid_product_#res;main_~tmp~1 := main_#t~ret4;havoc main_#t~ret4; 214#L198 assume 0 != main_~tmp~1; 215#L172 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 190#L763-1 [2019-01-14 04:23:22,040 INFO L796 eck$LassoCheckResult]: Loop: 190#L763-1 assume !false; 235#L56 assume test_~splverifierCounter~0 < 4; 236#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 205#L65 assume !(0 != test_~tmp~0); 196#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 197#L75 assume !(0 != test_~tmp___0~0); 243#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 234#L85 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 226#L93-2 assume !(0 != ~pumpRunning~0); 203#L227 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret5, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 210#L259 assume !(0 == ~pumpRunning~0); 182#L234 havoc __utac_acc__Specification3_spec__1_#t~ret59, __utac_acc__Specification3_spec__1_#t~ret60, __utac_acc__Specification3_spec__1_#t~ret61, __utac_acc__Specification3_spec__1_~tmp~7, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~7;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~7;havoc isMethaneLevelCritical_~retValue_acc~7;isMethaneLevelCritical_~retValue_acc~7 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~7; 216#L834 __utac_acc__Specification3_spec__1_#t~ret59 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~7 := __utac_acc__Specification3_spec__1_#t~ret59;havoc __utac_acc__Specification3_spec__1_#t~ret59; 217#L757 assume 0 != __utac_acc__Specification3_spec__1_~tmp~7; 190#L763-1 [2019-01-14 04:23:22,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:22,040 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:23:22,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:22,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:22,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:22,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:22,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash -589845010, now seen corresponding path program 1 times [2019-01-14 04:23:22,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:22,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:23:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:23:22,481 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:23:22,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:23:22,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:23:22,482 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:23:22,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:23:22,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:23:22,483 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. cyclomatic complexity: 33 Second operand 3 states. [2019-01-14 04:23:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:23:22,643 INFO L93 Difference]: Finished difference Result 121 states and 165 transitions. [2019-01-14 04:23:22,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:23:22,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 165 transitions. [2019-01-14 04:23:22,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2019-01-14 04:23:22,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 165 transitions. [2019-01-14 04:23:22,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-01-14 04:23:22,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-01-14 04:23:22,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 165 transitions. [2019-01-14 04:23:22,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:23:22,652 INFO L706 BuchiCegarLoop]: Abstraction has 121 states and 165 transitions. [2019-01-14 04:23:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 165 transitions. [2019-01-14 04:23:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-14 04:23:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 04:23:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 165 transitions. [2019-01-14 04:23:22,661 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 165 transitions. [2019-01-14 04:23:22,662 INFO L609 BuchiCegarLoop]: Abstraction has 121 states and 165 transitions. [2019-01-14 04:23:22,662 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:23:22,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 165 transitions. [2019-01-14 04:23:22,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 84 [2019-01-14 04:23:22,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:23:22,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:23:22,666 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:23:22,666 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] [2019-01-14 04:23:22,666 INFO L794 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(110, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(102, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(102, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 3 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string14.base, #t~string14.offset, 1);call write~init~int(80, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(117, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(109, #t~string14.base, 3 + #t~string14.offset, 1);call write~init~int(112, #t~string14.base, 4 + #t~string14.offset, 1);call write~init~int(58, #t~string14.base, 5 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 6 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string20.base, #t~string20.offset, 1);call write~init~int(32, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string22.base, #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 1 + #t~string22.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(21);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(25);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 396#L-1 havoc main_#res;havoc main_#t~ret4, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 397#L907 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 424#L915 main_#t~ret4 := valid_product_#res;main_~tmp~1 := main_#t~ret4;havoc main_#t~ret4; 418#L198 assume 0 != main_~tmp~1; 419#L172 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 394#L763-1 [2019-01-14 04:23:22,667 INFO L796 eck$LassoCheckResult]: Loop: 394#L763-1 assume !false; 460#L56 assume test_~splverifierCounter~0 < 4; 472#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 471#L65 assume !(0 != test_~tmp~0); 469#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 468#L75 assume !(0 != test_~tmp___0~0); 456#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 441#L85 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 432#L93-2 assume !(0 != ~pumpRunning~0); 429#L227 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret5, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 414#L259 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret23, isHighWaterLevel_~retValue_acc~3, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~3;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~9;havoc isHighWaterSensorDry_~retValue_acc~9; 415#L874 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~9 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~9; 425#L879 isHighWaterLevel_#t~ret23 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret23;havoc isHighWaterLevel_#t~ret23; 445#L361 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~1 := 0; 457#L361-2 isHighWaterLevel_~retValue_acc~3 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~3; 446#L367 processEnvironment_#t~ret5 := isHighWaterLevel_#res;processEnvironment_~tmp~2 := processEnvironment_#t~ret5;havoc processEnvironment_#t~ret5; 384#L263 assume !(0 != processEnvironment_~tmp~2); 386#L234 havoc __utac_acc__Specification3_spec__1_#t~ret59, __utac_acc__Specification3_spec__1_#t~ret60, __utac_acc__Specification3_spec__1_#t~ret61, __utac_acc__Specification3_spec__1_~tmp~7, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~7;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~7;havoc isMethaneLevelCritical_~retValue_acc~7;isMethaneLevelCritical_~retValue_acc~7 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~7; 420#L834 __utac_acc__Specification3_spec__1_#t~ret59 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~7 := __utac_acc__Specification3_spec__1_#t~ret59;havoc __utac_acc__Specification3_spec__1_#t~ret59; 421#L757 assume 0 != __utac_acc__Specification3_spec__1_~tmp~7; 394#L763-1 [2019-01-14 04:23:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:23:22,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:22,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:22,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:22,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:22,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1033973030, now seen corresponding path program 1 times [2019-01-14 04:23:22,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:22,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:22,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:23:22,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:22,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1019261056, now seen corresponding path program 1 times [2019-01-14 04:23:22,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:22,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:23:23,129 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:23:23,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:23:23,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:23:23,786 WARN L181 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-01-14 04:23:24,109 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 04:23:24,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:23:24,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:23:24,131 INFO L87 Difference]: Start difference. First operand 121 states and 165 transitions. cyclomatic complexity: 46 Second operand 5 states. [2019-01-14 04:23:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:23:24,691 INFO L93 Difference]: Finished difference Result 398 states and 547 transitions. [2019-01-14 04:23:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:23:24,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 547 transitions. [2019-01-14 04:23:24,704 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 291 [2019-01-14 04:23:24,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 398 states and 547 transitions. [2019-01-14 04:23:24,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 398 [2019-01-14 04:23:24,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 398 [2019-01-14 04:23:24,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 398 states and 547 transitions. [2019-01-14 04:23:24,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:23:24,727 INFO L706 BuchiCegarLoop]: Abstraction has 398 states and 547 transitions. [2019-01-14 04:23:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states and 547 transitions. [2019-01-14 04:23:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 236. [2019-01-14 04:23:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-14 04:23:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 316 transitions. [2019-01-14 04:23:24,763 INFO L729 BuchiCegarLoop]: Abstraction has 236 states and 316 transitions. [2019-01-14 04:23:24,763 INFO L609 BuchiCegarLoop]: Abstraction has 236 states and 316 transitions. [2019-01-14 04:23:24,763 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:23:24,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 236 states and 316 transitions. [2019-01-14 04:23:24,765 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-01-14 04:23:24,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:23:24,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:23:24,767 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:23:24,767 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:23:24,767 INFO L794 eck$LassoCheckResult]: Stem: 965#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(110, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(102, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(102, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 3 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string14.base, #t~string14.offset, 1);call write~init~int(80, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(117, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(109, #t~string14.base, 3 + #t~string14.offset, 1);call write~init~int(112, #t~string14.base, 4 + #t~string14.offset, 1);call write~init~int(58, #t~string14.base, 5 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 6 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string20.base, #t~string20.offset, 1);call write~init~int(32, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string22.base, #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 1 + #t~string22.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(21);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(25);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 932#L-1 havoc main_#res;havoc main_#t~ret4, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 933#L907 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 962#L915 main_#t~ret4 := valid_product_#res;main_~tmp~1 := main_#t~ret4;havoc main_#t~ret4; 955#L198 assume 0 != main_~tmp~1; 956#L172 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 969#L763-1 [2019-01-14 04:23:24,767 INFO L796 eck$LassoCheckResult]: Loop: 969#L763-1 assume !false; 1103#L56 assume test_~splverifierCounter~0 < 4; 1104#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 1144#L65 assume !(0 != test_~tmp~0); 1142#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 1001#L75 assume !(0 != test_~tmp___0~0); 999#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 983#L85 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 973#L93-2 assume !(0 != ~pumpRunning~0); 970#L227 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret5, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 951#L259 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret23, isHighWaterLevel_~retValue_acc~3, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~3;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~9;havoc isHighWaterSensorDry_~retValue_acc~9; 952#L874 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~9 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~9; 963#L879 isHighWaterLevel_#t~ret23 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret23;havoc isHighWaterLevel_#t~ret23; 1120#L361 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~1 := 0; 1117#L361-2 isHighWaterLevel_~retValue_acc~3 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~3; 1115#L367 processEnvironment_#t~ret5 := isHighWaterLevel_#res;processEnvironment_~tmp~2 := processEnvironment_#t~ret5;havoc processEnvironment_#t~ret5; 921#L263 assume !(0 != processEnvironment_~tmp~2); 923#L234 havoc __utac_acc__Specification3_spec__1_#t~ret59, __utac_acc__Specification3_spec__1_#t~ret60, __utac_acc__Specification3_spec__1_#t~ret61, __utac_acc__Specification3_spec__1_~tmp~7, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~7;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~7;havoc isMethaneLevelCritical_~retValue_acc~7;isMethaneLevelCritical_~retValue_acc~7 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~7; 1110#L834 __utac_acc__Specification3_spec__1_#t~ret59 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~7 := __utac_acc__Specification3_spec__1_#t~ret59;havoc __utac_acc__Specification3_spec__1_#t~ret59; 1109#L757 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~7);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 1108#L866 __utac_acc__Specification3_spec__1_#t~ret60 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret60;havoc __utac_acc__Specification3_spec__1_#t~ret60; 1105#L763 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 969#L763-1 [2019-01-14 04:23:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-01-14 04:23:24,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:24,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1510630356, now seen corresponding path program 1 times [2019-01-14 04:23:24,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:24,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:24,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:24,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:23:24,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:23:24,968 INFO L82 PathProgramCache]: Analyzing trace with hash -257325230, now seen corresponding path program 1 times [2019-01-14 04:23:24,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:23:24,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:23:24,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:23:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:23:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:23:26,167 WARN L181 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-14 04:23:26,307 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-14 04:23:50,630 WARN L181 SmtUtils]: Spent 24.30 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:24:02,028 WARN L181 SmtUtils]: Spent 11.40 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:24:02,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:24:02 BoogieIcfgContainer [2019-01-14 04:24:02,146 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:24:02,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:24:02,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:24:02,149 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:24:02,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:23:20" (3/4) ... [2019-01-14 04:24:02,156 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:24:02,230 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:24:02,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:24:02,231 INFO L168 Benchmark]: Toolchain (without parser) took 43228.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.0 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -338.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:02,232 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:24:02,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:02,233 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.49 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-14 04:24:02,233 INFO L168 Benchmark]: Boogie Preprocessor took 41.98 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:24:02,234 INFO L168 Benchmark]: RCFGBuilder took 1178.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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:02,234 INFO L168 Benchmark]: BuchiAutomizer took 41196.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.1 MB). Peak memory consumption was 400.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:02,238 INFO L168 Benchmark]: Witness Printer took 83.90 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:24:02,248 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 651.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.49 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. * Boogie Preprocessor took 41.98 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 1178.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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41196.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.1 MB). Peak memory consumption was 400.9 MB. Max. memory is 11.5 GB. * Witness Printer took 83.90 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 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 5 locations. The remainder module has 236 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 40.0s. Construction of modules took 0.5s. 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, 162 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 236 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 370 SDtfs, 585 SDslu, 497 SDs, 0 SdLazy, 67 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s 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: 55]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1212} State at position 1 is {NULL=0, NULL=0, NULL=-18, NULL=-13, NULL=0, retValue_acc=0, NULL=0, NULL=1212, NULL=-2, NULL=-24, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cf6b332=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a51fc0c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c910441=66, NULL=-14, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4739313=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18a7f4a2=0, NULL=0, NULL=0, NULL=-4, methaneLevelCritical=0, NULL=-17, tmp___0=0, retValue_acc=1, NULL=0, retValue_acc=0, NULL=0, NULL=0, tmp___1=0, NULL=0, NULL=1211, cleanupTimeShifts=4, tmp=0, NULL=-3, NULL=-21, NULL=-10, NULL=-12, tmp=0, tmp___0=1, NULL=0, systemActive=1, waterLevel=1, NULL=-23, \result=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41a4f215=0, retValue_acc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@448a3c0f=0, NULL=-19, \result=0, NULL=0, NULL=-8, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6863ff1=0, NULL=-6, NULL=0, tmp___0=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, retValue_acc=1, NULL=-20, head=0, pumpRunning=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4da44f34=0, NULL=-11, tmp=1, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@357913a9=0, NULL=0, \result=1, NULL=-16, NULL=-1, NULL=0, tmp=1, retValue_acc=1, tmp___2=66, splverifierCounter=0, \result=0, tmp=0, tmp___1=0, head=0, NULL=0, NULL=-9, NULL=0, NULL=-25, NULL=-5, NULL=-15, NULL=-7} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L112] int cleanupTimeShifts = 4; [L219] int pumpRunning = 0; [L220] int systemActive = 1; [L549] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L791] int waterLevel = 1; [L792] int methaneLevelCritical = 0; [L189] int retValue_acc ; [L190] int tmp ; [L911] int retValue_acc ; [L914] retValue_acc = 1 [L915] return (retValue_acc); [L196] tmp = valid_product() [L198] COND TRUE \read(tmp) [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 Loop: [L55] COND TRUE 1 [L57] COND TRUE splverifierCounter < 4 [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) [L375] systemActive = 1 [L227] COND FALSE !(\read(pumpRunning)) [L234] COND TRUE \read(systemActive) [L256] int tmp ; [L259] COND TRUE ! pumpRunning [L353] int retValue_acc ; [L354] int tmp ; [L355] int tmp___0 ; [L871] int retValue_acc ; [L874] COND TRUE waterLevel < 2 [L875] retValue_acc = 1 [L876] return (retValue_acc); [L359] tmp = isHighWaterSensorDry() [L361] COND TRUE \read(tmp) [L362] tmp___0 = 0 [L366] retValue_acc = tmp___0 [L367] return (retValue_acc); [L261] tmp = isHighWaterLevel() [L263] COND FALSE !(\read(tmp)) [L749] int tmp ; [L750] int tmp___0 ; [L751] int tmp___1 ; [L830] int retValue_acc ; [L833] retValue_acc = methaneLevelCritical [L834] return (retValue_acc); [L755] tmp = isMethaneLevelCritical() [L757] COND FALSE !(\read(tmp)) [L862] int retValue_acc ; [L865] retValue_acc = waterLevel [L866] return (retValue_acc); [L761] tmp___0 = getWaterLevel() [L763] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...