./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product21_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_product21_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 6346ce5eb6334508a32a1216a3fa5c414f15aa87 ........................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:22:34,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:22:34,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:22:34,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:22:34,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:22:34,196 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:22:34,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:22:34,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:22:34,202 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:22:34,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:22:34,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:22:34,204 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:22:34,205 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:22:34,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:22:34,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:22:34,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:22:34,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:22:34,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:22:34,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:22:34,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:22:34,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:22:34,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:22:34,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:22:34,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:22:34,222 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:22:34,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:22:34,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:22:34,224 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:22:34,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:22:34,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:22:34,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:22:34,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:22:34,234 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:22:34,234 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:22:34,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:22:34,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:22:34,239 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:22:34,269 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:22:34,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:22:34,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:22:34,271 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:22:34,271 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:22:34,272 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:22:34,272 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:22:34,273 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:22:34,273 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:22:34,273 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:22:34,274 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:22:34,274 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:22:34,274 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:22:34,274 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:22:34,274 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:22:34,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:22:34,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:22:34,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:22:34,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:22:34,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:22:34,276 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:22:34,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:22:34,276 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:22:34,276 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:22:34,277 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:22:34,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:22:34,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:22:34,279 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:22:34,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:22:34,280 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:22:34,280 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:22:34,281 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:22:34,282 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 -> 6346ce5eb6334508a32a1216a3fa5c414f15aa87 [2019-01-14 04:22:34,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:22:34,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:22:34,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:22:34,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:22:34,365 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:22:34,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product21_false-unreach-call_false-termination.cil.c [2019-01-14 04:22:34,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641188020/30141c6109d24eefb5d3b950ac1016bb/FLAG6eefd3387 [2019-01-14 04:22:34,956 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:22:34,956 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product21_false-unreach-call_false-termination.cil.c [2019-01-14 04:22:34,974 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641188020/30141c6109d24eefb5d3b950ac1016bb/FLAG6eefd3387 [2019-01-14 04:22:35,256 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641188020/30141c6109d24eefb5d3b950ac1016bb [2019-01-14 04:22:35,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:22:35,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:22:35,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:22:35,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:22:35,273 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:22:35,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:22:35" (1/1) ... [2019-01-14 04:22:35,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd0d229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35, skipping insertion in model container [2019-01-14 04:22:35,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:22:35" (1/1) ... [2019-01-14 04:22:35,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:22:35,337 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:22:35,719 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:22:35,735 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:22:35,953 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:22:35,993 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:22:35,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35 WrapperNode [2019-01-14 04:22:35,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:22:35,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:22:35,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:22:35,995 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:22:36,003 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:22:35" (1/1) ... [2019-01-14 04:22:36,036 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:22:35" (1/1) ... [2019-01-14 04:22:36,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:22:36,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:22:36,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:22:36,093 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:22:36,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35" (1/1) ... [2019-01-14 04:22:36,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35" (1/1) ... [2019-01-14 04:22:36,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35" (1/1) ... [2019-01-14 04:22:36,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35" (1/1) ... [2019-01-14 04:22:36,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35" (1/1) ... [2019-01-14 04:22:36,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35" (1/1) ... [2019-01-14 04:22:36,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35" (1/1) ... [2019-01-14 04:22:36,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:22:36,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:22:36,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:22:36,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:22:36,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35" (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:22:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:22:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:22:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:22:36,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:22:37,421 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:22:37,421 INFO L286 CfgBuilder]: Removed 162 assue(true) statements. [2019-01-14 04:22:37,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:22:37 BoogieIcfgContainer [2019-01-14 04:22:37,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:22:37,424 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:22:37,425 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:22:37,428 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:22:37,430 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:22:37,430 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:22:35" (1/3) ... [2019-01-14 04:22:37,431 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c395d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:22:37, skipping insertion in model container [2019-01-14 04:22:37,431 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:22:37,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:35" (2/3) ... [2019-01-14 04:22:37,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c395d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:22:37, skipping insertion in model container [2019-01-14 04:22:37,432 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:22:37,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:22:37" (3/3) ... [2019-01-14 04:22:37,434 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product21_false-unreach-call_false-termination.cil.c [2019-01-14 04:22:37,491 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:22:37,492 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:22:37,492 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:22:37,492 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:22:37,493 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:22:37,493 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:22:37,493 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:22:37,494 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:22:37,494 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:22:37,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2019-01-14 04:22:37,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-14 04:22:37,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:37,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:37,571 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:37,572 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:37,572 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:22:37,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2019-01-14 04:22:37,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-14 04:22:37,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:37,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:37,582 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:37,582 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:37,588 INFO L794 eck$LassoCheckResult]: Stem: 57#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);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(13);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(110, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(102, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(102, #t~string43.base, 2 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 3 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string45.base, #t~string45.offset, 1);call write~init~int(80, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(117, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(109, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(112, #t~string45.base, 4 + #t~string45.offset, 1);call write~init~int(58, #t~string45.base, 5 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 6 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(110, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 2 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(102, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(102, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 3 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string51.base, #t~string51.offset, 1);call write~init~int(32, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string53.base, #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 1 + #t~string53.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(13);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(77, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(101, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(116, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(104, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string64.base, #t~string64.offset, 1);call write~init~int(82, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(73, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(84, #t~string64.base, 3 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 4 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(75, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~cleanupTimeShifts~0 := 4; 4#L-1true havoc main_#res;havoc main_#t~ret69, main_~retValue_acc~9, main_~tmp~7;havoc main_~retValue_acc~9;havoc main_~tmp~7; 73#L916true havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 103#L924true main_#t~ret69 := valid_product_#res;main_~tmp~7 := main_#t~ret69;havoc main_#t~ret69; 12#L846true assume 0 != main_~tmp~7; 54#L820true havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 70#L875-1true [2019-01-14 04:22:37,589 INFO L796 eck$LassoCheckResult]: Loop: 70#L875-1true assume !false; 35#L617true assume test_~splverifierCounter~0 < 4; 7#L618true test_~tmp~6 := test_#t~nondet55;havoc test_#t~nondet55; 9#L626true assume !(0 != test_~tmp~6); 10#L626-1true test_~tmp___0~1 := test_#t~nondet56;havoc test_#t~nondet56; 42#L636true assume !(0 != test_~tmp___0~1); 43#L636-1true test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 106#L646true assume 0 != test_~tmp___2~0; 71#L652-2true assume !(0 != ~pumpRunning~0); 102#L423true assume !(0 != ~systemActive~0); 29#L430true havoc __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~6;havoc isMethaneLevelCritical_~retValue_acc~6;isMethaneLevelCritical_~retValue_acc~6 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~6; 95#L715-1true __utac_acc__Specification3_spec__1_#t~ret70 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret70;havoc __utac_acc__Specification3_spec__1_#t~ret70; 109#L869true assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 70#L875-1true [2019-01-14 04:22:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:22:37,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:37,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:37,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:37,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:38,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:38,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1680298507, now seen corresponding path program 1 times [2019-01-14 04:22:38,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:38,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:38,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:38,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:38,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:38,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:38,454 INFO L82 PathProgramCache]: Analyzing trace with hash 33980431, now seen corresponding path program 1 times [2019-01-14 04:22:38,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:38,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:38,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:38,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:38,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:22:38,776 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:22:38,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:22:38,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:22:38,919 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:22:39,043 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:22:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:22:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:22:39,070 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 6 states. [2019-01-14 04:22:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:22:39,302 INFO L93 Difference]: Finished difference Result 108 states and 151 transitions. [2019-01-14 04:22:39,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:22:39,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 151 transitions. [2019-01-14 04:22:39,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2019-01-14 04:22:39,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 101 states and 144 transitions. [2019-01-14 04:22:39,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2019-01-14 04:22:39,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2019-01-14 04:22:39,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 144 transitions. [2019-01-14 04:22:39,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:22:39,321 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 144 transitions. [2019-01-14 04:22:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 144 transitions. [2019-01-14 04:22:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 04:22:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 04:22:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2019-01-14 04:22:39,359 INFO L729 BuchiCegarLoop]: Abstraction has 101 states and 144 transitions. [2019-01-14 04:22:39,359 INFO L609 BuchiCegarLoop]: Abstraction has 101 states and 144 transitions. [2019-01-14 04:22:39,359 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:22:39,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 144 transitions. [2019-01-14 04:22:39,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2019-01-14 04:22:39,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:39,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:39,363 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:39,363 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:22:39,363 INFO L794 eck$LassoCheckResult]: Stem: 310#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);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(13);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(110, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(102, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(102, #t~string43.base, 2 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 3 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string45.base, #t~string45.offset, 1);call write~init~int(80, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(117, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(109, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(112, #t~string45.base, 4 + #t~string45.offset, 1);call write~init~int(58, #t~string45.base, 5 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 6 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(110, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 2 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(102, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(102, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 3 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string51.base, #t~string51.offset, 1);call write~init~int(32, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string53.base, #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 1 + #t~string53.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(13);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(77, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(101, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(116, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(104, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string64.base, #t~string64.offset, 1);call write~init~int(82, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(73, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(84, #t~string64.base, 3 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 4 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(75, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~cleanupTimeShifts~0 := 4; 234#L-1 havoc main_#res;havoc main_#t~ret69, main_~retValue_acc~9, main_~tmp~7;havoc main_~retValue_acc~9;havoc main_~tmp~7; 235#L916 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 320#L924 main_#t~ret69 := valid_product_#res;main_~tmp~7 := main_#t~ret69;havoc main_#t~ret69; 250#L846 assume 0 != main_~tmp~7; 251#L820 havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 279#L875-1 [2019-01-14 04:22:39,364 INFO L796 eck$LassoCheckResult]: Loop: 279#L875-1 assume !false; 285#L617 assume test_~splverifierCounter~0 < 4; 240#L618 test_~tmp~6 := test_#t~nondet55;havoc test_#t~nondet55; 241#L626 assume !(0 != test_~tmp~6); 245#L626-1 test_~tmp___0~1 := test_#t~nondet56;havoc test_#t~nondet56; 246#L636 assume !(0 != test_~tmp___0~1); 291#L636-1 test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 294#L646 assume 0 != test_~tmp___2~0; 317#L652-2 assume !(0 != ~pumpRunning~0); 273#L423 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret36, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 331#L481 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret35, processEnvironment__wrappee__lowWaterSensor_~tmp~3;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~3; 274#L455-1 assume !(0 != ~pumpRunning~0); 271#L430 havoc __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~6;havoc isMethaneLevelCritical_~retValue_acc~6;isMethaneLevelCritical_~retValue_acc~6 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~6; 281#L715-1 __utac_acc__Specification3_spec__1_#t~ret70 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret70;havoc __utac_acc__Specification3_spec__1_#t~ret70; 334#L869 assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 279#L875-1 [2019-01-14 04:22:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:22:39,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:39,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:39,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:39,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2008522617, now seen corresponding path program 1 times [2019-01-14 04:22:39,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:39,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:39,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:22:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash 441062433, now seen corresponding path program 1 times [2019-01-14 04:22:39,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:39,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:39,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:22:39,911 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:22:39,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:22:39,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:22:40,130 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:22:40,461 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:22:40,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:22:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:22:40,475 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. cyclomatic complexity: 45 Second operand 5 states. [2019-01-14 04:22:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:22:41,507 INFO L93 Difference]: Finished difference Result 355 states and 516 transitions. [2019-01-14 04:22:41,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:22:41,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 355 states and 516 transitions. [2019-01-14 04:22:41,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 241 [2019-01-14 04:22:41,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 355 states to 355 states and 516 transitions. [2019-01-14 04:22:41,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2019-01-14 04:22:41,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2019-01-14 04:22:41,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 355 states and 516 transitions. [2019-01-14 04:22:41,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:22:41,542 INFO L706 BuchiCegarLoop]: Abstraction has 355 states and 516 transitions. [2019-01-14 04:22:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states and 516 transitions. [2019-01-14 04:22:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 196. [2019-01-14 04:22:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-14 04:22:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 278 transitions. [2019-01-14 04:22:41,566 INFO L729 BuchiCegarLoop]: Abstraction has 196 states and 278 transitions. [2019-01-14 04:22:41,567 INFO L609 BuchiCegarLoop]: Abstraction has 196 states and 278 transitions. [2019-01-14 04:22:41,567 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:22:41,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 278 transitions. [2019-01-14 04:22:41,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 134 [2019-01-14 04:22:41,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:41,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:41,570 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:41,570 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:41,570 INFO L794 eck$LassoCheckResult]: Stem: 794#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);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(13);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(110, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(102, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(102, #t~string43.base, 2 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 3 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string45.base, #t~string45.offset, 1);call write~init~int(80, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(117, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(109, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(112, #t~string45.base, 4 + #t~string45.offset, 1);call write~init~int(58, #t~string45.base, 5 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 6 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(110, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 2 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(102, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(102, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 3 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string51.base, #t~string51.offset, 1);call write~init~int(32, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string53.base, #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 1 + #t~string53.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(13);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(77, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(101, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(116, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(104, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string64.base, #t~string64.offset, 1);call write~init~int(82, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(73, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(84, #t~string64.base, 3 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 4 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(75, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~cleanupTimeShifts~0 := 4; 708#L-1 havoc main_#res;havoc main_#t~ret69, main_~retValue_acc~9, main_~tmp~7;havoc main_~retValue_acc~9;havoc main_~tmp~7; 709#L916 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 809#L924 main_#t~ret69 := valid_product_#res;main_~tmp~7 := main_#t~ret69;havoc main_#t~ret69; 724#L846 assume 0 != main_~tmp~7; 725#L820 havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 789#L875-1 [2019-01-14 04:22:41,571 INFO L796 eck$LassoCheckResult]: Loop: 789#L875-1 assume !false; 854#L617 assume test_~splverifierCounter~0 < 4; 855#L618 test_~tmp~6 := test_#t~nondet55;havoc test_#t~nondet55; 903#L626 assume !(0 != test_~tmp~6); 901#L626-1 test_~tmp___0~1 := test_#t~nondet56;havoc test_#t~nondet56; 771#L636 assume !(0 != test_~tmp___0~1); 772#L636-1 test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 773#L646 assume 0 != test_~tmp___2~0; 804#L652-2 assume !(0 != ~pumpRunning~0); 747#L423 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret36, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 823#L481 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret35, processEnvironment__wrappee__lowWaterSensor_~tmp~3;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~3; 748#L455-1 assume !(0 != ~pumpRunning~0); 745#L430 havoc __utac_acc__Specification3_spec__1_#t~ret70, __utac_acc__Specification3_spec__1_#t~ret71, __utac_acc__Specification3_spec__1_#t~ret72, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~6;havoc isMethaneLevelCritical_~retValue_acc~6;isMethaneLevelCritical_~retValue_acc~6 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~6; 830#L715-1 __utac_acc__Specification3_spec__1_#t~ret70 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret70;havoc __utac_acc__Specification3_spec__1_#t~ret70; 831#L869 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~8);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 737#L747 __utac_acc__Specification3_spec__1_#t~ret71 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret71;havoc __utac_acc__Specification3_spec__1_#t~ret71; 738#L875 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 789#L875-1 [2019-01-14 04:22:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:22:41,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:41,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:41,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:41,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:41,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:41,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1749911687, now seen corresponding path program 1 times [2019-01-14 04:22:41,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:41,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:41,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:41,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:22:41,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:41,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1340756845, now seen corresponding path program 1 times [2019-01-14 04:22:41,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:41,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:41,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:42,519 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:22:42,974 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:23:07,682 WARN L181 SmtUtils]: Spent 24.69 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:23:20,445 WARN L181 SmtUtils]: Spent 12.76 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:23:20,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:23:20 BoogieIcfgContainer [2019-01-14 04:23:20,539 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:23:20,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:23:20,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:23:20,540 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:23:20,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:22:37" (3/4) ... [2019-01-14 04:23:20,545 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:23:20,648 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:23:20,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:23:20,651 INFO L168 Benchmark]: Toolchain (without parser) took 45388.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 947.3 MB in the beginning and 878.4 MB in the end (delta: 68.9 MB). Peak memory consumption was 388.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:20,653 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:23:20,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:20,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:23:20,658 INFO L168 Benchmark]: Boogie Preprocessor took 44.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:23:20,658 INFO L168 Benchmark]: RCFGBuilder took 1285.21 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: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:20,660 INFO L168 Benchmark]: BuchiAutomizer took 43114.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 889.7 MB in the end (delta: 171.3 MB). Peak memory consumption was 395.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:20,666 INFO L168 Benchmark]: Witness Printer took 110.61 ms. Allocated memory is still 1.3 GB. Free memory was 889.7 MB in the beginning and 878.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:20,674 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.74 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 726.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.30 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. * Boogie Preprocessor took 44.99 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 1285.21 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: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 43114.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 889.7 MB in the end (delta: 171.3 MB). Peak memory consumption was 395.7 MB. Max. memory is 11.5 GB. * Witness Printer took 110.61 ms. Allocated memory is still 1.3 GB. Free memory was 889.7 MB in the beginning and 878.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 196 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 43.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 41.4s. Construction of modules took 0.7s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 159 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 196 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 346 SDtfs, 982 SDslu, 606 SDs, 0 SdLazy, 87 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont1 unkn0 SFLI0 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: 616]: 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, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=-21, methaneLevelCritical=0, retValue_acc=1, NULL=-14, NULL=0, tmp=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59f7a31a=0, tmp=0, NULL=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25b9a604=0, tmp___1=0, NULL=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e295379=0, NULL=-11, NULL=-24, NULL=-4, NULL=-2, cleanupTimeShifts=4, NULL=-17, NULL=-13, NULL=-25, tmp=0, tmp___0=1, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d5e1c7c=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, NULL=-19, NULL=-22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5812a9a4=0, NULL=0, \result=1, NULL=-8, head=0, pumpRunning=0, NULL=-18, \result=0, NULL=-12, NULL=0, NULL=-23, tmp=1, NULL=0, NULL=0, NULL=-6, retValue_acc=1, tmp___2=70, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bd04336=0, NULL=-7, tmp___0=0, splverifierCounter=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40841d15=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@533d2a3e=70, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19059566=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@542470e1=0, tmp___1=0, head=0, tmp=0, NULL=0, NULL=-9, NULL=-3, NULL=0, NULL=-10, NULL=0, NULL=0, NULL=0, NULL=-15, NULL=-20, NULL=-16} - 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; [L415] int pumpRunning = 0; [L416] int systemActive = 1; [L672] int waterLevel = 1; [L673] int methaneLevelCritical = 0; [L761] int cleanupTimeShifts = 4; [L837] int retValue_acc ; [L838] int tmp ; [L920] int retValue_acc ; [L923] retValue_acc = 1 [L924] return (retValue_acc); [L844] tmp = valid_product() [L846] COND TRUE \read(tmp) [L607] int splverifierCounter ; [L608] int tmp ; [L609] int tmp___0 ; [L610] int tmp___1 ; [L611] int tmp___2 ; [L614] splverifierCounter = 0 Loop: [L616] COND TRUE 1 [L618] COND TRUE splverifierCounter < 4 [L624] tmp = __VERIFIER_nondet_int() [L626] COND FALSE !(\read(tmp)) [L634] tmp___0 = __VERIFIER_nondet_int() [L636] COND FALSE !(\read(tmp___0)) [L644] tmp___2 = __VERIFIER_nondet_int() [L646] COND TRUE \read(tmp___2) [L423] COND FALSE !(\read(pumpRunning)) [L430] COND TRUE \read(systemActive) [L478] int tmp ; [L481] COND FALSE !(\read(pumpRunning)) [L452] int tmp ; [L455] COND FALSE !(\read(pumpRunning)) [L861] int tmp ; [L862] int tmp___0 ; [L863] int tmp___1 ; [L711] int retValue_acc ; [L714] retValue_acc = methaneLevelCritical [L715] return (retValue_acc); [L867] tmp = isMethaneLevelCritical() [L869] COND FALSE !(\read(tmp)) [L743] int retValue_acc ; [L746] retValue_acc = waterLevel [L747] return (retValue_acc); [L873] tmp___0 = getWaterLevel() [L875] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...