./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product59_false-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_product59_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 fb1767f688fc9701e1f3b125f3120ace113b61a7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:38,496 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:24:38,498 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:24:38,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:24:38,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:24:38,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:24:38,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:24:38,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:24:38,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:24:38,527 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:24:38,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:24:38,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:24:38,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:24:38,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:24:38,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:24:38,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:24:38,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:24:38,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:24:38,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:24:38,556 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:24:38,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:24:38,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:24:38,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:24:38,567 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:24:38,568 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:24:38,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:24:38,570 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:24:38,570 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:24:38,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:24:38,573 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:24:38,574 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:24:38,574 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:24:38,574 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:24:38,575 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:24:38,575 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:24:38,576 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:24:38,576 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:24:38,592 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:24:38,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:24:38,593 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:24:38,593 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:24:38,593 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:24:38,594 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:24:38,594 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:24:38,594 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:24:38,594 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:24:38,594 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:24:38,594 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:24:38,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:24:38,595 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:24:38,595 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:24:38,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:24:38,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:24:38,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:24:38,595 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:24:38,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:24:38,596 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:24:38,596 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:24:38,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:24:38,596 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:24:38,596 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:24:38,597 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:24:38,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:24:38,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:24:38,597 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:24:38,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:24:38,597 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:24:38,598 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:24:38,599 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:24:38,599 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 -> fb1767f688fc9701e1f3b125f3120ace113b61a7 [2019-01-14 04:24:38,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:24:38,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:24:38,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:24:38,679 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:24:38,679 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:24:38,680 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product59_false-unreach-call_false-termination.cil.c [2019-01-14 04:24:38,745 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abab98224/ea13e94955ff4aff842930b07822201a/FLAG25d0eed0a [2019-01-14 04:24:39,204 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:24:39,205 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product59_false-unreach-call_false-termination.cil.c [2019-01-14 04:24:39,220 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abab98224/ea13e94955ff4aff842930b07822201a/FLAG25d0eed0a [2019-01-14 04:24:39,499 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abab98224/ea13e94955ff4aff842930b07822201a [2019-01-14 04:24:39,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:24:39,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:24:39,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:24:39,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:24:39,508 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:24:39,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:24:39" (1/1) ... [2019-01-14 04:24:39,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717160ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:39, skipping insertion in model container [2019-01-14 04:24:39,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:24:39" (1/1) ... [2019-01-14 04:24:39,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:24:39,582 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:24:40,034 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:24:40,067 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:24:40,276 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:24:40,320 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:24:40,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40 WrapperNode [2019-01-14 04:24:40,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:24:40,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:24:40,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:24:40,322 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:24:40,331 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:24:40" (1/1) ... [2019-01-14 04:24:40,351 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:24:40" (1/1) ... [2019-01-14 04:24:40,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:24:40,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:24:40,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:24:40,436 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:24:40,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40" (1/1) ... [2019-01-14 04:24:40,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40" (1/1) ... [2019-01-14 04:24:40,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40" (1/1) ... [2019-01-14 04:24:40,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40" (1/1) ... [2019-01-14 04:24:40,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40" (1/1) ... [2019-01-14 04:24:40,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40" (1/1) ... [2019-01-14 04:24:40,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40" (1/1) ... [2019-01-14 04:24:40,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:24:40,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:24:40,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:24:40,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:24:40,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40" (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:24:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:24:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:24:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:24:40,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:24:41,991 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:24:41,992 INFO L286 CfgBuilder]: Removed 202 assue(true) statements. [2019-01-14 04:24:41,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:24:41 BoogieIcfgContainer [2019-01-14 04:24:41,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:24:41,994 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:24:41,994 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:24:41,998 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:24:41,999 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:24:42,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:24:39" (1/3) ... [2019-01-14 04:24:42,004 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46d8ac5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:24:42, skipping insertion in model container [2019-01-14 04:24:42,004 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:24:42,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:24:40" (2/3) ... [2019-01-14 04:24:42,006 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46d8ac5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:24:42, skipping insertion in model container [2019-01-14 04:24:42,006 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:24:42,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:24:41" (3/3) ... [2019-01-14 04:24:42,009 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product59_false-unreach-call_false-termination.cil.c [2019-01-14 04:24:42,072 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:24:42,072 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:24:42,073 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:24:42,073 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:24:42,073 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:24:42,073 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:24:42,073 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:24:42,073 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:24:42,074 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:24:42,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2019-01-14 04:24:42,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 91 [2019-01-14 04:24:42,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:42,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:42,148 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:42,149 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:42,149 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:24:42,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2019-01-14 04:24:42,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 91 [2019-01-14 04:24:42,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:42,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:42,159 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:42,159 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:42,164 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);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(80, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(117, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(109, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(112, #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(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(110, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(102, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(102, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 3 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(32, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 17#L-1true havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~7, main_~tmp~3;havoc main_~retValue_acc~7;havoc main_~tmp~3; 107#L641true havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 108#L649true main_#t~ret45 := valid_product_#res;main_~tmp~3 := main_#t~ret45;havoc main_#t~ret45; 114#L605true assume 0 != main_~tmp~3; 90#L578true havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 111#L671-1true [2019-01-14 04:24:42,165 INFO L796 eck$LassoCheckResult]: Loop: 111#L671-1true assume !false; 62#L711true assume test_~splverifierCounter~0 < 4; 135#L712true test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 31#L720true assume !(0 != test_~tmp~5); 37#L720-1true test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 69#L730true assume !(0 != test_~tmp___0~1); 64#L730-1true test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 106#L740true assume 0 != test_~tmp___2~0; 77#L746-1true assume !(0 != ~pumpRunning~0); 101#L776true assume !(0 != ~systemActive~0); 58#L783true havoc __utac_acc__Specification3_spec__1_#t~ret47, __utac_acc__Specification3_spec__1_#t~ret48, __utac_acc__Specification3_spec__1_#t~ret49, __utac_acc__Specification3_spec__1_~tmp~4, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~4;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; 83#L457-2true __utac_acc__Specification3_spec__1_#t~ret47 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~4 := __utac_acc__Specification3_spec__1_#t~ret47;havoc __utac_acc__Specification3_spec__1_#t~ret47; 5#L665true assume 0 != __utac_acc__Specification3_spec__1_~tmp~4; 111#L671-1true [2019-01-14 04:24:42,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:42,172 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:24:42,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:42,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:42,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:43,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1670509186, now seen corresponding path program 1 times [2019-01-14 04:24:43,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:43,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:43,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:43,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:43,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:43,043 INFO L82 PathProgramCache]: Analyzing trace with hash 43769752, now seen corresponding path program 1 times [2019-01-14 04:24:43,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:43,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:43,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:43,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:43,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:43,418 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:24:43,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:43,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:24:43,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:24:43,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:24:43,600 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 6 states. [2019-01-14 04:24:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:44,096 INFO L93 Difference]: Finished difference Result 330 states and 471 transitions. [2019-01-14 04:24:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:24:44,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 330 states and 471 transitions. [2019-01-14 04:24:44,124 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 213 [2019-01-14 04:24:44,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 330 states to 309 states and 450 transitions. [2019-01-14 04:24:44,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2019-01-14 04:24:44,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2019-01-14 04:24:44,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 450 transitions. [2019-01-14 04:24:44,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:44,154 INFO L706 BuchiCegarLoop]: Abstraction has 309 states and 450 transitions. [2019-01-14 04:24:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 450 transitions. [2019-01-14 04:24:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 180. [2019-01-14 04:24:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 04:24:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 261 transitions. [2019-01-14 04:24:44,197 INFO L729 BuchiCegarLoop]: Abstraction has 180 states and 261 transitions. [2019-01-14 04:24:44,197 INFO L609 BuchiCegarLoop]: Abstraction has 180 states and 261 transitions. [2019-01-14 04:24:44,197 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:24:44,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 261 transitions. [2019-01-14 04:24:44,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 124 [2019-01-14 04:24:44,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:44,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:44,201 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:44,201 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:44,202 INFO L794 eck$LassoCheckResult]: Stem: 603#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);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(80, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(117, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(109, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(112, #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(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(110, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(102, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(102, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 3 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(32, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 517#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~7, main_~tmp~3;havoc main_~retValue_acc~7;havoc main_~tmp~3; 518#L641 havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 605#L649 main_#t~ret45 := valid_product_#res;main_~tmp~3 := main_#t~ret45;havoc main_#t~ret45; 606#L605 assume 0 != main_~tmp~3; 593#L578 havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 494#L671-1 [2019-01-14 04:24:44,202 INFO L796 eck$LassoCheckResult]: Loop: 494#L671-1 assume !false; 573#L711 assume test_~splverifierCounter~0 < 4; 574#L712 test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 543#L720 assume !(0 != test_~tmp~5); 545#L720-1 test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 551#L730 assume !(0 != test_~tmp___0~1); 576#L730-1 test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 577#L740 assume 0 != test_~tmp___2~0; 584#L746-1 assume !(0 != ~pumpRunning~0); 489#L776 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret55, processEnvironment_~tmp~7;havoc processEnvironment_~tmp~7; 594#L834 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret54, processEnvironment__wrappee__highWaterSensor_~tmp~6;havoc processEnvironment__wrappee__highWaterSensor_~tmp~6; 530#L808-1 assume !(0 == ~pumpRunning~0); 525#L783 havoc __utac_acc__Specification3_spec__1_#t~ret47, __utac_acc__Specification3_spec__1_#t~ret48, __utac_acc__Specification3_spec__1_#t~ret49, __utac_acc__Specification3_spec__1_~tmp~4, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~4;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; 570#L457-2 __utac_acc__Specification3_spec__1_#t~ret47 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~4 := __utac_acc__Specification3_spec__1_#t~ret47;havoc __utac_acc__Specification3_spec__1_#t~ret47; 493#L665 assume 0 != __utac_acc__Specification3_spec__1_~tmp~4; 494#L671-1 [2019-01-14 04:24:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:24:44,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:44,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:44,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1972735879, now seen corresponding path program 1 times [2019-01-14 04:24:44,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:44,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:44,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:44,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:44,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:44,631 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:24:44,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:44,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:24:44,632 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:24:44,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:24:44,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:24:44,635 INFO L87 Difference]: Start difference. First operand 180 states and 261 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-01-14 04:24:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:45,061 INFO L93 Difference]: Finished difference Result 225 states and 310 transitions. [2019-01-14 04:24:45,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:24:45,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 310 transitions. [2019-01-14 04:24:45,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 158 [2019-01-14 04:24:45,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 225 states and 310 transitions. [2019-01-14 04:24:45,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2019-01-14 04:24:45,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 225 [2019-01-14 04:24:45,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 310 transitions. [2019-01-14 04:24:45,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:45,080 INFO L706 BuchiCegarLoop]: Abstraction has 225 states and 310 transitions. [2019-01-14 04:24:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 310 transitions. [2019-01-14 04:24:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-01-14 04:24:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-14 04:24:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 310 transitions. [2019-01-14 04:24:45,094 INFO L729 BuchiCegarLoop]: Abstraction has 225 states and 310 transitions. [2019-01-14 04:24:45,094 INFO L609 BuchiCegarLoop]: Abstraction has 225 states and 310 transitions. [2019-01-14 04:24:45,094 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:24:45,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 310 transitions. [2019-01-14 04:24:45,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 158 [2019-01-14 04:24:45,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:45,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:45,098 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:45,098 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:24:45,098 INFO L794 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);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(80, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(117, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(109, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(112, #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(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(110, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(102, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(102, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 3 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(32, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 928#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~7, main_~tmp~3;havoc main_~retValue_acc~7;havoc main_~tmp~3; 929#L641 havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 1021#L649 main_#t~ret45 := valid_product_#res;main_~tmp~3 := main_#t~ret45;havoc main_#t~ret45; 1022#L605 assume 0 != main_~tmp~3; 1008#L578 havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 905#L671-1 [2019-01-14 04:24:45,098 INFO L796 eck$LassoCheckResult]: Loop: 905#L671-1 assume !false; 987#L711 assume test_~splverifierCounter~0 < 4; 988#L712 test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 955#L720 assume !(0 != test_~tmp~5); 957#L720-1 test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 963#L730 assume !(0 != test_~tmp___0~1); 990#L730-1 test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 991#L740 assume 0 != test_~tmp___2~0; 998#L746-1 assume !(0 != ~pumpRunning~0); 999#L776 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret55, processEnvironment_~tmp~7;havoc processEnvironment_~tmp~7; 1009#L834 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret54, processEnvironment__wrappee__highWaterSensor_~tmp~6;havoc processEnvironment__wrappee__highWaterSensor_~tmp~6; 942#L808-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret74, isHighWaterLevel_~retValue_acc~12, isHighWaterLevel_~tmp~9, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~12;havoc isHighWaterLevel_~tmp~9;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~5;havoc isHighWaterSensorDry_~retValue_acc~5; 943#L497-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~5 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~5; 958#L502-1 isHighWaterLevel_#t~ret74 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~9 := isHighWaterLevel_#t~ret74;havoc isHighWaterLevel_#t~ret74; 914#L954-3 assume 0 != isHighWaterLevel_~tmp~9;isHighWaterLevel_~tmp___0~2 := 0; 915#L954-5 isHighWaterLevel_~retValue_acc~12 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~12; 922#L960-1 processEnvironment__wrappee__highWaterSensor_#t~ret54 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~6 := processEnvironment__wrappee__highWaterSensor_#t~ret54;havoc processEnvironment__wrappee__highWaterSensor_#t~ret54; 1012#L812-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~6); 980#L783 havoc __utac_acc__Specification3_spec__1_#t~ret47, __utac_acc__Specification3_spec__1_#t~ret48, __utac_acc__Specification3_spec__1_#t~ret49, __utac_acc__Specification3_spec__1_~tmp~4, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~4;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; 984#L457-2 __utac_acc__Specification3_spec__1_#t~ret47 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~4 := __utac_acc__Specification3_spec__1_#t~ret47;havoc __utac_acc__Specification3_spec__1_#t~ret47; 904#L665 assume 0 != __utac_acc__Specification3_spec__1_~tmp~4; 905#L671-1 [2019-01-14 04:24:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:24:45,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:45,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1765215501, now seen corresponding path program 1 times [2019-01-14 04:24:45,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:45,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1309144307, now seen corresponding path program 1 times [2019-01-14 04:24:45,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:45,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:45,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:45,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:45,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:24:45,674 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:24:45,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:24:45,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:24:46,651 WARN L181 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-01-14 04:24:47,158 WARN L181 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-14 04:24:47,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:24:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:24:47,171 INFO L87 Difference]: Start difference. First operand 225 states and 310 transitions. cyclomatic complexity: 88 Second operand 5 states. [2019-01-14 04:24:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:24:47,668 INFO L93 Difference]: Finished difference Result 771 states and 1066 transitions. [2019-01-14 04:24:47,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:24:47,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 771 states and 1066 transitions. [2019-01-14 04:24:47,682 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 575 [2019-01-14 04:24:47,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 771 states to 771 states and 1066 transitions. [2019-01-14 04:24:47,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 771 [2019-01-14 04:24:47,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 771 [2019-01-14 04:24:47,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 771 states and 1066 transitions. [2019-01-14 04:24:47,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:24:47,695 INFO L706 BuchiCegarLoop]: Abstraction has 771 states and 1066 transitions. [2019-01-14 04:24:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states and 1066 transitions. [2019-01-14 04:24:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 444. [2019-01-14 04:24:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-01-14 04:24:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 602 transitions. [2019-01-14 04:24:47,729 INFO L729 BuchiCegarLoop]: Abstraction has 444 states and 602 transitions. [2019-01-14 04:24:47,729 INFO L609 BuchiCegarLoop]: Abstraction has 444 states and 602 transitions. [2019-01-14 04:24:47,729 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:24:47,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 444 states and 602 transitions. [2019-01-14 04:24:47,733 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 316 [2019-01-14 04:24:47,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:24:47,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:24:47,737 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:24:47,737 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, 1] [2019-01-14 04:24:47,738 INFO L794 eck$LassoCheckResult]: Stem: 2053#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);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(80, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(117, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(109, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(112, #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(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(110, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(102, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(102, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 3 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(32, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 1943#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~7, main_~tmp~3;havoc main_~retValue_acc~7;havoc main_~tmp~3; 1944#L641 havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 2061#L649 main_#t~ret45 := valid_product_#res;main_~tmp~3 := main_#t~ret45;havoc main_#t~ret45; 2062#L605 assume 0 != main_~tmp~3; 2041#L578 havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2042#L671-1 [2019-01-14 04:24:47,738 INFO L796 eck$LassoCheckResult]: Loop: 2042#L671-1 assume !false; 2305#L711 assume test_~splverifierCounter~0 < 4; 2306#L712 test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 2341#L720 assume !(0 != test_~tmp~5); 2339#L720-1 test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 2337#L730 assume !(0 != test_~tmp___0~1); 2336#L730-1 test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 2332#L740 assume 0 != test_~tmp___2~0; 2028#L746-1 assume !(0 != ~pumpRunning~0); 2029#L776 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret55, processEnvironment_~tmp~7;havoc processEnvironment_~tmp~7; 2043#L834 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret54, processEnvironment__wrappee__highWaterSensor_~tmp~6;havoc processEnvironment__wrappee__highWaterSensor_~tmp~6; 1957#L808-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret74, isHighWaterLevel_~retValue_acc~12, isHighWaterLevel_~tmp~9, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~12;havoc isHighWaterLevel_~tmp~9;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~5;havoc isHighWaterSensorDry_~retValue_acc~5; 1958#L497-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~5 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~5; 1974#L502-1 isHighWaterLevel_#t~ret74 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~9 := isHighWaterLevel_#t~ret74;havoc isHighWaterLevel_#t~ret74; 1929#L954-3 assume 0 != isHighWaterLevel_~tmp~9;isHighWaterLevel_~tmp___0~2 := 0; 1930#L954-5 isHighWaterLevel_~retValue_acc~12 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~12; 1937#L960-1 processEnvironment__wrappee__highWaterSensor_#t~ret54 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~6 := processEnvironment__wrappee__highWaterSensor_#t~ret54;havoc processEnvironment__wrappee__highWaterSensor_#t~ret54; 2047#L812-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~6); 2004#L783 havoc __utac_acc__Specification3_spec__1_#t~ret47, __utac_acc__Specification3_spec__1_#t~ret48, __utac_acc__Specification3_spec__1_#t~ret49, __utac_acc__Specification3_spec__1_~tmp~4, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~4;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; 2312#L457-2 __utac_acc__Specification3_spec__1_#t~ret47 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~4 := __utac_acc__Specification3_spec__1_#t~ret47;havoc __utac_acc__Specification3_spec__1_#t~ret47; 2311#L665 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~4);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; 2310#L489 __utac_acc__Specification3_spec__1_#t~ret48 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret48;havoc __utac_acc__Specification3_spec__1_#t~ret48; 2308#L671 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 2042#L671-1 [2019-01-14 04:24:47,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:47,738 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-01-14 04:24:47,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:47,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:47,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash 139994341, now seen corresponding path program 1 times [2019-01-14 04:24:47,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:47,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:47,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:24:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:24:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash 337747583, now seen corresponding path program 1 times [2019-01-14 04:24:47,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:24:47,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:24:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:47,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:24:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:24:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:24:49,530 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 04:24:50,160 WARN L181 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 04:25:17,390 WARN L181 SmtUtils]: Spent 27.22 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:25:30,890 WARN L181 SmtUtils]: Spent 13.50 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:25:30,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:25:30 BoogieIcfgContainer [2019-01-14 04:25:30,980 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:25:30,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:25:30,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:25:30,983 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:25:30,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:24:41" (3/4) ... [2019-01-14 04:25:30,989 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:25:31,097 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:25:31,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:25:31,099 INFO L168 Benchmark]: Toolchain (without parser) took 51596.27 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.1 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -198.7 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:31,102 INFO L168 Benchmark]: CDTParser took 0.20 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:25:31,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:31,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:25:31,109 INFO L168 Benchmark]: Boogie Preprocessor took 96.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:31,111 INFO L168 Benchmark]: RCFGBuilder took 1461.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: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:31,112 INFO L168 Benchmark]: BuchiAutomizer took 48985.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.3 MB). Peak memory consumption was 372.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:25:31,112 INFO L168 Benchmark]: Witness Printer took 117.50 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-14 04:25:31,120 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.20 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 816.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1461.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: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 48985.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.3 MB). Peak memory consumption was 372.7 MB. Max. memory is 11.5 GB. * Witness Printer took 117.50 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 6 locations. The remainder module has 444 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 47.1s. Construction of modules took 1.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 456 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 444 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 663 SDtfs, 1690 SDslu, 1827 SDs, 0 SdLazy, 179 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc2 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: 710]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@757cb3ea=0, NULL=0, NULL=0, NULL=0, NULL=-23, NULL=0, NULL=0, NULL=-3, retValue_acc=0, NULL=-15, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@aa35abc=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c920e23=69, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3324ee1d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d52763c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6664677a=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18964f56=0, NULL=0, NULL=0, tmp=0, NULL=0, tmp___1=0, NULL=-13, NULL=-9, tmp___0=1, NULL=-7, NULL=-24, NULL=-12, cleanupTimeShifts=4, NULL=-17, NULL=-2, tmp=0, tmp=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-18, \result=1, NULL=0, NULL=0, NULL=0, retValue_acc=0, \result=0, NULL=-8, \result=1, NULL=-11, head=0, pumpRunning=0, \result=0, retValue_acc=1, NULL=-1, tmp=1, NULL=0, NULL=0, NULL=0, \result=1, NULL=-20, retValue_acc=1, NULL=-19, NULL=-4, NULL=0, retValue_acc=0, NULL=0, tmp___2=69, retValue_acc=1, NULL=-5, tmp___0=0, splverifierCounter=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5025b538=0, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73462371=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3af4a7b=0, \result=0, NULL=-22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@522b9d26=0, NULL=-14, tmp___1=0, head=0, NULL=0, NULL=-6, NULL=-10, NULL=0, NULL=-25, tmp=0, NULL=0, NULL=0, NULL=-16, NULL=-21} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L414] int waterLevel = 1; [L415] int methaneLevelCritical = 0; [L517] int cleanupTimeShifts = 4; [L769] int pumpRunning = 0; [L770] int systemActive = 1; [L596] int retValue_acc ; [L597] int tmp ; [L645] int retValue_acc ; [L648] retValue_acc = 1 [L649] return (retValue_acc); [L603] tmp = valid_product() [L605] COND TRUE \read(tmp) [L701] int splverifierCounter ; [L702] int tmp ; [L703] int tmp___0 ; [L704] int tmp___1 ; [L705] int tmp___2 ; [L708] splverifierCounter = 0 Loop: [L710] COND TRUE 1 [L712] COND TRUE splverifierCounter < 4 [L718] tmp = __VERIFIER_nondet_int() [L720] COND FALSE !(\read(tmp)) [L728] tmp___0 = __VERIFIER_nondet_int() [L730] COND FALSE !(\read(tmp___0)) [L738] tmp___2 = __VERIFIER_nondet_int() [L740] COND TRUE \read(tmp___2) [L776] COND FALSE !(\read(pumpRunning)) [L783] COND TRUE \read(systemActive) [L831] int tmp ; [L834] COND FALSE !(\read(pumpRunning)) [L805] int tmp ; [L808] COND TRUE ! pumpRunning [L946] int retValue_acc ; [L947] int tmp ; [L948] int tmp___0 ; [L494] int retValue_acc ; [L497] COND TRUE waterLevel < 2 [L498] retValue_acc = 1 [L499] return (retValue_acc); [L952] tmp = isHighWaterSensorDry() [L954] COND TRUE \read(tmp) [L955] tmp___0 = 0 [L959] retValue_acc = tmp___0 [L960] return (retValue_acc); [L810] tmp = isHighWaterLevel() [L812] COND FALSE !(\read(tmp)) [L657] int tmp ; [L658] int tmp___0 ; [L659] int tmp___1 ; [L453] int retValue_acc ; [L456] retValue_acc = methaneLevelCritical [L457] return (retValue_acc); [L663] tmp = isMethaneLevelCritical() [L665] COND FALSE !(\read(tmp)) [L485] int retValue_acc ; [L488] retValue_acc = waterLevel [L489] return (retValue_acc); [L669] tmp___0 = getWaterLevel() [L671] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...