./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product13_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product13_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 c0d9e585f0bc6d8da3f07d21418c982bbec5d957 ......................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:29:35,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:29:35,227 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:29:35,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:29:35,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:29:35,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:29:35,247 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:29:35,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:29:35,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:29:35,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:29:35,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:29:35,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:29:35,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:29:35,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:29:35,258 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:29:35,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:29:35,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:29:35,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:29:35,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:29:35,265 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:29:35,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:29:35,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:29:35,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:29:35,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:29:35,274 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:29:35,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:29:35,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:29:35,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:29:35,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:29:35,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:29:35,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:29:35,283 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:29:35,283 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:29:35,283 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:29:35,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:29:35,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:29:35,285 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:29:35,302 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:29:35,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:29:35,304 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:29:35,304 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:29:35,305 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:29:35,305 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:29:35,305 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:29:35,305 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:29:35,305 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:29:35,306 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:29:35,306 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:29:35,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:29:35,306 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:29:35,306 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:29:35,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:29:35,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:29:35,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:29:35,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:29:35,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:29:35,309 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:29:35,309 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:29:35,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:29:35,309 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:29:35,309 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:29:35,310 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:29:35,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:29:35,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:29:35,311 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:29:35,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:29:35,312 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:29:35,312 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:29:35,314 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:29:35,314 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 -> c0d9e585f0bc6d8da3f07d21418c982bbec5d957 [2019-01-14 04:29:35,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:29:35,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:29:35,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:29:35,366 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:29:35,367 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:29:35,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product13_true-unreach-call_false-termination.cil.c [2019-01-14 04:29:35,432 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e1601db/3ba8698d08694e2fa76b1df426b92177/FLAG775f3677b [2019-01-14 04:29:35,930 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:29:35,931 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product13_true-unreach-call_false-termination.cil.c [2019-01-14 04:29:35,948 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e1601db/3ba8698d08694e2fa76b1df426b92177/FLAG775f3677b [2019-01-14 04:29:36,210 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e1601db/3ba8698d08694e2fa76b1df426b92177 [2019-01-14 04:29:36,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:29:36,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:29:36,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:29:36,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:29:36,220 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:29:36,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:29:36" (1/1) ... [2019-01-14 04:29:36,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672937de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36, skipping insertion in model container [2019-01-14 04:29:36,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:29:36" (1/1) ... [2019-01-14 04:29:36,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:29:36,295 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:29:36,638 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:29:36,675 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:29:36,801 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:29:36,843 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:29:36,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36 WrapperNode [2019-01-14 04:29:36,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:29:36,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:29:36,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:29:36,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:29:36,919 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:29:36" (1/1) ... [2019-01-14 04:29:36,939 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:29:36" (1/1) ... [2019-01-14 04:29:36,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:29:36,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:29:36,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:29:36,977 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:29:36,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36" (1/1) ... [2019-01-14 04:29:36,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36" (1/1) ... [2019-01-14 04:29:36,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36" (1/1) ... [2019-01-14 04:29:36,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36" (1/1) ... [2019-01-14 04:29:37,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36" (1/1) ... [2019-01-14 04:29:37,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36" (1/1) ... [2019-01-14 04:29:37,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36" (1/1) ... [2019-01-14 04:29:37,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:29:37,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:29:37,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:29:37,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:29:37,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36" (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:29:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:29:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:29:37,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:29:37,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:29:38,184 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:29:38,184 INFO L286 CfgBuilder]: Removed 110 assue(true) statements. [2019-01-14 04:29:38,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:29:38 BoogieIcfgContainer [2019-01-14 04:29:38,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:29:38,186 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:29:38,186 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:29:38,189 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:29:38,190 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:29:38,190 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:29:36" (1/3) ... [2019-01-14 04:29:38,191 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24646b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:29:38, skipping insertion in model container [2019-01-14 04:29:38,192 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:29:38,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:29:36" (2/3) ... [2019-01-14 04:29:38,192 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24646b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:29:38, skipping insertion in model container [2019-01-14 04:29:38,192 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:29:38,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:29:38" (3/3) ... [2019-01-14 04:29:38,194 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product13_true-unreach-call_false-termination.cil.c [2019-01-14 04:29:38,246 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:29:38,247 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:29:38,247 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:29:38,247 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:29:38,248 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:29:38,248 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:29:38,248 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:29:38,248 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:29:38,248 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:29:38,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-14 04:29:38,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-14 04:29:38,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:29:38,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:29:38,296 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:38,296 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:29:38,296 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:29:38,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-14 04:29:38,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-14 04:29:38,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:29:38,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:29:38,304 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:38,304 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:29:38,310 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~cleanupTimeShifts~0 := 4;~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); 19#L-1true havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~7, main_~tmp~4;havoc main_~retValue_acc~7;havoc main_~tmp~4; 25#L65true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 16#L73true main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 3#L676true assume 0 != main_~tmp~4; 36#L651true ~switchedOnBeforeTS~0 := 0; 33#L453true havoc test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 50#L474-1true [2019-01-14 04:29:38,311 INFO L796 eck$LassoCheckResult]: Loop: 50#L474-1true assume !false; 35#L856true assume test_~splverifierCounter~0 < 4; 41#L857true test_~tmp~7 := test_#t~nondet69;havoc test_#t~nondet69; 58#L865true assume !(0 != test_~tmp~7); 60#L865-1true test_~tmp___0~1 := test_#t~nondet70;havoc test_#t~nondet70; 44#L875true assume !(0 != test_~tmp___0~1); 45#L875-1true test_~tmp___2~0 := test_#t~nondet71;havoc test_#t~nondet71; 37#L885true assume 0 != test_~tmp___2~0; 51#L891-2true havoc __utac_acc__Specification5_spec__2_#t~ret36;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 5#L804true __utac_acc__Specification5_spec__2_#t~ret36 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret36;havoc __utac_acc__Specification5_spec__2_#t~ret36; 77#L463true assume !(0 != ~pumpRunning~0); 21#L702true assume !(0 != ~systemActive~0); 34#L709true havoc __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_#t~ret38, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~6;havoc getWaterLevel_~retValue_acc~6;getWaterLevel_~retValue_acc~6 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~6; 61#L576true __utac_acc__Specification5_spec__3_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret37;havoc __utac_acc__Specification5_spec__3_#t~ret37; 75#L474true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 50#L474-1true [2019-01-14 04:29:38,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:38,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:29:38,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:38,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:38,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:38,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:38,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:39,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash 93981420, now seen corresponding path program 1 times [2019-01-14 04:29:39,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:39,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:39,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:39,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:39,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2028006630, now seen corresponding path program 1 times [2019-01-14 04:29:39,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:39,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:39,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:39,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:29:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:29:39,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:29:39,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:29:39,639 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 04:29:39,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:29:39,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:29:39,698 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 6 states. [2019-01-14 04:29:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:29:39,900 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2019-01-14 04:29:39,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:29:39,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 100 transitions. [2019-01-14 04:29:39,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-14 04:29:39,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 93 transitions. [2019-01-14 04:29:39,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:29:39,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:29:39,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 93 transitions. [2019-01-14 04:29:39,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:29:39,919 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-01-14 04:29:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 93 transitions. [2019-01-14 04:29:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 04:29:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 04:29:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2019-01-14 04:29:39,949 INFO L729 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-01-14 04:29:39,950 INFO L609 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-01-14 04:29:39,950 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:29:39,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 93 transitions. [2019-01-14 04:29:39,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-14 04:29:39,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:29:39,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:29:39,955 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:39,955 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:39,955 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~cleanupTimeShifts~0 := 4;~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); 195#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~7, main_~tmp~4;havoc main_~retValue_acc~7;havoc main_~tmp~4; 196#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 190#L73 main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 168#L676 assume 0 != main_~tmp~4; 169#L651 ~switchedOnBeforeTS~0 := 0; 212#L453 havoc test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 213#L474-1 [2019-01-14 04:29:39,955 INFO L796 eck$LassoCheckResult]: Loop: 213#L474-1 assume !false; 214#L856 assume test_~splverifierCounter~0 < 4; 215#L857 test_~tmp~7 := test_#t~nondet69;havoc test_#t~nondet69; 225#L865 assume !(0 != test_~tmp~7); 204#L865-1 test_~tmp___0~1 := test_#t~nondet70;havoc test_#t~nondet70; 226#L875 assume !(0 != test_~tmp___0~1); 223#L875-1 test_~tmp___2~0 := test_#t~nondet71;havoc test_#t~nondet71; 217#L885 assume 0 != test_~tmp___2~0; 219#L891-2 havoc __utac_acc__Specification5_spec__2_#t~ret36;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 172#L804 __utac_acc__Specification5_spec__2_#t~ret36 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret36;havoc __utac_acc__Specification5_spec__2_#t~ret36; 173#L463 assume !(0 != ~pumpRunning~0); 197#L702 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 198#L734 assume !(0 != ~pumpRunning~0); 179#L709 havoc __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_#t~ret38, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~6;havoc getWaterLevel_~retValue_acc~6;getWaterLevel_~retValue_acc~6 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~6; 211#L576 __utac_acc__Specification5_spec__3_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret37;havoc __utac_acc__Specification5_spec__3_#t~ret37; 232#L474 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 213#L474-1 [2019-01-14 04:29:39,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:39,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:29:39,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:39,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:39,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:39,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:39,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:40,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1402071741, now seen corresponding path program 1 times [2019-01-14 04:29:40,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:40,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:40,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:40,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:29:40,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:40,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1576832375, now seen corresponding path program 1 times [2019-01-14 04:29:40,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:40,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:40,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:40,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:40,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:29:40,447 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:29:40,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:29:40,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:29:40,621 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 04:29:40,993 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 04:29:41,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:29:41,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:29:41,011 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-01-14 04:29:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:29:41,640 INFO L93 Difference]: Finished difference Result 188 states and 255 transitions. [2019-01-14 04:29:41,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:29:41,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 255 transitions. [2019-01-14 04:29:41,647 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2019-01-14 04:29:41,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 188 states and 255 transitions. [2019-01-14 04:29:41,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2019-01-14 04:29:41,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2019-01-14 04:29:41,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 255 transitions. [2019-01-14 04:29:41,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:29:41,653 INFO L706 BuchiCegarLoop]: Abstraction has 188 states and 255 transitions. [2019-01-14 04:29:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 255 transitions. [2019-01-14 04:29:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 129. [2019-01-14 04:29:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 04:29:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2019-01-14 04:29:41,665 INFO L729 BuchiCegarLoop]: Abstraction has 129 states and 172 transitions. [2019-01-14 04:29:41,666 INFO L609 BuchiCegarLoop]: Abstraction has 129 states and 172 transitions. [2019-01-14 04:29:41,666 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:29:41,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 172 transitions. [2019-01-14 04:29:41,668 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2019-01-14 04:29:41,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:29:41,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:29:41,669 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:41,669 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:29:41,669 INFO L794 eck$LassoCheckResult]: Stem: 495#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~cleanupTimeShifts~0 := 4;~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); 467#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~7, main_~tmp~4;havoc main_~retValue_acc~7;havoc main_~tmp~4; 468#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 462#L73 main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 444#L676 assume 0 != main_~tmp~4; 445#L651 ~switchedOnBeforeTS~0 := 0; 484#L453 havoc test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 485#L474-1 [2019-01-14 04:29:41,670 INFO L796 eck$LassoCheckResult]: Loop: 485#L474-1 assume !false; 486#L856 assume test_~splverifierCounter~0 < 4; 487#L857 test_~tmp~7 := test_#t~nondet69;havoc test_#t~nondet69; 567#L865 assume !(0 != test_~tmp~7); 566#L865-1 test_~tmp___0~1 := test_#t~nondet70;havoc test_#t~nondet70; 565#L875 assume !(0 != test_~tmp___0~1); 563#L875-1 test_~tmp___2~0 := test_#t~nondet71;havoc test_#t~nondet71; 562#L885 assume 0 != test_~tmp___2~0; 560#L891-2 havoc __utac_acc__Specification5_spec__2_#t~ret36;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 559#L804 __utac_acc__Specification5_spec__2_#t~ret36 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret36;havoc __utac_acc__Specification5_spec__2_#t~ret36; 558#L463 assume !(0 != ~pumpRunning~0); 556#L702 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 554#L734 assume !(0 != ~pumpRunning~0); 551#L709 havoc __utac_acc__Specification5_spec__3_#t~ret37, __utac_acc__Specification5_spec__3_#t~ret38, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~6;havoc getWaterLevel_~retValue_acc~6;getWaterLevel_~retValue_acc~6 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~6; 550#L576 __utac_acc__Specification5_spec__3_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret37;havoc __utac_acc__Specification5_spec__3_#t~ret37; 519#L474 assume 2 != __utac_acc__Specification5_spec__3_~tmp~3;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~9;havoc isPumpRunning_~retValue_acc~9;isPumpRunning_~retValue_acc~9 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~9; 446#L804-1 __utac_acc__Specification5_spec__3_#t~ret38 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret38;havoc __utac_acc__Specification5_spec__3_#t~ret38; 447#L478 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 485#L474-1 [2019-01-14 04:29:41,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:41,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:29:41,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:41,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:41,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:41,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:41,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1228773470, now seen corresponding path program 1 times [2019-01-14 04:29:41,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:41,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:41,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:41,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:29:41,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:41,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:29:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash 787528740, now seen corresponding path program 1 times [2019-01-14 04:29:41,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:29:41,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:29:41,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:41,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:29:41,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:29:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:29:43,120 WARN L181 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-14 04:30:07,254 WARN L181 SmtUtils]: Spent 24.05 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:30:19,243 WARN L181 SmtUtils]: Spent 11.98 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:30:19,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:30:19 BoogieIcfgContainer [2019-01-14 04:30:19,351 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:30:19,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:30:19,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:30:19,352 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:30:19,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:29:38" (3/4) ... [2019-01-14 04:30:19,359 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:30:19,472 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:30:19,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:30:19,473 INFO L168 Benchmark]: Toolchain (without parser) took 43258.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 951.4 MB in the beginning and 931.5 MB in the end (delta: 19.9 MB). Peak memory consumption was 337.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:19,474 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:30:19,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.39 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:19,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -213.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:19,476 INFO L168 Benchmark]: Boogie Preprocessor took 38.37 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:30:19,477 INFO L168 Benchmark]: RCFGBuilder took 1170.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:19,477 INFO L168 Benchmark]: BuchiAutomizer took 41165.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 943.5 MB in the end (delta: 136.6 MB). Peak memory consumption was 400.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:19,478 INFO L168 Benchmark]: Witness Printer took 120.43 ms. Allocated memory is still 1.3 GB. Free memory was 943.5 MB in the beginning and 931.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:30:19,482 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 627.39 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 132.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -213.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.37 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 1170.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41165.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 943.5 MB in the end (delta: 136.6 MB). Peak memory consumption was 400.8 MB. Max. memory is 11.5 GB. * Witness Printer took 120.43 ms. Allocated memory is still 1.3 GB. Free memory was 943.5 MB in the beginning and 931.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 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 129 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 40.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 59 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 129 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 238 SDtfs, 568 SDslu, 274 SDs, 0 SdLazy, 75 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s 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: 855]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=7371} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e624dd9=0, NULL=7371, NULL=-8, NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, NULL=-20, NULL=-21, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@127e1faa=0, tmp=1, NULL=0, NULL=-12, NULL=0, tmp=0, NULL=-2, tmp___1=0, NULL=-7, NULL=-19, NULL=1, NULL=-26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cf57054=0, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-16, NULL=2, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, NULL=-14, NULL=-10, NULL=0, NULL=-11, NULL=0, NULL=0, tmp___0=0, \result=1, head=0, pumpRunning=0, \result=0, NULL=-3, tmp=1, NULL=0, NULL=-22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b245412=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f74a983=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ce378bf=0, NULL=-6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e59facb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f366f7=66, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6938018c=0, NULL=-13, retValue_acc=1, retValue_acc=1, tmp___2=66, NULL=7362, tmp___0=0, splverifierCounter=0, head=0, NULL=0, tmp=0, NULL=-4, NULL=0, NULL=-5, NULL=0, NULL=-17, NULL=0, NULL=0, NULL=-9, retValue_acc=0, NULL=-18, NULL=3351, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L247] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L447] int switchedOnBeforeTS ; [L501] int waterLevel = 1; [L502] int methaneLevelCritical = 0; [L590] int cleanupTimeShifts = 4; [L692] int pumpRunning = 0; [L693] int systemActive = 1; [L667] int retValue_acc ; [L668] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L674] tmp = valid_product() [L676] COND TRUE \read(tmp) [L452] switchedOnBeforeTS = 0 [L846] int splverifierCounter ; [L847] int tmp ; [L848] int tmp___0 ; [L849] int tmp___1 ; [L850] int tmp___2 ; [L853] splverifierCounter = 0 Loop: [L855] COND TRUE 1 [L857] COND TRUE splverifierCounter < 4 [L863] tmp = __VERIFIER_nondet_int() [L865] COND FALSE !(\read(tmp)) [L873] tmp___0 = __VERIFIER_nondet_int() [L875] COND FALSE !(\read(tmp___0)) [L883] tmp___2 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp___2) [L800] int retValue_acc ; [L803] retValue_acc = pumpRunning [L804] return (retValue_acc); [L461] switchedOnBeforeTS = isPumpRunning() [L702] COND FALSE !(\read(pumpRunning)) [L709] COND TRUE \read(systemActive) [L731] int tmp ; [L734] COND FALSE !(\read(pumpRunning)) [L467] int tmp ; [L468] int tmp___0 ; [L572] int retValue_acc ; [L575] retValue_acc = waterLevel [L576] return (retValue_acc); [L472] tmp = getWaterLevel() [L474] COND TRUE tmp != 2 [L800] int retValue_acc ; [L803] retValue_acc = pumpRunning [L804] return (retValue_acc); [L476] tmp___0 = isPumpRunning() [L478] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...