./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product28_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product28_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2592b880c905533820d8c0b600fce539abba3733 ................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:50:49,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:50:49,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:50:49,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:50:49,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:50:49,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:50:49,197 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:50:49,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:50:49,200 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:50:49,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:50:49,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:50:49,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:50:49,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:50:49,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:50:49,206 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:50:49,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:50:49,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:50:49,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:50:49,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:50:49,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:50:49,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:50:49,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:50:49,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:50:49,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:50:49,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:50:49,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:50:49,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:50:49,224 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:50:49,225 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:50:49,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:50:49,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:50:49,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:50:49,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:50:49,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:50:49,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:50:49,230 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:50:49,231 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:50:49,254 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:50:49,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:50:49,256 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:50:49,256 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:50:49,256 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:50:49,256 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:50:49,257 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:50:49,257 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:50:49,257 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:50:49,257 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:50:49,257 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:50:49,258 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:50:49,258 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:50:49,258 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:50:49,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:50:49,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:50:49,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:50:49,259 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:50:49,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:50:49,259 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:50:49,259 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:50:49,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:50:49,259 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:50:49,260 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:50:49,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:50:49,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:50:49,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:50:49,260 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:50:49,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:50:49,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:50:49,261 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:50:49,262 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:50:49,262 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 -> 2592b880c905533820d8c0b600fce539abba3733 [2019-01-01 23:50:49,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:50:49,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:50:49,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:50:49,322 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:50:49,323 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:50:49,324 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product28_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:49,392 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d00579348/2aba0fbd0b784c92b2bf0fb77a9680d5/FLAGc41769672 [2019-01-01 23:50:50,008 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:50:50,009 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product28_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:50,023 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d00579348/2aba0fbd0b784c92b2bf0fb77a9680d5/FLAGc41769672 [2019-01-01 23:50:50,199 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d00579348/2aba0fbd0b784c92b2bf0fb77a9680d5 [2019-01-01 23:50:50,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:50:50,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:50:50,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:50,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:50:50,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:50:50,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:50,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d0e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50, skipping insertion in model container [2019-01-01 23:50:50,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:50,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:50:50,292 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:50:50,700 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:50,716 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:50:50,839 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:50,971 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:50:50,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50 WrapperNode [2019-01-01 23:50:50,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:50,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:50,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:50:50,973 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:50:50,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:51,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:51,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:51,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:50:51,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:50:51,051 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:50:51,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:51,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:51,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:51,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:51,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:51,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:51,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... [2019-01-01 23:50:51,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:50:51,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:50:51,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:50:51,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:50:51,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:50:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:50:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:50:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:50:51,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:50:52,331 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:50:52,331 INFO L280 CfgBuilder]: Removed 116 assue(true) statements. [2019-01-01 23:50:52,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:52 BoogieIcfgContainer [2019-01-01 23:50:52,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:50:52,334 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:50:52,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:50:52,338 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:50:52,339 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:52,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:50:50" (1/3) ... [2019-01-01 23:50:52,341 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f35bcd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:52, skipping insertion in model container [2019-01-01 23:50:52,341 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:52,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:50" (2/3) ... [2019-01-01 23:50:52,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f35bcd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:52, skipping insertion in model container [2019-01-01 23:50:52,342 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:52,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:52" (3/3) ... [2019-01-01 23:50:52,345 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product28_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:52,412 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:50:52,413 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:50:52,413 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:50:52,413 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:50:52,413 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:50:52,413 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:50:52,414 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:50:52,414 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:50:52,414 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:50:52,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2019-01-01 23:50:52,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:50:52,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:52,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:52,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:52,468 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:52,468 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:50:52,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2019-01-01 23:50:52,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:50:52,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:52,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:52,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:52,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:52,483 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #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(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1); 7#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 65#L678true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 72#L686true main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 61#L276true assume 0 != main_~tmp~1; 14#L248true ~switchedOnBeforeTS~0 := 0; 51#L144true havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 44#L165-1true [2019-01-01 23:50:52,484 INFO L796 eck$LassoCheckResult]: Loop: 44#L165-1true assume !false; 45#L911true assume test_~splverifierCounter~0 < 4; 68#L912true test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 73#L920true assume !(0 != test_~tmp~8); 74#L920-1true test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 54#L930true assume !(0 != test_~tmp___0~2); 57#L930-1true test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 23#L940true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 33#L948-1true havoc __utac_acc__Specification5_spec__2_#t~ret10;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~10;havoc isPumpRunning_~retValue_acc~10;isPumpRunning_~retValue_acc~10 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~10; 64#L817true __utac_acc__Specification5_spec__2_#t~ret10 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret10;havoc __utac_acc__Specification5_spec__2_#t~ret10; 17#L154true assume !(0 != ~pumpRunning~0); 60#L714true assume !(0 != ~systemActive~0); 38#L721true havoc __utac_acc__Specification5_spec__3_#t~ret11, __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 48#L122true __utac_acc__Specification5_spec__3_#t~ret11 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret11;havoc __utac_acc__Specification5_spec__3_#t~ret11; 18#L165true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 44#L165-1true [2019-01-01 23:50:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:50:52,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:52,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:52,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:52,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:52,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:53,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash 675133686, now seen corresponding path program 1 times [2019-01-01 23:50:53,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:53,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:53,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:53,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:53,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:50:53,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:53,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:50:53,460 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:50:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:50:53,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:50:53,480 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-01-01 23:50:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:53,719 INFO L93 Difference]: Finished difference Result 159 states and 221 transitions. [2019-01-01 23:50:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:50:53,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 221 transitions. [2019-01-01 23:50:53,731 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2019-01-01 23:50:53,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 145 states and 206 transitions. [2019-01-01 23:50:53,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2019-01-01 23:50:53,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2019-01-01 23:50:53,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 206 transitions. [2019-01-01 23:50:53,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:53,744 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 206 transitions. [2019-01-01 23:50:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 206 transitions. [2019-01-01 23:50:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-01-01 23:50:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-01 23:50:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2019-01-01 23:50:53,785 INFO L728 BuchiCegarLoop]: Abstraction has 143 states and 203 transitions. [2019-01-01 23:50:53,785 INFO L608 BuchiCegarLoop]: Abstraction has 143 states and 203 transitions. [2019-01-01 23:50:53,786 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:50:53,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 203 transitions. [2019-01-01 23:50:53,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 100 [2019-01-01 23:50:53,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:53,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:53,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:53,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:53,792 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #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(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1); 256#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 257#L678 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 327#L686 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 323#L276 assume 0 != main_~tmp~1; 268#L248 ~switchedOnBeforeTS~0 := 0; 269#L144 havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 320#L165-1 [2019-01-01 23:50:53,792 INFO L796 eck$LassoCheckResult]: Loop: 320#L165-1 assume !false; 370#L911 assume test_~splverifierCounter~0 < 4; 332#L912 test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 333#L920 assume !(0 != test_~tmp~8); 265#L920-1 test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 322#L930 assume !(0 != test_~tmp___0~2); 305#L930-1 test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 283#L940 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 285#L948-1 havoc __utac_acc__Specification5_spec__2_#t~ret10;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~10;havoc isPumpRunning_~retValue_acc~10;isPumpRunning_~retValue_acc~10 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~10; 297#L817 __utac_acc__Specification5_spec__2_#t~ret10 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret10;havoc __utac_acc__Specification5_spec__2_#t~ret10; 326#L154 assume !(0 != ~pumpRunning~0); 379#L714 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 378#L746 assume !(0 != ~pumpRunning~0); 376#L721 havoc __utac_acc__Specification5_spec__3_#t~ret11, __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 375#L122 __utac_acc__Specification5_spec__3_#t~ret11 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret11;havoc __utac_acc__Specification5_spec__3_#t~ret11; 373#L165 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 320#L165-1 [2019-01-01 23:50:53,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:50:53,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:53,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:53,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:53,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:53,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:54,142 INFO L82 PathProgramCache]: Analyzing trace with hash -572685309, now seen corresponding path program 1 times [2019-01-01 23:50:54,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:54,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:54,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:54,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:54,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:54,169 INFO L82 PathProgramCache]: Analyzing trace with hash -747445943, now seen corresponding path program 1 times [2019-01-01 23:50:54,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:54,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:54,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:54,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:54,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:50:54,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:54,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:50:54,857 WARN L181 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 23:50:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:50:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:50:54,933 INFO L87 Difference]: Start difference. First operand 143 states and 203 transitions. cyclomatic complexity: 63 Second operand 5 states. [2019-01-01 23:50:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:55,433 INFO L93 Difference]: Finished difference Result 398 states and 558 transitions. [2019-01-01 23:50:55,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:50:55,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 558 transitions. [2019-01-01 23:50:55,449 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 194 [2019-01-01 23:50:55,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 398 states and 558 transitions. [2019-01-01 23:50:55,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 398 [2019-01-01 23:50:55,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 398 [2019-01-01 23:50:55,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 398 states and 558 transitions. [2019-01-01 23:50:55,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:55,461 INFO L705 BuchiCegarLoop]: Abstraction has 398 states and 558 transitions. [2019-01-01 23:50:55,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states and 558 transitions. [2019-01-01 23:50:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 279. [2019-01-01 23:50:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-01-01 23:50:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 385 transitions. [2019-01-01 23:50:55,493 INFO L728 BuchiCegarLoop]: Abstraction has 279 states and 385 transitions. [2019-01-01 23:50:55,493 INFO L608 BuchiCegarLoop]: Abstraction has 279 states and 385 transitions. [2019-01-01 23:50:55,493 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:50:55,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 385 transitions. [2019-01-01 23:50:55,500 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 194 [2019-01-01 23:50:55,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:55,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:55,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:55,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:55,503 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #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(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1); 813#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 814#L678 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 888#L686 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 886#L276 assume 0 != main_~tmp~1; 825#L248 ~switchedOnBeforeTS~0 := 0; 826#L144 havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 848#L165-1 [2019-01-01 23:50:55,503 INFO L796 eck$LassoCheckResult]: Loop: 848#L165-1 assume !false; 872#L911 assume test_~splverifierCounter~0 < 4; 873#L912 test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 1042#L920 assume !(0 != test_~tmp~8); 1040#L920-1 test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 1018#L930 assume !(0 != test_~tmp___0~2); 1016#L930-1 test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 1013#L940 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 974#L948-1 havoc __utac_acc__Specification5_spec__2_#t~ret10;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~10;havoc isPumpRunning_~retValue_acc~10;isPumpRunning_~retValue_acc~10 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~10; 972#L817 __utac_acc__Specification5_spec__2_#t~ret10 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret10;havoc __utac_acc__Specification5_spec__2_#t~ret10; 970#L154 assume !(0 != ~pumpRunning~0); 885#L714 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 846#L746 assume !(0 != ~pumpRunning~0); 834#L721 havoc __utac_acc__Specification5_spec__3_#t~ret11, __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 860#L122 __utac_acc__Specification5_spec__3_#t~ret11 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret11;havoc __utac_acc__Specification5_spec__3_#t~ret11; 831#L165 assume 2 != __utac_acc__Specification5_spec__3_~tmp~0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~10;havoc isPumpRunning_~retValue_acc~10;isPumpRunning_~retValue_acc~10 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~10; 832#L817-1 __utac_acc__Specification5_spec__3_#t~ret12 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret12;havoc __utac_acc__Specification5_spec__3_#t~ret12; 847#L169 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 848#L165-1 [2019-01-01 23:50:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:50:55,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:55,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:55,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash -594781890, now seen corresponding path program 1 times [2019-01-01 23:50:55,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:55,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:55,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:55,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1036026620, now seen corresponding path program 1 times [2019-01-01 23:50:55,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:55,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:55,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:55,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:55,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:57,201 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-01 23:50:57,447 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:51:26,013 WARN L181 SmtUtils]: Spent 28.56 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:51:40,458 WARN L181 SmtUtils]: Spent 14.44 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:51:40,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:51:40 BoogieIcfgContainer [2019-01-01 23:51:40,533 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:51:40,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:51:40,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:51:40,533 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:51:40,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:52" (3/4) ... [2019-01-01 23:51:40,540 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:51:40,625 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:51:40,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:51:40,627 INFO L168 Benchmark]: Toolchain (without parser) took 50423.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 951.3 MB in the beginning and 954.3 MB in the end (delta: -2.9 MB). Peak memory consumption was 322.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:40,629 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:51:40,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:40,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:40,634 INFO L168 Benchmark]: Boogie Preprocessor took 62.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:51:40,636 INFO L168 Benchmark]: RCFGBuilder took 1218.54 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:40,638 INFO L168 Benchmark]: BuchiAutomizer took 48199.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 957.5 MB in the end (delta: 117.8 MB). Peak memory consumption was 432.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:40,639 INFO L168 Benchmark]: Witness Printer took 93.19 ms. Allocated memory is still 1.4 GB. Free memory was 957.5 MB in the beginning and 954.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:40,651 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.17 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 766.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.71 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 1218.54 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 48199.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 957.5 MB in the end (delta: 117.8 MB). Peak memory consumption was 432.0 MB. Max. memory is 11.5 GB. * Witness Printer took 93.19 ms. Allocated memory is still 1.4 GB. Free memory was 957.5 MB in the beginning and 954.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 5 locations. The remainder module has 279 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 47.1s. Construction of modules took 0.5s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 121 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 279 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 281 SDtfs, 458 SDslu, 422 SDs, 0 SdLazy, 92 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 910]: 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=-8, NULL=0, NULL=0, NULL=-16, retValue_acc=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1264c6bf=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e98c1cc=0, NULL=0, NULL=0, NULL=0, NULL=-24, NULL=-3, methaneLevelCritical=0, NULL=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22a2ec01=0, NULL=-12, NULL=0, NULL=-6, NULL=0, NULL=-5, tmp=0, tmp___1=0, tmp=1, NULL=-15, retValue_acc=0, cleanupTimeShifts=4, NULL=-10, switchedOnBeforeTS=0, NULL=-21, NULL=-7, \result=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=-19, NULL=-17, NULL=0, NULL=-22, NULL=0, NULL=0, tmp___0=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, \result=0, NULL=0, NULL=-25, tmp=1, NULL=0, NULL=0, NULL=0, NULL=-9, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@555950e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fdad970=71, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e632fba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dd52c15=0, retValue_acc=1, NULL=-11, tmp___2=71, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6562e6af=0, splverifierCounter=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74c3f5c6=0, NULL=0, NULL=0, NULL=0, NULL=-14, head=0, tmp=0, NULL=-4, NULL=0, NULL=-13, NULL=-20, NULL=-23, NULL=-18} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L138] int switchedOnBeforeTS ; [L187] int cleanupTimeShifts = 4; [L459] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L704] int pumpRunning = 0; [L705] int systemActive = 1; [L267] int retValue_acc ; [L268] int tmp ; [L682] int retValue_acc ; [L685] retValue_acc = 1 [L686] return (retValue_acc); [L274] tmp = valid_product() [L276] COND TRUE \read(tmp) [L143] switchedOnBeforeTS = 0 [L901] int splverifierCounter ; [L902] int tmp ; [L903] int tmp___0 ; [L904] int tmp___1 ; [L905] int tmp___2 ; [L908] splverifierCounter = 0 Loop: [L910] COND TRUE 1 [L912] COND TRUE splverifierCounter < 4 [L918] tmp = __VERIFIER_nondet_int() [L920] COND FALSE !(\read(tmp)) [L928] tmp___0 = __VERIFIER_nondet_int() [L930] COND FALSE !(\read(tmp___0)) [L938] tmp___2 = __VERIFIER_nondet_int() [L940] COND TRUE \read(tmp___2) [L895] systemActive = 1 [L813] int retValue_acc ; [L816] retValue_acc = pumpRunning [L817] return (retValue_acc); [L152] switchedOnBeforeTS = isPumpRunning() [L714] COND FALSE !(\read(pumpRunning)) [L721] COND TRUE \read(systemActive) [L743] int tmp ; [L746] COND FALSE !(\read(pumpRunning)) [L158] int tmp ; [L159] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); [L163] tmp = getWaterLevel() [L165] COND TRUE tmp != 2 [L813] int retValue_acc ; [L816] retValue_acc = pumpRunning [L817] return (retValue_acc); [L167] tmp___0 = isPumpRunning() [L169] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...