./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product40_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec3_product40_false-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 6b0dd49774129de8b6944c8beb9911dd98f5e936 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:43:30,131 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:43:30,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:43:30,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:43:30,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:43:30,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:43:30,149 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:43:30,151 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:43:30,153 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:43:30,154 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:43:30,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:43:30,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:43:30,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:43:30,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:43:30,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:43:30,160 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:43:30,161 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:43:30,163 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:43:30,165 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:43:30,167 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:43:30,168 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:43:30,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:43:30,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:43:30,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:43:30,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:43:30,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:43:30,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:43:30,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:43:30,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:43:30,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:43:30,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:43:30,180 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:43:30,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:43:30,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:43:30,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:43:30,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:43:30,183 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:43:30,199 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:43:30,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:43:30,201 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:43:30,201 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:43:30,201 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:43:30,202 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:43:30,202 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:43:30,202 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:43:30,202 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:43:30,202 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:43:30,203 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:43:30,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:43:30,203 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:43:30,203 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:43:30,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:43:30,203 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:43:30,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:43:30,205 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:43:30,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:43:30,205 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:43:30,206 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:43:30,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:43:30,206 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:43:30,206 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:43:30,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:43:30,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:43:30,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:43:30,207 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:43:30,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:43:30,208 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:43:30,208 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:43:30,210 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:43:30,210 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 -> 6b0dd49774129de8b6944c8beb9911dd98f5e936 [2019-01-01 23:43:30,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:43:30,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:43:30,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:43:30,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:43:30,265 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:43:30,266 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product40_false-unreach-call_false-termination.cil.c [2019-01-01 23:43:30,326 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685ae42e8/dacf59203b8b4a66863fe540fdd7c994/FLAG3f33c81a7 [2019-01-01 23:43:30,846 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:43:30,847 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product40_false-unreach-call_false-termination.cil.c [2019-01-01 23:43:30,859 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685ae42e8/dacf59203b8b4a66863fe540fdd7c994/FLAG3f33c81a7 [2019-01-01 23:43:31,136 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685ae42e8/dacf59203b8b4a66863fe540fdd7c994 [2019-01-01 23:43:31,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:43:31,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:43:31,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:43:31,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:43:31,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:43:31,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:31,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fb2347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31, skipping insertion in model container [2019-01-01 23:43:31,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:31,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:43:31,210 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:43:31,647 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:43:31,681 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:43:31,895 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:43:31,936 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:43:31,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31 WrapperNode [2019-01-01 23:43:31,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:43:31,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:43:31,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:43:31,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:43:31,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:31,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:32,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:43:32,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:43:32,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:43:32,017 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:43:32,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:32,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:32,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:32,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:32,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:32,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:32,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... [2019-01-01 23:43:32,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:43:32,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:43:32,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:43:32,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:43:32,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:43:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:43:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:43:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:43:32,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:43:33,343 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:43:33,344 INFO L280 CfgBuilder]: Removed 168 assue(true) statements. [2019-01-01 23:43:33,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:43:33 BoogieIcfgContainer [2019-01-01 23:43:33,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:43:33,345 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:43:33,345 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:43:33,349 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:43:33,350 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:43:33,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:43:31" (1/3) ... [2019-01-01 23:43:33,351 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@435e3303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:43:33, skipping insertion in model container [2019-01-01 23:43:33,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:43:33,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:43:31" (2/3) ... [2019-01-01 23:43:33,352 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@435e3303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:43:33, skipping insertion in model container [2019-01-01 23:43:33,352 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:43:33,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:43:33" (3/3) ... [2019-01-01 23:43:33,354 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product40_false-unreach-call_false-termination.cil.c [2019-01-01 23:43:33,412 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:43:33,413 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:43:33,413 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:43:33,413 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:43:33,413 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:43:33,414 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:43:33,414 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:43:33,414 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:43:33,414 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:43:33,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states. [2019-01-01 23:43:33,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-01-01 23:43:33,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:43:33,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:43:33,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:43:33,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:43:33,476 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:43:33,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states. [2019-01-01 23:43:33,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-01-01 23:43:33,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:43:33,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:43:33,493 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:43:33,493 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:43:33,502 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(13);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string8.base, #t~string8.offset, 1);call write~init~int(77, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(101, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(116, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(104, #t~string8.base, 4 + #t~string8.offset, 1);call write~init~int(58, #t~string8.base, 5 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 6 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string10.base, #t~string10.offset, 1);call write~init~int(82, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(73, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(84, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 4 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(75, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string14.base, #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 1 + #t~string14.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 8#L-1true havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 45#L166true havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 69#L174true main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 67#L130true assume 0 != main_~tmp~0; 21#L103true havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 77#L198-1true [2019-01-01 23:43:33,502 INFO L796 eck$LassoCheckResult]: Loop: 77#L198-1true assume !false; 103#L539true assume test_~splverifierCounter~0 < 4; 65#L540true test_~tmp~5 := test_#t~nondet35;havoc test_#t~nondet35; 71#L548true assume !(0 != test_~tmp~5); 72#L548-1true test_~tmp___0~2 := test_#t~nondet36;havoc test_#t~nondet36; 105#L558true assume !(0 != test_~tmp___0~2); 106#L558-1true test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 42#L568true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 61#L576-1true assume !(0 != ~pumpRunning~0); 41#L334true assume !(0 != ~systemActive~0); 98#L341true havoc __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_#t~ret3, __utac_acc__Specification3_spec__1_#t~ret4, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 92#L272-1true __utac_acc__Specification3_spec__1_#t~ret2 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret2;havoc __utac_acc__Specification3_spec__1_#t~ret2; 108#L192true assume 0 != __utac_acc__Specification3_spec__1_~tmp~1; 77#L198-1true [2019-01-01 23:43:33,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:43:33,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:33,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:33,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:33,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:43:33,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:34,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1670447617, now seen corresponding path program 1 times [2019-01-01 23:43:34,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:34,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:34,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:43:34,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:43:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:43:34,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:43:34,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:43:34,527 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:43:34,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:43:34,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:43:34,547 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 3 states. [2019-01-01 23:43:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:43:34,826 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2019-01-01 23:43:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:43:34,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 330 transitions. [2019-01-01 23:43:34,843 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2019-01-01 23:43:34,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 212 states and 315 transitions. [2019-01-01 23:43:34,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2019-01-01 23:43:34,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2019-01-01 23:43:34,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 315 transitions. [2019-01-01 23:43:34,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:43:34,870 INFO L705 BuchiCegarLoop]: Abstraction has 212 states and 315 transitions. [2019-01-01 23:43:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 315 transitions. [2019-01-01 23:43:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-01-01 23:43:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-01 23:43:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 312 transitions. [2019-01-01 23:43:34,929 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 312 transitions. [2019-01-01 23:43:34,930 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 312 transitions. [2019-01-01 23:43:34,930 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:43:34,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 312 transitions. [2019-01-01 23:43:34,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2019-01-01 23:43:34,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:43:34,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:43:34,935 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:43:34,935 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:43:34,936 INFO L794 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(13);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string8.base, #t~string8.offset, 1);call write~init~int(77, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(101, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(116, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(104, #t~string8.base, 4 + #t~string8.offset, 1);call write~init~int(58, #t~string8.base, 5 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 6 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string10.base, #t~string10.offset, 1);call write~init~int(82, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(73, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(84, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 4 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(75, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string14.base, #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 1 + #t~string14.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 360#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 361#L166 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 427#L174 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 442#L130 assume 0 != main_~tmp~0; 383#L103 havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 384#L198-1 [2019-01-01 23:43:34,936 INFO L796 eck$LassoCheckResult]: Loop: 384#L198-1 assume !false; 471#L539 assume test_~splverifierCounter~0 < 4; 440#L540 test_~tmp~5 := test_#t~nondet35;havoc test_#t~nondet35; 441#L548 assume !(0 != test_~tmp~5); 444#L548-1 test_~tmp___0~2 := test_#t~nondet36;havoc test_#t~nondet36; 445#L558 assume !(0 != test_~tmp___0~2); 474#L558-1 test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 422#L568 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 423#L576-1 assume !(0 != ~pumpRunning~0); 420#L334 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret16, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 421#L392 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret15, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 498#L366-1 assume !(0 == ~pumpRunning~0); 470#L341 havoc __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_#t~ret3, __utac_acc__Specification3_spec__1_#t~ret4, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 465#L272-1 __utac_acc__Specification3_spec__1_#t~ret2 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret2;havoc __utac_acc__Specification3_spec__1_#t~ret2; 466#L192 assume 0 != __utac_acc__Specification3_spec__1_~tmp~1; 384#L198-1 [2019-01-01 23:43:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:34,941 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:43:34,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:34,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:34,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:43:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:35,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1422660394, now seen corresponding path program 1 times [2019-01-01 23:43:35,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:35,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:35,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:35,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:43:35,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:43:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:43:35,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:43:35,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:43:35,307 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:43:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:43:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:43:35,307 INFO L87 Difference]: Start difference. First operand 210 states and 312 transitions. cyclomatic complexity: 105 Second operand 3 states. [2019-01-01 23:43:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:43:35,835 INFO L93 Difference]: Finished difference Result 305 states and 430 transitions. [2019-01-01 23:43:35,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:43:35,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 305 states and 430 transitions. [2019-01-01 23:43:35,842 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 215 [2019-01-01 23:43:35,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 305 states to 305 states and 430 transitions. [2019-01-01 23:43:35,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 305 [2019-01-01 23:43:35,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 305 [2019-01-01 23:43:35,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 305 states and 430 transitions. [2019-01-01 23:43:35,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:43:35,849 INFO L705 BuchiCegarLoop]: Abstraction has 305 states and 430 transitions. [2019-01-01 23:43:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states and 430 transitions. [2019-01-01 23:43:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-01-01 23:43:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-01 23:43:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 430 transitions. [2019-01-01 23:43:35,869 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 430 transitions. [2019-01-01 23:43:35,869 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 430 transitions. [2019-01-01 23:43:35,869 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:43:35,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 430 transitions. [2019-01-01 23:43:35,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 215 [2019-01-01 23:43:35,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:43:35,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:43:35,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:43:35,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:43:35,874 INFO L794 eck$LassoCheckResult]: Stem: 987#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(13);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string8.base, #t~string8.offset, 1);call write~init~int(77, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(101, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(116, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(104, #t~string8.base, 4 + #t~string8.offset, 1);call write~init~int(58, #t~string8.base, 5 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 6 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string10.base, #t~string10.offset, 1);call write~init~int(82, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(73, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(84, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 4 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(75, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string14.base, #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 1 + #t~string14.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 882#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 883#L166 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 948#L174 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 969#L130 assume 0 != main_~tmp~0; 905#L103 havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 906#L198-1 [2019-01-01 23:43:35,874 INFO L796 eck$LassoCheckResult]: Loop: 906#L198-1 assume !false; 1000#L539 assume test_~splverifierCounter~0 < 4; 967#L540 test_~tmp~5 := test_#t~nondet35;havoc test_#t~nondet35; 968#L548 assume !(0 != test_~tmp~5); 972#L548-1 test_~tmp___0~2 := test_#t~nondet36;havoc test_#t~nondet36; 973#L558 assume !(0 != test_~tmp___0~2); 975#L558-1 test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 1054#L568 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 944#L576-1 assume !(0 != ~pumpRunning~0); 964#L334 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret16, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 1082#L392 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret15, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 978#L366-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret34, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~5;havoc isHighWaterSensorDry_~retValue_acc~5; 979#L312-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~5 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~5; 1080#L317-1 isHighWaterLevel_#t~ret34 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret34;havoc isHighWaterLevel_#t~ret34; 1078#L494-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 1075#L494-5 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 1074#L500-1 processEnvironment__wrappee__highWaterSensor_#t~ret15 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret15;havoc processEnvironment__wrappee__highWaterSensor_#t~ret15; 930#L370-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 927#L341 havoc __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_#t~ret3, __utac_acc__Specification3_spec__1_#t~ret4, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 1069#L272-1 __utac_acc__Specification3_spec__1_#t~ret2 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret2;havoc __utac_acc__Specification3_spec__1_#t~ret2; 1064#L192 assume 0 != __utac_acc__Specification3_spec__1_~tmp~1; 906#L198-1 [2019-01-01 23:43:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:43:35,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:35,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:35,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:35,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:43:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:36,199 INFO L82 PathProgramCache]: Analyzing trace with hash 287627938, now seen corresponding path program 1 times [2019-01-01 23:43:36,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:36,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:36,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:36,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:43:36,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:36,220 INFO L82 PathProgramCache]: Analyzing trace with hash 743699132, now seen corresponding path program 1 times [2019-01-01 23:43:36,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:36,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:36,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:43:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:43:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:43:36,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:43:36,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:43:37,278 WARN L181 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-01-01 23:43:37,412 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 23:43:37,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:43:37,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:43:37,424 INFO L87 Difference]: Start difference. First operand 305 states and 430 transitions. cyclomatic complexity: 128 Second operand 5 states. [2019-01-01 23:43:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:43:38,120 INFO L93 Difference]: Finished difference Result 1017 states and 1438 transitions. [2019-01-01 23:43:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:43:38,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1017 states and 1438 transitions. [2019-01-01 23:43:38,136 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 762 [2019-01-01 23:43:38,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1017 states to 1017 states and 1438 transitions. [2019-01-01 23:43:38,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1017 [2019-01-01 23:43:38,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1017 [2019-01-01 23:43:38,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1017 states and 1438 transitions. [2019-01-01 23:43:38,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:43:38,162 INFO L705 BuchiCegarLoop]: Abstraction has 1017 states and 1438 transitions. [2019-01-01 23:43:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states and 1438 transitions. [2019-01-01 23:43:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 604. [2019-01-01 23:43:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-01-01 23:43:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 838 transitions. [2019-01-01 23:43:38,213 INFO L728 BuchiCegarLoop]: Abstraction has 604 states and 838 transitions. [2019-01-01 23:43:38,213 INFO L608 BuchiCegarLoop]: Abstraction has 604 states and 838 transitions. [2019-01-01 23:43:38,213 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:43:38,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 604 states and 838 transitions. [2019-01-01 23:43:38,219 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 430 [2019-01-01 23:43:38,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:43:38,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:43:38,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:43:38,223 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:43:38,223 INFO L794 eck$LassoCheckResult]: Stem: 2324#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(13);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string8.base, #t~string8.offset, 1);call write~init~int(77, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(101, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(116, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(104, #t~string8.base, 4 + #t~string8.offset, 1);call write~init~int(58, #t~string8.base, 5 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 6 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string10.base, #t~string10.offset, 1);call write~init~int(82, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(73, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(84, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 4 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(75, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string14.base, #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 1 + #t~string14.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 2221#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 2222#L166 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 2288#L174 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 2308#L130 assume 0 != main_~tmp~0; 2246#L103 havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2247#L198-1 [2019-01-01 23:43:38,226 INFO L796 eck$LassoCheckResult]: Loop: 2247#L198-1 assume !false; 2315#L539 assume test_~splverifierCounter~0 < 4; 2306#L540 test_~tmp~5 := test_#t~nondet35;havoc test_#t~nondet35; 2307#L548 assume !(0 != test_~tmp~5); 2310#L548-1 test_~tmp___0~2 := test_#t~nondet36;havoc test_#t~nondet36; 2311#L558 assume !(0 != test_~tmp___0~2); 2343#L558-1 test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 2285#L568 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2286#L576-1 assume !(0 != ~pumpRunning~0); 2281#L334 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret16, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 2282#L392 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret15, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 2555#L366-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret34, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~5;havoc isHighWaterSensorDry_~retValue_acc~5; 2290#L312-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~5 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~5; 2291#L317-1 isHighWaterLevel_#t~ret34 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret34;havoc isHighWaterLevel_#t~ret34; 2248#L494-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 2223#L494-5 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 2224#L500-1 processEnvironment__wrappee__highWaterSensor_#t~ret15 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret15;havoc processEnvironment__wrappee__highWaterSensor_#t~ret15; 2270#L370-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 2267#L341 havoc __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_#t~ret3, __utac_acc__Specification3_spec__1_#t~ret4, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 2329#L272-1 __utac_acc__Specification3_spec__1_#t~ret2 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret2;havoc __utac_acc__Specification3_spec__1_#t~ret2; 2330#L192 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~1);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~4;havoc getWaterLevel_~retValue_acc~4;getWaterLevel_~retValue_acc~4 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~4; 2276#L304 __utac_acc__Specification3_spec__1_#t~ret3 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret3;havoc __utac_acc__Specification3_spec__1_#t~ret3; 2277#L198 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 2247#L198-1 [2019-01-01 23:43:38,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:38,229 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-01-01 23:43:38,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:38,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:38,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:43:38,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1532549460, now seen corresponding path program 1 times [2019-01-01 23:43:38,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:38,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:38,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:38,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:43:38,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:38,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:38,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1730302702, now seen corresponding path program 1 times [2019-01-01 23:43:38,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:38,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:43:38,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:39,488 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-01 23:43:39,749 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 23:44:04,548 WARN L181 SmtUtils]: Spent 24.78 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:44:20,522 WARN L181 SmtUtils]: Spent 15.97 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:44:20,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:44:20 BoogieIcfgContainer [2019-01-01 23:44:20,601 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:44:20,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:44:20,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:44:20,602 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:44:20,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:43:33" (3/4) ... [2019-01-01 23:44:20,606 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:44:20,715 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:44:20,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:44:20,716 INFO L168 Benchmark]: Toolchain (without parser) took 49574.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -249.5 MB). Peak memory consumption was 93.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:44:20,717 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:44:20,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:44:20,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:44:20,719 INFO L168 Benchmark]: Boogie Preprocessor took 50.57 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-01 23:44:20,719 INFO L168 Benchmark]: RCFGBuilder took 1276.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.4 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:44:20,720 INFO L168 Benchmark]: BuchiAutomizer took 47255.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.8 MB). Peak memory consumption was 399.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:44:20,720 INFO L168 Benchmark]: Witness Printer took 114.15 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 23:44:20,724 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 793.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.06 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 50.57 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 1276.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.4 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47255.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.8 MB). Peak memory consumption was 399.2 MB. Max. memory is 11.5 GB. * Witness Printer took 114.15 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 604 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 45.2s. 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 415 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 604 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 560 SDtfs, 913 SDslu, 934 SDs, 0 SdLazy, 110 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s 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: 538]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=2358} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d6b7212=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25049ee4=0, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22305d95=0, retValue_acc=0, NULL=2358, NULL=-7, NULL=0, NULL=0, methaneLevelCritical=0, NULL=-5, tmp___0=0, NULL=0, tmp=0, NULL=0, NULL=-9, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ed08073=0, retValue_acc=0, NULL=2357, NULL=0, tmp___1=0, NULL=-17, NULL=-12, NULL=0, NULL=0, tmp___0=1, tmp=0, cleanupTimeShifts=4, NULL=-13, NULL=-14, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25b581c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a577c08=65, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7820b090=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@927fe11=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=2356, \result=1, NULL=0, NULL=-16, NULL=0, retValue_acc=0, NULL=-23, \result=0, NULL=0, NULL=-18, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, tmp=1, NULL=-20, \result=0, retValue_acc=1, NULL=-8, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64e4fbd4=0, NULL=0, NULL=-21, NULL=0, NULL=0, \result=1, NULL=-22, NULL=-15, NULL=0, tmp=1, retValue_acc=1, tmp___2=65, tmp___0=0, retValue_acc=1, splverifierCounter=0, NULL=0, \result=0, NULL=-1, NULL=-3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33aabaf4=0, NULL=-6, tmp___1=0, tmp=0, head=0, NULL=-4, NULL=-10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28a8034d=0, NULL=0, NULL=-19} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L40] int cleanupTimeShifts = 4; [L229] int waterLevel = 1; [L230] int methaneLevelCritical = 0; [L327] int pumpRunning = 0; [L328] int systemActive = 1; [L766] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L121] int retValue_acc ; [L122] int tmp ; [L170] int retValue_acc ; [L173] retValue_acc = 1 [L174] return (retValue_acc); [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) [L529] int splverifierCounter ; [L530] int tmp ; [L531] int tmp___0 ; [L532] int tmp___1 ; [L533] int tmp___2 ; [L536] splverifierCounter = 0 Loop: [L538] COND TRUE 1 [L540] COND TRUE splverifierCounter < 4 [L546] tmp = __VERIFIER_nondet_int() [L548] COND FALSE !(\read(tmp)) [L556] tmp___0 = __VERIFIER_nondet_int() [L558] COND FALSE !(\read(tmp___0)) [L566] tmp___2 = __VERIFIER_nondet_int() [L568] COND TRUE \read(tmp___2) [L523] systemActive = 1 [L334] COND FALSE !(\read(pumpRunning)) [L341] COND TRUE \read(systemActive) [L389] int tmp ; [L392] COND FALSE !(\read(pumpRunning)) [L363] int tmp ; [L366] COND TRUE ! pumpRunning [L486] int retValue_acc ; [L487] int tmp ; [L488] int tmp___0 ; [L309] int retValue_acc ; [L312] COND TRUE waterLevel < 2 [L313] retValue_acc = 1 [L314] return (retValue_acc); [L492] tmp = isHighWaterSensorDry() [L494] COND TRUE \read(tmp) [L495] tmp___0 = 0 [L499] retValue_acc = tmp___0 [L500] return (retValue_acc); [L368] tmp = isHighWaterLevel() [L370] COND FALSE !(\read(tmp)) [L184] int tmp ; [L185] int tmp___0 ; [L186] int tmp___1 ; [L268] int retValue_acc ; [L271] retValue_acc = methaneLevelCritical [L272] return (retValue_acc); [L190] tmp = isMethaneLevelCritical() [L192] COND FALSE !(\read(tmp)) [L300] int retValue_acc ; [L303] retValue_acc = waterLevel [L304] return (retValue_acc); [L196] tmp___0 = getWaterLevel() [L198] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...