./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9d3373e3670d73493569b1c43b551709fc0f6c .......................................................................................................................................................................................................................................................................................................................................................................................................................... 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:27:33,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:27:33,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:27:33,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:27:33,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:27:33,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:27:33,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:27:33,175 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:27:33,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:27:33,177 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:27:33,178 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:27:33,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:27:33,179 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:27:33,180 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:27:33,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:27:33,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:27:33,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:27:33,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:27:33,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:27:33,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:27:33,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:27:33,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:27:33,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:27:33,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:27:33,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:27:33,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:27:33,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:27:33,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:27:33,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:27:33,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:27:33,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:27:33,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:27:33,200 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:27:33,200 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:27:33,201 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:27:33,202 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:27:33,202 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:27:33,233 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:27:33,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:27:33,234 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:27:33,234 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:27:33,235 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:27:33,235 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:27:33,235 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:27:33,235 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:27:33,235 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:27:33,236 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:27:33,236 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:27:33,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:27:33,236 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:27:33,236 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:27:33,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:27:33,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:27:33,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:27:33,237 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:27:33,237 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:27:33,237 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:27:33,238 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:27:33,238 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:27:33,238 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:27:33,238 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:27:33,238 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:27:33,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:27:33,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:27:33,239 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:27:33,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:27:33,239 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:27:33,240 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:27:33,240 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:27:33,241 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 -> cd9d3373e3670d73493569b1c43b551709fc0f6c [2019-01-14 04:27:33,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:27:33,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:27:33,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:27:33,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:27:33,293 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:27:33,294 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c [2019-01-14 04:27:33,362 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac57ef4b0/cecc6cd2acf6438099530de82c0f7238/FLAG3f8cf6c85 [2019-01-14 04:27:33,895 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:27:33,896 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c [2019-01-14 04:27:33,913 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac57ef4b0/cecc6cd2acf6438099530de82c0f7238/FLAG3f8cf6c85 [2019-01-14 04:27:34,156 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac57ef4b0/cecc6cd2acf6438099530de82c0f7238 [2019-01-14 04:27:34,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:27:34,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:27:34,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:27:34,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:27:34,165 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:27:34,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:27:34" (1/1) ... [2019-01-14 04:27:34,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4f1387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34, skipping insertion in model container [2019-01-14 04:27:34,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:27:34" (1/1) ... [2019-01-14 04:27:34,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:27:34,236 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:27:34,639 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:27:34,661 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:27:34,838 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:27:34,882 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:27:34,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34 WrapperNode [2019-01-14 04:27:34,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:27:34,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:27:34,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:27:34,884 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:27:34,891 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:27:34" (1/1) ... [2019-01-14 04:27:34,917 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:27:34" (1/1) ... [2019-01-14 04:27:34,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:27:34,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:27:34,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:27:34,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:27:34,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34" (1/1) ... [2019-01-14 04:27:34,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34" (1/1) ... [2019-01-14 04:27:34,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34" (1/1) ... [2019-01-14 04:27:34,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34" (1/1) ... [2019-01-14 04:27:34,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34" (1/1) ... [2019-01-14 04:27:34,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34" (1/1) ... [2019-01-14 04:27:34,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34" (1/1) ... [2019-01-14 04:27:35,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:27:35,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:27:35,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:27:35,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:27:35,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34" (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:27:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:27:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:27:35,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:27:35,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:27:36,233 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:27:36,233 INFO L286 CfgBuilder]: Removed 120 assue(true) statements. [2019-01-14 04:27:36,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:27:36 BoogieIcfgContainer [2019-01-14 04:27:36,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:27:36,236 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:27:36,236 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:27:36,241 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:27:36,242 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:27:36,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:27:34" (1/3) ... [2019-01-14 04:27:36,243 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ac62b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:27:36, skipping insertion in model container [2019-01-14 04:27:36,243 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:27:36,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:34" (2/3) ... [2019-01-14 04:27:36,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9ac62b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:27:36, skipping insertion in model container [2019-01-14 04:27:36,244 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:27:36,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:27:36" (3/3) ... [2019-01-14 04:27:36,246 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product44_false-unreach-call_false-termination.cil.c [2019-01-14 04:27:36,333 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:27:36,334 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:27:36,334 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:27:36,334 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:27:36,334 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:27:36,335 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:27:36,335 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:27:36,335 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:27:36,335 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:27:36,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-14 04:27:36,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2019-01-14 04:27:36,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:36,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:36,397 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:36,397 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:36,397 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:27:36,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-14 04:27:36,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2019-01-14 04:27:36,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:36,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:36,406 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:36,406 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:36,413 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 18#L-1true havoc main_#res;havoc main_#t~ret62, main_~retValue_acc~8, main_~tmp~8;havoc main_~retValue_acc~8;havoc main_~tmp~8; 11#L460true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 19#L468true main_#t~ret62 := valid_product_#res;main_~tmp~8 := main_#t~ret62;havoc main_#t~ret62; 67#L839true assume 0 != main_~tmp~8; 51#L816true havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 12#L51-1true [2019-01-14 04:27:36,418 INFO L796 eck$LassoCheckResult]: Loop: 12#L51-1true assume !false; 41#L490true assume test_~splverifierCounter~0 < 4; 58#L491true test_~tmp~4 := test_#t~nondet38;havoc test_#t~nondet38; 62#L499true assume !(0 != test_~tmp~4); 65#L499-1true test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 46#L509true assume !(0 != test_~tmp___0~1); 49#L509-1true test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 24#L519true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 35#L527-1true assume !(0 != ~pumpRunning~0); 83#L562true assume !(0 != ~systemActive~0); 74#L569true havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 13#L928true __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 14#L51true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 12#L51-1true [2019-01-14 04:27:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:27:36,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:36,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:36,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:36,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:37,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1671648180, now seen corresponding path program 1 times [2019-01-14 04:27:37,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:37,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:37,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:27:37,386 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:27:37,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:27:37,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:27:37,394 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:27:37,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:27:37,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:27:37,416 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-01-14 04:27:37,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:27:37,558 INFO L93 Difference]: Finished difference Result 166 states and 234 transitions. [2019-01-14 04:27:37,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:27:37,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 234 transitions. [2019-01-14 04:27:37,568 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 106 [2019-01-14 04:27:37,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 152 states and 219 transitions. [2019-01-14 04:27:37,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2019-01-14 04:27:37,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2019-01-14 04:27:37,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 219 transitions. [2019-01-14 04:27:37,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:27:37,586 INFO L706 BuchiCegarLoop]: Abstraction has 152 states and 219 transitions. [2019-01-14 04:27:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 219 transitions. [2019-01-14 04:27:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-14 04:27:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-14 04:27:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 216 transitions. [2019-01-14 04:27:37,630 INFO L729 BuchiCegarLoop]: Abstraction has 150 states and 216 transitions. [2019-01-14 04:27:37,631 INFO L609 BuchiCegarLoop]: Abstraction has 150 states and 216 transitions. [2019-01-14 04:27:37,631 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:27:37,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 216 transitions. [2019-01-14 04:27:37,634 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 104 [2019-01-14 04:27:37,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:37,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:37,635 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:37,636 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:37,636 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 285#L-1 havoc main_#res;havoc main_#t~ret62, main_~retValue_acc~8, main_~tmp~8;havoc main_~retValue_acc~8;havoc main_~tmp~8; 276#L460 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 277#L468 main_#t~ret62 := valid_product_#res;main_~tmp~8 := main_#t~ret62;havoc main_#t~ret62; 286#L839 assume 0 != main_~tmp~8; 327#L816 havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 278#L51-1 [2019-01-14 04:27:37,636 INFO L796 eck$LassoCheckResult]: Loop: 278#L51-1 assume !false; 279#L490 assume test_~splverifierCounter~0 < 4; 314#L491 test_~tmp~4 := test_#t~nondet38;havoc test_#t~nondet38; 330#L499 assume !(0 != test_~tmp~4); 324#L499-1 test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 320#L509 assume !(0 != test_~tmp___0~1); 321#L509-1 test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 294#L519 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 295#L527-1 assume !(0 != ~pumpRunning~0); 300#L562 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret42, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 335#L594 assume !(0 == ~pumpRunning~0); 337#L569 havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 280#L928 __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 281#L51 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 278#L51-1 [2019-01-14 04:27:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:27:37,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:37,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:38,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:38,047 INFO L82 PathProgramCache]: Analyzing trace with hash -323255269, now seen corresponding path program 1 times [2019-01-14 04:27:38,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:38,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:38,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:38,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:27:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:27:38,109 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:27:38,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:27:38,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:27:38,111 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:27:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:27:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:27:38,112 INFO L87 Difference]: Start difference. First operand 150 states and 216 transitions. cyclomatic complexity: 69 Second operand 3 states. [2019-01-14 04:27:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:27:38,369 INFO L93 Difference]: Finished difference Result 233 states and 322 transitions. [2019-01-14 04:27:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:27:38,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 322 transitions. [2019-01-14 04:27:38,379 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 167 [2019-01-14 04:27:38,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 233 states and 322 transitions. [2019-01-14 04:27:38,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 233 [2019-01-14 04:27:38,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2019-01-14 04:27:38,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 322 transitions. [2019-01-14 04:27:38,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:27:38,393 INFO L706 BuchiCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-01-14 04:27:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 322 transitions. [2019-01-14 04:27:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-01-14 04:27:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-14 04:27:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 322 transitions. [2019-01-14 04:27:38,424 INFO L729 BuchiCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-01-14 04:27:38,424 INFO L609 BuchiCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-01-14 04:27:38,424 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:27:38,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 322 transitions. [2019-01-14 04:27:38,431 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 167 [2019-01-14 04:27:38,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:38,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:38,433 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:38,433 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:38,434 INFO L794 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 681#L-1 havoc main_#res;havoc main_#t~ret62, main_~retValue_acc~8, main_~tmp~8;havoc main_~retValue_acc~8;havoc main_~tmp~8; 667#L460 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 668#L468 main_#t~ret62 := valid_product_#res;main_~tmp~8 := main_#t~ret62;havoc main_#t~ret62; 682#L839 assume 0 != main_~tmp~8; 731#L816 havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 732#L51-1 [2019-01-14 04:27:38,434 INFO L796 eck$LassoCheckResult]: Loop: 732#L51-1 assume !false; 796#L490 assume test_~splverifierCounter~0 < 4; 791#L491 test_~tmp~4 := test_#t~nondet38;havoc test_#t~nondet38; 792#L499 assume !(0 != test_~tmp~4); 786#L499-1 test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 787#L509 assume !(0 != test_~tmp___0~1); 781#L509-1 test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 782#L519 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 706#L527-1 assume !(0 != ~pumpRunning~0); 707#L562 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret42, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 816#L594 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret61, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 686#L936 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 687#L941 isHighWaterLevel_#t~ret61 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret61;havoc isHighWaterLevel_#t~ret61; 815#L714 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~2 := 0; 720#L714-2 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 721#L720 processEnvironment_#t~ret42 := isHighWaterLevel_#res;processEnvironment_~tmp~5 := processEnvironment_#t~ret42;havoc processEnvironment_#t~ret42; 764#L598 assume !(0 != processEnvironment_~tmp~5); 765#L569 havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 820#L928 __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 819#L51 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 732#L51-1 [2019-01-14 04:27:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:38,435 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:27:38,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:38,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:38,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:38,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1551152025, now seen corresponding path program 1 times [2019-01-14 04:27:38,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:38,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:38,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:38,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:27:38,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1536440051, now seen corresponding path program 1 times [2019-01-14 04:27:38,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:38,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:38,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:38,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:38,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:39,918 WARN L181 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-01-14 04:28:03,715 WARN L181 SmtUtils]: Spent 23.72 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:28:15,117 WARN L181 SmtUtils]: Spent 11.40 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:28:15,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:28:15 BoogieIcfgContainer [2019-01-14 04:28:15,189 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:28:15,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:28:15,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:28:15,190 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:28:15,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:27:36" (3/4) ... [2019-01-14 04:28:15,195 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:28:15,307 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:28:15,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:28:15,308 INFO L168 Benchmark]: Toolchain (without parser) took 41148.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 943.3 MB in the beginning and 934.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 338.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:15,309 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:28:15,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:15,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.08 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:28:15,312 INFO L168 Benchmark]: Boogie Preprocessor took 41.88 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:28:15,312 INFO L168 Benchmark]: RCFGBuilder took 1235.19 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.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:15,313 INFO L168 Benchmark]: BuchiAutomizer took 38953.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 936.7 MB in the end (delta: 118.7 MB). Peak memory consumption was 415.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:15,314 INFO L168 Benchmark]: Witness Printer took 117.11 ms. Allocated memory is still 1.4 GB. Free memory was 936.7 MB in the beginning and 934.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:15,319 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 722.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.88 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 1235.19 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.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 38953.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 936.7 MB in the end (delta: 118.7 MB). Peak memory consumption was 415.3 MB. Max. memory is 11.5 GB. * Witness Printer took 117.11 ms. Allocated memory is still 1.4 GB. Free memory was 936.7 MB in the beginning and 934.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.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 3 locations. The remainder module has 233 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 38.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 233 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 230 SDtfs, 210 SDslu, 158 SDs, 0 SdLazy, 32 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 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: 489]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, NULL=0, NULL=0, retValue_acc=1, NULL=0, NULL=-10, NULL=0, retValue_acc=0, NULL=-22, NULL=-15, NULL=-23, methaneLevelCritical=0, tmp___0=0, tmp=0, NULL=0, NULL=-12, NULL=0, NULL=-24, retValue_acc=0, tmp___1=0, NULL=-8, NULL=-6, NULL=-4, tmp___0=0, cleanupTimeShifts=4, NULL=-21, NULL=-7, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@294cef44=0, NULL=-13, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ecbc34a=0, NULL=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18e7982b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63cc1620=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71d348db=71, NULL=0, systemActive=1, waterLevel=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61556eb0=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23b7bba1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e697329=0, NULL=-17, \result=0, NULL=0, NULL=0, NULL=0, NULL=-19, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, \result=0, NULL=-14, NULL=-2, NULL=-20, NULL=0, NULL=0, tmp=1, NULL=0, \result=1, NULL=-18, retValue_acc=1, tmp=1, NULL=-3, NULL=0, tmp=1, tmp___2=71, retValue_acc=1, NULL=-9, tmp___0=0, splverifierCounter=0, NULL=-16, head=0, tmp=0, NULL=-1, NULL=0, NULL=0, NULL=-5, NULL=0, NULL=0, NULL=-25, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22a6d998=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L238] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L555] int pumpRunning = 0; [L556] int systemActive = 1; [L757] int cleanupTimeShifts = 4; [L853] int waterLevel = 1; [L854] int methaneLevelCritical = 0; [L830] int retValue_acc ; [L831] int tmp ; [L464] int retValue_acc ; [L467] retValue_acc = 1 [L468] return (retValue_acc); [L837] tmp = valid_product() [L839] COND TRUE \read(tmp) [L480] int splverifierCounter ; [L481] int tmp ; [L482] int tmp___0 ; [L483] int tmp___1 ; [L484] int tmp___2 ; [L487] splverifierCounter = 0 Loop: [L489] COND TRUE 1 [L491] COND TRUE splverifierCounter < 4 [L497] tmp = __VERIFIER_nondet_int() [L499] COND FALSE !(\read(tmp)) [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND TRUE \read(tmp___2) [L743] systemActive = 1 [L562] COND FALSE !(\read(pumpRunning)) [L569] COND TRUE \read(systemActive) [L591] int tmp ; [L594] COND TRUE ! pumpRunning [L706] int retValue_acc ; [L707] int tmp ; [L708] int tmp___0 ; [L933] int retValue_acc ; [L936] COND TRUE waterLevel < 2 [L937] retValue_acc = 1 [L938] return (retValue_acc); [L712] tmp = isHighWaterSensorDry() [L714] COND TRUE \read(tmp) [L715] tmp___0 = 0 [L719] retValue_acc = tmp___0 [L720] return (retValue_acc); [L596] tmp = isHighWaterLevel() [L598] COND FALSE !(\read(tmp)) [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...