./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product54_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_product54_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 3f1bc34860a9b5a05b4a0969639c999f2a7389fb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:52:35,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:52:35,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:52:35,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:52:35,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:52:35,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:52:35,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:52:35,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:52:35,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:52:35,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:52:35,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:52:35,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:52:35,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:52:35,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:52:35,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:52:35,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:52:35,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:52:35,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:52:35,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:52:35,225 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:52:35,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:52:35,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:52:35,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:52:35,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:52:35,229 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:52:35,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:52:35,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:52:35,235 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:52:35,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:52:35,240 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:52:35,240 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:52:35,241 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:52:35,241 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:52:35,241 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:52:35,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:52:35,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:52:35,247 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:52:35,280 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:52:35,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:52:35,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:52:35,282 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:52:35,283 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:52:35,283 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:52:35,283 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:52:35,283 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:52:35,283 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:52:35,283 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:52:35,284 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:52:35,284 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:52:35,284 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:52:35,284 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:52:35,284 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:52:35,284 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:52:35,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:52:35,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:52:35,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:52:35,287 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:52:35,287 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:52:35,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:52:35,287 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:52:35,287 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:52:35,288 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:52:35,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:52:35,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:52:35,289 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:52:35,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:52:35,289 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:52:35,289 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:52:35,291 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:52:35,291 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 -> 3f1bc34860a9b5a05b4a0969639c999f2a7389fb [2019-01-01 23:52:35,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:52:35,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:52:35,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:52:35,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:52:35,345 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:52:35,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product54_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:35,412 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79257514a/ff8ac8b533ee486e8dcca5c03d9580ec/FLAG91fe51d08 [2019-01-01 23:52:35,937 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:52:35,938 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product54_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:35,952 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79257514a/ff8ac8b533ee486e8dcca5c03d9580ec/FLAG91fe51d08 [2019-01-01 23:52:36,257 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79257514a/ff8ac8b533ee486e8dcca5c03d9580ec [2019-01-01 23:52:36,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:52:36,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:52:36,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:52:36,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:52:36,273 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:52:36,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:52:36" (1/1) ... [2019-01-01 23:52:36,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36, skipping insertion in model container [2019-01-01 23:52:36,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:52:36" (1/1) ... [2019-01-01 23:52:36,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:52:36,356 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:52:36,804 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:52:36,820 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:52:36,946 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:52:36,992 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:52:36,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36 WrapperNode [2019-01-01 23:52:36,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:52:36,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:52:36,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:52:36,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:52:37,079 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:52:36" (1/1) ... [2019-01-01 23:52:37,111 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:52:36" (1/1) ... [2019-01-01 23:52:37,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:52:37,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:52:37,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:52:37,179 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:52:37,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36" (1/1) ... [2019-01-01 23:52:37,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36" (1/1) ... [2019-01-01 23:52:37,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36" (1/1) ... [2019-01-01 23:52:37,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36" (1/1) ... [2019-01-01 23:52:37,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36" (1/1) ... [2019-01-01 23:52:37,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36" (1/1) ... [2019-01-01 23:52:37,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36" (1/1) ... [2019-01-01 23:52:37,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:52:37,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:52:37,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:52:37,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:52:37,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52: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-01 23:52:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:52:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:52:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:52:37,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:52:39,378 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:52:39,379 INFO L280 CfgBuilder]: Removed 292 assue(true) statements. [2019-01-01 23:52:39,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:39 BoogieIcfgContainer [2019-01-01 23:52:39,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:52:39,380 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:52:39,380 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:52:39,385 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:52:39,387 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:39,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:52:36" (1/3) ... [2019-01-01 23:52:39,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7984355b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:52:39, skipping insertion in model container [2019-01-01 23:52:39,389 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:39,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:36" (2/3) ... [2019-01-01 23:52:39,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7984355b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:52:39, skipping insertion in model container [2019-01-01 23:52:39,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:39,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:39" (3/3) ... [2019-01-01 23:52:39,393 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product54_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:39,457 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:52:39,458 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:52:39,458 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:52:39,458 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:52:39,459 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:52:39,459 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:52:39,459 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:52:39,460 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:52:39,460 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:52:39,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states. [2019-01-01 23:52:39,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 127 [2019-01-01 23:52:39,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:39,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:39,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:39,537 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:52:39,537 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:52:39,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states. [2019-01-01 23:52:39,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 127 [2019-01-01 23:52:39,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:39,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:39,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:39,551 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:52:39,558 INFO L794 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25); 6#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~4, main_~tmp~1;havoc main_~retValue_acc~4;havoc main_~tmp~1; 135#L640true havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 26#L648true main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 173#L300true assume 0 != main_~tmp~1; 174#L272true ~switchedOnBeforeTS~0 := 0; 96#L49true havoc test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 17#L70-1true [2019-01-01 23:52:39,558 INFO L796 eck$LassoCheckResult]: Loop: 17#L70-1true assume !false; 160#L562true assume test_~splverifierCounter~0 < 4; 116#L563true test_~tmp~7 := test_#t~nondet36;havoc test_#t~nondet36; 31#L571true assume !(0 != test_~tmp~7); 34#L571-1true test_~tmp___0~3 := test_#t~nondet37;havoc test_#t~nondet37; 169#L581true assume !(0 != test_~tmp___0~3); 165#L581-1true test_~tmp___2~0 := test_#t~nondet38;havoc test_#t~nondet38; 197#L591true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 5#L599-2true havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~6;havoc isPumpRunning_~retValue_acc~6;isPumpRunning_~retValue_acc~6 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~6; 123#L464true __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 19#L59true assume !(0 != ~pumpRunning~0); 180#L327true assume !(0 != ~systemActive~0); 41#L334true havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __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; 67#L174true __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 21#L70true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 17#L70-1true [2019-01-01 23:52:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:52:39,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:39,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:39,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:39,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:40,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1016486541, now seen corresponding path program 1 times [2019-01-01 23:52:40,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:40,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:40,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:40,613 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:52:40,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:40,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:52:40,619 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:40,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:52:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:52:40,636 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 3 states. [2019-01-01 23:52:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:40,743 INFO L93 Difference]: Finished difference Result 195 states and 287 transitions. [2019-01-01 23:52:40,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:52:40,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 287 transitions. [2019-01-01 23:52:40,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 125 [2019-01-01 23:52:40,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 188 states and 279 transitions. [2019-01-01 23:52:40,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2019-01-01 23:52:40,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2019-01-01 23:52:40,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 279 transitions. [2019-01-01 23:52:40,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:40,782 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 279 transitions. [2019-01-01 23:52:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 279 transitions. [2019-01-01 23:52:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-01-01 23:52:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-01 23:52:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 279 transitions. [2019-01-01 23:52:40,848 INFO L728 BuchiCegarLoop]: Abstraction has 188 states and 279 transitions. [2019-01-01 23:52:40,848 INFO L608 BuchiCegarLoop]: Abstraction has 188 states and 279 transitions. [2019-01-01 23:52:40,848 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:52:40,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 279 transitions. [2019-01-01 23:52:40,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 125 [2019-01-01 23:52:40,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:40,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:40,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:40,858 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:52:40,859 INFO L794 eck$LassoCheckResult]: Stem: 574#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25); 427#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~4, main_~tmp~1;havoc main_~retValue_acc~4;havoc main_~tmp~1; 428#L640 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 497#L648 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 510#L300 assume 0 != main_~tmp~1; 576#L272 ~switchedOnBeforeTS~0 := 0; 577#L49 havoc test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 475#L70-1 [2019-01-01 23:52:40,859 INFO L796 eck$LassoCheckResult]: Loop: 475#L70-1 assume !false; 476#L562 assume test_~splverifierCounter~0 < 4; 435#L563 test_~tmp~7 := test_#t~nondet36;havoc test_#t~nondet36; 436#L571 assume !(0 != test_~tmp~7); 508#L571-1 test_~tmp___0~3 := test_#t~nondet37;havoc test_#t~nondet37; 528#L581 assume !(0 != test_~tmp___0~3); 562#L581-1 test_~tmp___2~0 := test_#t~nondet38;havoc test_#t~nondet38; 563#L591 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 414#L599-2 havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~6;havoc isPumpRunning_~retValue_acc~6;isPumpRunning_~retValue_acc~6 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~6; 424#L464 __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 455#L59 assume !(0 != ~pumpRunning~0); 486#L327 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret16, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 545#L411 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret15, processEnvironment__wrappee__lowWaterSensor_~tmp~3;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~3; 546#L385-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 467#L359-3 assume !(0 == ~pumpRunning~0); 468#L334 havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __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; 533#L174 __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 488#L70 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 475#L70-1 [2019-01-01 23:52:40,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:40,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:52:40,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:40,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:40,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:40,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:40,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash 239725566, now seen corresponding path program 1 times [2019-01-01 23:52:41,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:41,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:41,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:41,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:41,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:41,348 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:52:41,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:41,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:52:41,352 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:41,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:52:41,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:52:41,353 INFO L87 Difference]: Start difference. First operand 188 states and 279 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-01-01 23:52:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:41,845 INFO L93 Difference]: Finished difference Result 201 states and 278 transitions. [2019-01-01 23:52:41,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:52:41,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 278 transitions. [2019-01-01 23:52:41,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 138 [2019-01-01 23:52:41,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 201 states and 278 transitions. [2019-01-01 23:52:41,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2019-01-01 23:52:41,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-01-01 23:52:41,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 278 transitions. [2019-01-01 23:52:41,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:41,867 INFO L705 BuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2019-01-01 23:52:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 278 transitions. [2019-01-01 23:52:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-01 23:52:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-01 23:52:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2019-01-01 23:52:41,892 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2019-01-01 23:52:41,892 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2019-01-01 23:52:41,892 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:52:41,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2019-01-01 23:52:41,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 138 [2019-01-01 23:52:41,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:41,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:41,904 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:41,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:41,907 INFO L794 eck$LassoCheckResult]: Stem: 941#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25); 819#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~4, main_~tmp~1;havoc main_~retValue_acc~4;havoc main_~tmp~1; 820#L640 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 865#L648 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 876#L300 assume 0 != main_~tmp~1; 943#L272 ~switchedOnBeforeTS~0 := 0; 944#L49 havoc test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 850#L70-1 [2019-01-01 23:52:41,907 INFO L796 eck$LassoCheckResult]: Loop: 850#L70-1 assume !false; 851#L562 assume test_~splverifierCounter~0 < 4; 823#L563 test_~tmp~7 := test_#t~nondet36;havoc test_#t~nondet36; 824#L571 assume !(0 != test_~tmp~7); 873#L571-1 test_~tmp___0~3 := test_#t~nondet37;havoc test_#t~nondet37; 889#L581 assume !(0 != test_~tmp___0~3); 931#L581-1 test_~tmp___2~0 := test_#t~nondet38;havoc test_#t~nondet38; 932#L591 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 807#L599-2 havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~6;havoc isPumpRunning_~retValue_acc~6;isPumpRunning_~retValue_acc~6 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~6; 816#L464 __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 840#L59 assume !(0 != ~pumpRunning~0); 855#L327 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret16, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 911#L411 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret15, processEnvironment__wrappee__lowWaterSensor_~tmp~3;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~3; 912#L385-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 847#L359-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret34, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 848#L182-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 922#L187-3 isHighWaterLevel_#t~ret34 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret34;havoc isHighWaterLevel_#t~ret34; 856#L513-9 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 857#L513-11 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 794#L519-3 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 795#L363-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 896#L334 havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __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; 897#L174 __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 860#L70 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 850#L70-1 [2019-01-01 23:52:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:52:41,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:41,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:41,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:41,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:41,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:42,280 INFO L82 PathProgramCache]: Analyzing trace with hash 444481642, now seen corresponding path program 1 times [2019-01-01 23:52:42,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:42,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:42,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:42,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:42,502 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2019-01-01 23:52:42,673 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:52:42,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:42,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:52:42,674 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:42,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:52:42,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:52:42,674 INFO L87 Difference]: Start difference. First operand 201 states and 278 transitions. cyclomatic complexity: 79 Second operand 5 states. [2019-01-01 23:52:43,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:43,744 INFO L93 Difference]: Finished difference Result 916 states and 1281 transitions. [2019-01-01 23:52:43,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:52:43,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 916 states and 1281 transitions. [2019-01-01 23:52:43,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 625 [2019-01-01 23:52:43,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 916 states to 916 states and 1281 transitions. [2019-01-01 23:52:43,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 916 [2019-01-01 23:52:43,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 916 [2019-01-01 23:52:43,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 916 states and 1281 transitions. [2019-01-01 23:52:43,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:43,775 INFO L705 BuchiCegarLoop]: Abstraction has 916 states and 1281 transitions. [2019-01-01 23:52:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states and 1281 transitions. [2019-01-01 23:52:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 392. [2019-01-01 23:52:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-01-01 23:52:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 537 transitions. [2019-01-01 23:52:43,801 INFO L728 BuchiCegarLoop]: Abstraction has 392 states and 537 transitions. [2019-01-01 23:52:43,801 INFO L608 BuchiCegarLoop]: Abstraction has 392 states and 537 transitions. [2019-01-01 23:52:43,802 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:52:43,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 392 states and 537 transitions. [2019-01-01 23:52:43,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 274 [2019-01-01 23:52:43,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:43,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:43,808 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:43,808 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:43,808 INFO L794 eck$LassoCheckResult]: Stem: 2093#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25); 1955#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~4, main_~tmp~1;havoc main_~retValue_acc~4;havoc main_~tmp~1; 1956#L640 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 2002#L648 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 2013#L300 assume 0 != main_~tmp~1; 2096#L272 ~switchedOnBeforeTS~0 := 0; 2097#L49 havoc test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1986#L70-1 [2019-01-01 23:52:43,808 INFO L796 eck$LassoCheckResult]: Loop: 1986#L70-1 assume !false; 1987#L562 assume test_~splverifierCounter~0 < 4; 2070#L563 test_~tmp~7 := test_#t~nondet36;havoc test_#t~nondet36; 2297#L571 assume !(0 != test_~tmp~7); 2294#L571-1 test_~tmp___0~3 := test_#t~nondet37;havoc test_#t~nondet37; 2293#L581 assume !(0 != test_~tmp___0~3); 2288#L581-1 test_~tmp___2~0 := test_#t~nondet38;havoc test_#t~nondet38; 2287#L591 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2285#L599-2 havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~6;havoc isPumpRunning_~retValue_acc~6;isPumpRunning_~retValue_acc~6 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~6; 2284#L464 __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 1991#L59 assume !(0 != ~pumpRunning~0); 1992#L327 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret16, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 2052#L411 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret15, processEnvironment__wrappee__lowWaterSensor_~tmp~3;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~3; 2053#L385-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 1983#L359-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret34, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 1984#L182-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 2064#L187-3 isHighWaterLevel_#t~ret34 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret34;havoc isHighWaterLevel_#t~ret34; 1993#L513-9 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 1994#L513-11 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 1930#L519-3 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 1931#L363-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 2035#L334 havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __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; 2036#L174 __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 2129#L70 assume 2 != __utac_acc__Specification5_spec__3_~tmp~0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~6;havoc isPumpRunning_~retValue_acc~6;isPumpRunning_~retValue_acc~6 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~6; 2130#L464-1 __utac_acc__Specification5_spec__3_#t~ret2 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret2;havoc __utac_acc__Specification5_spec__3_#t~ret2; 2100#L74 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 1986#L70-1 [2019-01-01 23:52:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-01 23:52:43,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:43,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:43,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:43,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:44,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:44,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1945086949, now seen corresponding path program 1 times [2019-01-01 23:52:44,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:44,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:44,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:44,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:44,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:44,114 INFO L82 PathProgramCache]: Analyzing trace with hash -21124693, now seen corresponding path program 1 times [2019-01-01 23:52:44,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:44,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:44,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:44,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:44,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:45,739 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-01-01 23:52:45,950 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 23:53:15,772 WARN L181 SmtUtils]: Spent 29.80 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:53:30,531 WARN L181 SmtUtils]: Spent 14.75 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:53:30,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:53:30 BoogieIcfgContainer [2019-01-01 23:53:30,635 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:53:30,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:53:30,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:53:30,636 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:53:30,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:39" (3/4) ... [2019-01-01 23:53:30,641 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:53:30,748 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:53:30,748 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:53:30,749 INFO L168 Benchmark]: Toolchain (without parser) took 54484.49 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.3 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -288.7 MB). Peak memory consumption was 74.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:30,754 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:53:30,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.44 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 923.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:30,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 923.2 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:30,757 INFO L168 Benchmark]: Boogie Preprocessor took 84.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:30,757 INFO L168 Benchmark]: RCFGBuilder took 2116.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:30,758 INFO L168 Benchmark]: BuchiAutomizer took 51254.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 400.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:30,766 INFO L168 Benchmark]: Witness Printer took 112.87 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:30,773 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 725.44 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 923.2 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 184.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 923.2 MB in the beginning and 1.1 GB in the end (delta: -207.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2116.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 51254.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 400.1 MB. Max. memory is 11.5 GB. * Witness Printer took 112.87 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 392 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 49.0s. Construction of modules took 1.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 524 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 392 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 920 SDtfs, 1445 SDslu, 1171 SDs, 0 SdLazy, 232 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 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: 561]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=7186} State at position 1 is {NULL=0, NULL=0, NULL=-3, NULL=0, NULL=7186, NULL=3195, NULL=0, NULL=-20, methaneLevelCritical=0, retValue_acc=1, NULL=0, NULL=-1, tmp=0, NULL=-10, retValue_acc=0, tmp___1=0, NULL=-9, NULL=-13, NULL=0, cleanupTimeShifts=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d182f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23b4c1df=68, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61729434=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19af351e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c3c2653=0, NULL=0, NULL=0, waterLevel=1, NULL=0, NULL=-8, \result=1, retValue_acc=1, head=0, pumpRunning=0, tmp=1, retValue_acc=1, NULL=0, NULL=0, \result=1, NULL=-18, NULL=0, NULL=0, NULL=0, tmp___0=0, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52d6bf54=0, NULL=-7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@519eff9f=0, NULL=-16, head=0, tmp=0, NULL=7185, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6bc646d0=0, NULL=-17, NULL=0, retValue_acc=0, NULL=0, NULL=-19, NULL=-21, NULL=-6, tmp___0=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16c44d01=0, tmp=0, tmp=1, NULL=0, NULL=0, switchedOnBeforeTS=0, NULL=-14, NULL=-15, tmp=0, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, NULL=-4, \result=1, NULL=2, \result=0, NULL=0, NULL=-11, tmp___0=0, \result=0, NULL=-12, NULL=0, tmp___2=68, splverifierCounter=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21807095=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b20d275=0, NULL=-2, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@638ab977=0, NULL=-5, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L43] int switchedOnBeforeTS ; [L99] int waterLevel = 1; [L100] int methaneLevelCritical = 0; [L211] int cleanupTimeShifts = 4; [L317] int pumpRunning = 0; [L318] int systemActive = 1; [L822] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L291] int retValue_acc ; [L292] int tmp ; [L644] int retValue_acc ; [L647] retValue_acc = 1 [L648] return (retValue_acc); [L298] tmp = valid_product() [L300] COND TRUE \read(tmp) [L48] switchedOnBeforeTS = 0 [L552] int splverifierCounter ; [L553] int tmp ; [L554] int tmp___0 ; [L555] int tmp___1 ; [L556] int tmp___2 ; [L559] splverifierCounter = 0 Loop: [L561] COND TRUE 1 [L563] COND TRUE splverifierCounter < 4 [L569] tmp = __VERIFIER_nondet_int() [L571] COND FALSE !(\read(tmp)) [L579] tmp___0 = __VERIFIER_nondet_int() [L581] COND FALSE !(\read(tmp___0)) [L589] tmp___2 = __VERIFIER_nondet_int() [L591] COND TRUE \read(tmp___2) [L546] systemActive = 1 [L460] int retValue_acc ; [L463] retValue_acc = pumpRunning [L464] return (retValue_acc); [L57] switchedOnBeforeTS = isPumpRunning() [L327] COND FALSE !(\read(pumpRunning)) [L334] COND TRUE \read(systemActive) [L408] int tmp ; [L411] COND FALSE !(\read(pumpRunning)) [L382] int tmp ; [L385] COND FALSE !(\read(pumpRunning)) [L356] int tmp ; [L359] COND TRUE ! pumpRunning [L505] int retValue_acc ; [L506] int tmp ; [L507] int tmp___0 ; [L179] int retValue_acc ; [L182] COND TRUE waterLevel < 2 [L183] retValue_acc = 1 [L184] return (retValue_acc); [L511] tmp = isHighWaterSensorDry() [L513] COND TRUE \read(tmp) [L514] tmp___0 = 0 [L518] retValue_acc = tmp___0 [L519] return (retValue_acc); [L361] tmp = isHighWaterLevel() [L363] COND FALSE !(\read(tmp)) [L63] int tmp ; [L64] int tmp___0 ; [L170] int retValue_acc ; [L173] retValue_acc = waterLevel [L174] return (retValue_acc); [L68] tmp = getWaterLevel() [L70] COND TRUE tmp != 2 [L460] int retValue_acc ; [L463] retValue_acc = pumpRunning [L464] return (retValue_acc); [L72] tmp___0 = isPumpRunning() [L74] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...