./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product42_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_product42_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 c0851c41d1dd56ed840a839dd5bb938ccfe6bf65 ........................................................................................................................................................................................................................................................................................................................................................................................................................... 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:31,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:27:31,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:27:31,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:27:31,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:27:31,144 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:27:31,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:27:31,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:27:31,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:27:31,154 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:27:31,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:27:31,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:27:31,158 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:27:31,159 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:27:31,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:27:31,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:27:31,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:27:31,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:27:31,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:27:31,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:27:31,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:27:31,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:27:31,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:27:31,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:27:31,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:27:31,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:27:31,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:27:31,196 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:27:31,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:27:31,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:27:31,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:27:31,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:27:31,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:27:31,204 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:27:31,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:27:31,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:27:31,206 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:31,236 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:27:31,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:27:31,243 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:27:31,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:27:31,244 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:27:31,244 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:27:31,245 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:27:31,245 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:27:31,245 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:27:31,245 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:27:31,245 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:27:31,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:27:31,246 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:27:31,246 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:27:31,246 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:27:31,246 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:27:31,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:27:31,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:27:31,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:27:31,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:27:31,249 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:27:31,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:27:31,249 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:27:31,250 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:27:31,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:27:31,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:27:31,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:27:31,250 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:27:31,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:27:31,251 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:27:31,251 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:27:31,256 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:27:31,256 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 -> c0851c41d1dd56ed840a839dd5bb938ccfe6bf65 [2019-01-14 04:27:31,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:27:31,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:27:31,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:27:31,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:27:31,329 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:27:31,329 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product42_false-unreach-call_false-termination.cil.c [2019-01-14 04:27:31,393 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e3c3351/b592bc156edf47aa9e2f72867eb48a81/FLAGd57a97612 [2019-01-14 04:27:31,871 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:27:31,872 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product42_false-unreach-call_false-termination.cil.c [2019-01-14 04:27:31,888 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e3c3351/b592bc156edf47aa9e2f72867eb48a81/FLAGd57a97612 [2019-01-14 04:27:32,172 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e3c3351/b592bc156edf47aa9e2f72867eb48a81 [2019-01-14 04:27:32,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:27:32,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:27:32,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:27:32,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:27:32,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:27:32,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:27:32" (1/1) ... [2019-01-14 04:27:32,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@872c042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:32, skipping insertion in model container [2019-01-14 04:27:32,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:27:32" (1/1) ... [2019-01-14 04:27:32,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:27:32,267 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:27:32,546 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:27:32,561 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:27:32,659 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:27:32,774 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:27:32,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:32 WrapperNode [2019-01-14 04:27:32,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:27:32,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:27:32,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:27:32,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:27:32,787 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:32" (1/1) ... [2019-01-14 04:27:32,810 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:32" (1/1) ... [2019-01-14 04:27:32,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:27:32,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:27:32,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:27:32,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:27:32,875 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:32" (1/1) ... [2019-01-14 04:27:32,875 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:32" (1/1) ... [2019-01-14 04:27:32,883 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:32" (1/1) ... [2019-01-14 04:27:32,884 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:32" (1/1) ... [2019-01-14 04:27:32,893 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:32" (1/1) ... [2019-01-14 04:27:32,902 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:32" (1/1) ... [2019-01-14 04:27:32,904 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:32" (1/1) ... [2019-01-14 04:27:32,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:27:32,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:27:32,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:27:32,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:27:32,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:32" (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:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:27:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:27:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:27:32,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:27:34,050 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:27:34,050 INFO L286 CfgBuilder]: Removed 116 assue(true) statements. [2019-01-14 04:27:34,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:27:34 BoogieIcfgContainer [2019-01-14 04:27:34,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:27:34,053 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:27:34,053 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:27:34,056 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:27:34,057 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:27:34,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:27:32" (1/3) ... [2019-01-14 04:27:34,059 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d5da3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:27:34, skipping insertion in model container [2019-01-14 04:27:34,059 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:27:34,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:32" (2/3) ... [2019-01-14 04:27:34,059 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d5da3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:27:34, skipping insertion in model container [2019-01-14 04:27:34,059 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:27:34,060 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:27:34" (3/3) ... [2019-01-14 04:27:34,061 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product42_false-unreach-call_false-termination.cil.c [2019-01-14 04:27:34,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:27:34,119 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:27:34,119 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:27:34,119 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:27:34,119 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:27:34,120 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:27:34,120 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:27:34,120 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:27:34,120 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:27:34,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states. [2019-01-14 04:27:34,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-14 04:27:34,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:34,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:34,172 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:34,173 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:34,173 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:27:34,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states. [2019-01-14 04:27:34,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-14 04:27:34,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:34,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:34,181 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:34,181 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:34,186 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 14#L-1true havoc main_#res;havoc main_#t~ret48, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 49#L532true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 75#L540true main_#t~ret48 := valid_product_#res;main_~tmp~4 := main_#t~ret48;havoc main_#t~ret48; 19#L658true assume 0 != main_~tmp~4; 55#L634true havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 12#L555-1true [2019-01-14 04:27:34,187 INFO L796 eck$LassoCheckResult]: Loop: 12#L555-1true assume !false; 29#L684true assume test_~splverifierCounter~0 < 4; 42#L685true test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 63#L693true assume !(0 != test_~tmp~5); 50#L693-1true test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 47#L703true assume !(0 != test_~tmp___0~1); 33#L703-1true test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 16#L713true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 38#L721-2true assume !(0 != ~pumpRunning~0); 6#L749true assume !(0 != ~systemActive~0); 65#L756true havoc __utac_acc__Specification4_spec__1_#t~ret46, __utac_acc__Specification4_spec__1_#t~ret47, __utac_acc__Specification4_spec__1_~tmp~3, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~3;havoc __utac_acc__Specification4_spec__1_~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; 40#L122true __utac_acc__Specification4_spec__1_#t~ret46 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~3 := __utac_acc__Specification4_spec__1_#t~ret46;havoc __utac_acc__Specification4_spec__1_#t~ret46; 10#L555true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~3); 12#L555-1true [2019-01-14 04:27:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:34,194 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:27:34,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:34,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:34,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:34,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:34,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1680236925, now seen corresponding path program 1 times [2019-01-14 04:27:35,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:35,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:27:35,268 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:35,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:27:35,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:27:35,278 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:27:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:27:35,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:27:35,306 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-01-14 04:27:35,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:27:35,455 INFO L93 Difference]: Finished difference Result 84 states and 116 transitions. [2019-01-14 04:27:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:27:35,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. [2019-01-14 04:27:35,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:27:35,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 77 states and 108 transitions. [2019-01-14 04:27:35,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2019-01-14 04:27:35,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2019-01-14 04:27:35,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 108 transitions. [2019-01-14 04:27:35,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:27:35,486 INFO L706 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-14 04:27:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 108 transitions. [2019-01-14 04:27:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-14 04:27:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 04:27:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2019-01-14 04:27:35,531 INFO L729 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-14 04:27:35,531 INFO L609 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-14 04:27:35,531 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:27:35,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 108 transitions. [2019-01-14 04:27:35,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:27:35,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:35,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:35,540 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:35,541 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:35,542 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 200#L-1 havoc main_#res;havoc main_#t~ret48, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 201#L532 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 234#L540 main_#t~ret48 := valid_product_#res;main_~tmp~4 := main_#t~ret48;havoc main_#t~ret48; 209#L658 assume 0 != main_~tmp~4; 210#L634 havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 191#L555-1 [2019-01-14 04:27:35,542 INFO L796 eck$LassoCheckResult]: Loop: 191#L555-1 assume !false; 198#L684 assume test_~splverifierCounter~0 < 4; 219#L685 test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 231#L693 assume !(0 != test_~tmp~5); 212#L693-1 test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 233#L703 assume !(0 != test_~tmp___0~1); 224#L703-1 test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 204#L713 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 205#L721-2 assume !(0 != ~pumpRunning~0); 183#L749 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret53, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 184#L781 assume !(0 == ~pumpRunning~0); 245#L756 havoc __utac_acc__Specification4_spec__1_#t~ret46, __utac_acc__Specification4_spec__1_#t~ret47, __utac_acc__Specification4_spec__1_~tmp~3, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~3;havoc __utac_acc__Specification4_spec__1_~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; 229#L122 __utac_acc__Specification4_spec__1_#t~ret46 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~3 := __utac_acc__Specification4_spec__1_#t~ret46;havoc __utac_acc__Specification4_spec__1_#t~ret46; 190#L555 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~3); 191#L555-1 [2019-01-14 04:27:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:27:35,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:35,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:35,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:35,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:35,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:35,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash -589506373, now seen corresponding path program 1 times [2019-01-14 04:27:35,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:35,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:35,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:35,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:27:35,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:27:35,942 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:35,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:27:35,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:27:35,943 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:27:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:27:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:27:35,944 INFO L87 Difference]: Start difference. First operand 77 states and 108 transitions. cyclomatic complexity: 33 Second operand 3 states. [2019-01-14 04:27:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:27:36,123 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2019-01-14 04:27:36,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:27:36,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 159 transitions. [2019-01-14 04:27:36,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 82 [2019-01-14 04:27:36,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 159 transitions. [2019-01-14 04:27:36,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2019-01-14 04:27:36,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2019-01-14 04:27:36,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 159 transitions. [2019-01-14 04:27:36,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:27:36,131 INFO L706 BuchiCegarLoop]: Abstraction has 118 states and 159 transitions. [2019-01-14 04:27:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 159 transitions. [2019-01-14 04:27:36,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-01-14 04:27:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 04:27:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 159 transitions. [2019-01-14 04:27:36,140 INFO L729 BuchiCegarLoop]: Abstraction has 118 states and 159 transitions. [2019-01-14 04:27:36,140 INFO L609 BuchiCegarLoop]: Abstraction has 118 states and 159 transitions. [2019-01-14 04:27:36,141 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:27:36,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 159 transitions. [2019-01-14 04:27:36,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 82 [2019-01-14 04:27:36,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:36,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:36,144 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:36,144 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:36,144 INFO L794 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(21);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 399#L-1 havoc main_#res;havoc main_#t~ret48, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 400#L532 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 437#L540 main_#t~ret48 := valid_product_#res;main_~tmp~4 := main_#t~ret48;havoc main_#t~ret48; 408#L658 assume 0 != main_~tmp~4; 409#L634 havoc test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 392#L555-1 [2019-01-14 04:27:36,144 INFO L796 eck$LassoCheckResult]: Loop: 392#L555-1 assume !false; 396#L684 assume test_~splverifierCounter~0 < 4; 418#L685 test_~tmp~5 := test_#t~nondet49;havoc test_#t~nondet49; 432#L693 assume !(0 != test_~tmp~5); 411#L693-1 test_~tmp___0~1 := test_#t~nondet50;havoc test_#t~nondet50; 436#L703 assume !(0 != test_~tmp___0~1); 423#L703-1 test_~tmp___2~0 := test_#t~nondet51;havoc test_#t~nondet51; 402#L713 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 403#L721-2 assume !(0 != ~pumpRunning~0); 427#L749 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret53, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 448#L781 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret72, isHighWaterLevel_~retValue_acc~11, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~11;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 449#L130 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 388#L135 isHighWaterLevel_#t~ret72 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret72;havoc isHighWaterLevel_#t~ret72; 389#L901 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~2 := 0; 431#L901-2 isHighWaterLevel_~retValue_acc~11 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~11; 419#L907 processEnvironment_#t~ret53 := isHighWaterLevel_#res;processEnvironment_~tmp~6 := processEnvironment_#t~ret53;havoc processEnvironment_#t~ret53; 420#L785 assume !(0 != processEnvironment_~tmp~6); 455#L756 havoc __utac_acc__Specification4_spec__1_#t~ret46, __utac_acc__Specification4_spec__1_#t~ret47, __utac_acc__Specification4_spec__1_~tmp~3, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~3;havoc __utac_acc__Specification4_spec__1_~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; 430#L122 __utac_acc__Specification4_spec__1_#t~ret46 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~3 := __utac_acc__Specification4_spec__1_#t~ret46;havoc __utac_acc__Specification4_spec__1_#t~ret46; 391#L555 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~3); 392#L555-1 [2019-01-14 04:27:36,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:27:36,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:36,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:36,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:36,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:36,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1033634393, now seen corresponding path program 1 times [2019-01-14 04:27:36,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:36,477 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,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:27:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:36,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1018922419, now seen corresponding path program 1 times [2019-01-14 04:27:36,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:36,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:36,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:36,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:37,597 WARN L181 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-01-14 04:27:37,843 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 04:28:06,549 WARN L181 SmtUtils]: Spent 28.68 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:28:20,979 WARN L181 SmtUtils]: Spent 14.43 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:28:21,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:28:21 BoogieIcfgContainer [2019-01-14 04:28:21,055 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:28:21,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:28:21,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:28:21,056 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:28:21,056 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:34" (3/4) ... [2019-01-14 04:28:21,061 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:28:21,138 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:28:21,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:28:21,139 INFO L168 Benchmark]: Toolchain (without parser) took 48963.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.8 MB). Free memory was 951.3 MB in the beginning and 999.7 MB in the end (delta: -48.3 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:21,141 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:28:21,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:21,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.46 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:21,144 INFO L168 Benchmark]: Boogie Preprocessor took 47.65 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:21,145 INFO L168 Benchmark]: RCFGBuilder took 1143.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:21,145 INFO L168 Benchmark]: BuchiAutomizer took 47001.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.0 MB). Peak memory consumption was 425.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:21,153 INFO L168 Benchmark]: Witness Printer took 83.31 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 999.7 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:21,161 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 597.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.46 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.65 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 1143.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47001.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.0 MB). Peak memory consumption was 425.4 MB. Max. memory is 11.5 GB. * Witness Printer took 83.31 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 999.7 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 118 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 46.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 118 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 219 SDtfs, 203 SDslu, 48 SDs, 0 SdLazy, 24 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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: 683]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=169} State at position 1 is {NULL=0, NULL=-24, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15fa70ec=0, NULL=169, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3750ce9c=0, NULL=-11, NULL=0, NULL=-6, NULL=0, NULL=-17, NULL=-14, retValue_acc=0, NULL=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@abbcb15=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5811abbb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@381d6518=63, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24bc3b5=0, NULL=-13, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@164e7f8=0, tmp___0=0, NULL=0, NULL=0, tmp=0, NULL=-16, NULL=-2, NULL=0, tmp___1=0, NULL=-4, tmp___0=0, NULL=-23, NULL=-15, cleanupTimeShifts=4, NULL=-12, NULL=-1, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-3, \result=1, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@571ad696=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@586f208=0, \result=0, NULL=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, NULL=-7, \result=0, tmp=1, retValue_acc=1, NULL=0, \result=1, NULL=-22, NULL=-21, retValue_acc=1, NULL=0, tmp=1, retValue_acc=0, NULL=-5, tmp=1, tmp___2=63, NULL=-10, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-8, NULL=-18, head=0, NULL=0, tmp=0, NULL=-9, NULL=0, NULL=0, NULL=-20, NULL=0, NULL=168, NULL=-19} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L310] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L573] int cleanupTimeShifts = 4; [L742] int pumpRunning = 0; [L743] int systemActive = 1; [L649] int retValue_acc ; [L650] int tmp ; [L536] int retValue_acc ; [L539] retValue_acc = 1 [L540] return (retValue_acc); [L656] tmp = valid_product() [L658] COND TRUE \read(tmp) [L674] int splverifierCounter ; [L675] int tmp ; [L676] int tmp___0 ; [L677] int tmp___1 ; [L678] int tmp___2 ; [L681] splverifierCounter = 0 Loop: [L683] COND TRUE 1 [L685] COND TRUE splverifierCounter < 4 [L691] tmp = __VERIFIER_nondet_int() [L693] COND FALSE !(\read(tmp)) [L701] tmp___0 = __VERIFIER_nondet_int() [L703] COND FALSE !(\read(tmp___0)) [L711] tmp___2 = __VERIFIER_nondet_int() [L713] COND TRUE \read(tmp___2) [L915] systemActive = 1 [L749] COND FALSE !(\read(pumpRunning)) [L756] COND TRUE \read(systemActive) [L778] int tmp ; [L781] COND TRUE ! pumpRunning [L893] int retValue_acc ; [L894] int tmp ; [L895] int tmp___0 ; [L127] int retValue_acc ; [L130] COND TRUE waterLevel < 2 [L131] retValue_acc = 1 [L132] return (retValue_acc); [L899] tmp = isHighWaterSensorDry() [L901] COND TRUE \read(tmp) [L902] tmp___0 = 0 [L906] retValue_acc = tmp___0 [L907] return (retValue_acc); [L783] tmp = isHighWaterLevel() [L785] COND FALSE !(\read(tmp)) [L548] int tmp ; [L549] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); [L553] tmp = getWaterLevel() [L555] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...