./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product36_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product36_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 8094c843e4d897e4501a7b90ca3369f741555e9e ........................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:47:17,129 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:47:17,131 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:47:17,143 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:47:17,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:47:17,144 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:47:17,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:47:17,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:47:17,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:47:17,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:47:17,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:47:17,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:47:17,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:47:17,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:47:17,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:47:17,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:47:17,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:47:17,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:47:17,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:47:17,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:47:17,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:47:17,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:47:17,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:47:17,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:47:17,180 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:47:17,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:47:17,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:47:17,185 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:47:17,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:47:17,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:47:17,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:47:17,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:47:17,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:47:17,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:47:17,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:47:17,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:47:17,193 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:47:17,223 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:47:17,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:47:17,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:47:17,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:47:17,225 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:47:17,225 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:47:17,226 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:47:17,226 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:47:17,226 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:47:17,226 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:47:17,226 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:47:17,228 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:47:17,228 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:47:17,228 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:47:17,228 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:47:17,228 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:47:17,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:47:17,229 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:47:17,229 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:47:17,229 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:47:17,229 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:47:17,229 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:47:17,231 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:47:17,231 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:47:17,231 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:47:17,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:47:17,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:47:17,232 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:47:17,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:47:17,232 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:47:17,233 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:47:17,234 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:47:17,234 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 -> 8094c843e4d897e4501a7b90ca3369f741555e9e [2019-01-01 23:47:17,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:47:17,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:47:17,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:47:17,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:47:17,299 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:47:17,300 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product36_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:17,361 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c269940/5d1ecb9325ae4fe28ae609e2838efd18/FLAG4cbaf90d1 [2019-01-01 23:47:17,913 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:47:17,914 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product36_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:17,929 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c269940/5d1ecb9325ae4fe28ae609e2838efd18/FLAG4cbaf90d1 [2019-01-01 23:47:18,155 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c269940/5d1ecb9325ae4fe28ae609e2838efd18 [2019-01-01 23:47:18,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:47:18,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:47:18,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:18,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:47:18,167 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:47:18,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:18,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18, skipping insertion in model container [2019-01-01 23:47:18,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:18,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:47:18,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:47:18,621 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:18,638 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:47:18,748 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:18,890 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:47:18,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18 WrapperNode [2019-01-01 23:47:18,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:18,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:18,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:47:18,892 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:47:18,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:18,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:18,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:18,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:47:18,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:47:18,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:47:18,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:18,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:18,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:18,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:18,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:19,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:19,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... [2019-01-01 23:47:19,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:47:19,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:47:19,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:47:19,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:47:19,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:47:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:47:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:47:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:47:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:47:20,242 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:47:20,243 INFO L280 CfgBuilder]: Removed 102 assue(true) statements. [2019-01-01 23:47:20,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:20 BoogieIcfgContainer [2019-01-01 23:47:20,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:47:20,244 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:47:20,244 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:47:20,247 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:47:20,248 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:20,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:47:18" (1/3) ... [2019-01-01 23:47:20,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5905e2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:20, skipping insertion in model container [2019-01-01 23:47:20,250 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:20,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:18" (2/3) ... [2019-01-01 23:47:20,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5905e2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:20, skipping insertion in model container [2019-01-01 23:47:20,251 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:20,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:20" (3/3) ... [2019-01-01 23:47:20,253 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product36_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:20,311 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:47:20,312 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:47:20,312 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:47:20,313 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:47:20,313 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:47:20,313 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:47:20,313 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:47:20,313 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:47:20,314 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:47:20,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-01 23:47:20,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:47:20,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:20,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:20,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:20,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:20,372 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:47:20,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-01 23:47:20,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:47:20,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:20,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:20,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:20,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:20,390 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(21);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(21);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);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(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #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(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1); 7#L-1true havoc main_#res;havoc main_#t~ret23, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 3#L420true havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 27#L428true main_#t~ret23 := valid_product_#res;main_~tmp~3 := main_#t~ret23;havoc main_#t~ret23; 30#L384true assume 0 != main_~tmp~3; 16#L358true havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 24#L911-1true [2019-01-01 23:47:20,394 INFO L796 eck$LassoCheckResult]: Loop: 24#L911-1true assume !false; 79#L57true assume test_~splverifierCounter~0 < 4; 4#L58true test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 39#L66true assume !(0 != test_~tmp~0); 37#L66-1true test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 12#L76true assume !(0 != test_~tmp___0~0); 10#L76-1true test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 74#L86true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 65#L94-1true assume !(0 != ~pumpRunning~0); 19#L131true assume !(0 != ~systemActive~0); 8#L138true havoc __utac_acc__Specification4_spec__1_#t~ret70, __utac_acc__Specification4_spec__1_#t~ret71, __utac_acc__Specification4_spec__1_~tmp~7, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~7;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;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; 71#L884true __utac_acc__Specification4_spec__1_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~7 := __utac_acc__Specification4_spec__1_#t~ret70;havoc __utac_acc__Specification4_spec__1_#t~ret70; 45#L911true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7); 24#L911-1true [2019-01-01 23:47:20,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:20,403 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:47:20,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:20,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:20,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1671986804, now seen corresponding path program 1 times [2019-01-01 23:47:21,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:21,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:21,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:21,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:21,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:21,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:21,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:47:21,400 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:47:21,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:47:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:47:21,419 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 3 states. [2019-01-01 23:47:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:21,535 INFO L93 Difference]: Finished difference Result 148 states and 210 transitions. [2019-01-01 23:47:21,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:47:21,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 210 transitions. [2019-01-01 23:47:21,546 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 94 [2019-01-01 23:47:21,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 134 states and 195 transitions. [2019-01-01 23:47:21,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-01-01 23:47:21,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-01-01 23:47:21,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 195 transitions. [2019-01-01 23:47:21,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:21,560 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 195 transitions. [2019-01-01 23:47:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 195 transitions. [2019-01-01 23:47:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-01-01 23:47:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-01 23:47:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 192 transitions. [2019-01-01 23:47:21,606 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 192 transitions. [2019-01-01 23:47:21,607 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 192 transitions. [2019-01-01 23:47:21,607 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:47:21,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 192 transitions. [2019-01-01 23:47:21,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 92 [2019-01-01 23:47:21,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:21,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:21,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:21,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:21,612 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(21);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(21);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);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(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #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(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1); 243#L-1 havoc main_#res;havoc main_#t~ret23, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 234#L420 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 235#L428 main_#t~ret23 := valid_product_#res;main_~tmp~3 := main_#t~ret23;havoc main_#t~ret23; 275#L384 assume 0 != main_~tmp~3; 256#L358 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 257#L911-1 [2019-01-01 23:47:21,616 INFO L796 eck$LassoCheckResult]: Loop: 257#L911-1 assume !false; 269#L57 assume test_~splverifierCounter~0 < 4; 236#L58 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 237#L66 assume !(0 != test_~tmp~0); 285#L66-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 251#L76 assume !(0 != test_~tmp___0~0); 248#L76-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 249#L86 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 305#L94-1 assume !(0 != ~pumpRunning~0); 260#L131 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret4, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 261#L163 assume !(0 == ~pumpRunning~0); 324#L138 havoc __utac_acc__Specification4_spec__1_#t~ret70, __utac_acc__Specification4_spec__1_#t~ret71, __utac_acc__Specification4_spec__1_~tmp~7, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~7;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;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; 311#L884 __utac_acc__Specification4_spec__1_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~7 := __utac_acc__Specification4_spec__1_#t~ret70;havoc __utac_acc__Specification4_spec__1_#t~ret70; 293#L911 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7); 257#L911-1 [2019-01-01 23:47:21,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:47:21,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:21,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:21,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:21,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:21,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash -323593893, now seen corresponding path program 1 times [2019-01-01 23:47:22,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:22,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:22,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:22,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:22,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:22,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:22,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:47:22,095 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:47:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:47:22,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:47:22,097 INFO L87 Difference]: Start difference. First operand 132 states and 192 transitions. cyclomatic complexity: 63 Second operand 3 states. [2019-01-01 23:47:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:22,620 INFO L93 Difference]: Finished difference Result 215 states and 298 transitions. [2019-01-01 23:47:22,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:47:22,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 298 transitions. [2019-01-01 23:47:22,631 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 155 [2019-01-01 23:47:22,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 215 states and 298 transitions. [2019-01-01 23:47:22,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2019-01-01 23:47:22,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2019-01-01 23:47:22,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 298 transitions. [2019-01-01 23:47:22,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:22,646 INFO L705 BuchiCegarLoop]: Abstraction has 215 states and 298 transitions. [2019-01-01 23:47:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 298 transitions. [2019-01-01 23:47:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-01-01 23:47:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-01 23:47:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 298 transitions. [2019-01-01 23:47:22,665 INFO L728 BuchiCegarLoop]: Abstraction has 215 states and 298 transitions. [2019-01-01 23:47:22,665 INFO L608 BuchiCegarLoop]: Abstraction has 215 states and 298 transitions. [2019-01-01 23:47:22,665 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:47:22,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 298 transitions. [2019-01-01 23:47:22,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 155 [2019-01-01 23:47:22,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:22,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:22,669 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:22,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:22,670 INFO L794 eck$LassoCheckResult]: Stem: 638#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(21);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(21);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);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(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #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(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1); 595#L-1 havoc main_#res;havoc main_#t~ret23, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 587#L420 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 588#L428 main_#t~ret23 := valid_product_#res;main_~tmp~3 := main_#t~ret23;havoc main_#t~ret23; 632#L384 assume 0 != main_~tmp~3; 611#L358 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 612#L911-1 [2019-01-01 23:47:22,670 INFO L796 eck$LassoCheckResult]: Loop: 612#L911-1 assume !false; 687#L57 assume test_~splverifierCounter~0 < 4; 688#L58 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 644#L66 assume !(0 != test_~tmp~0); 646#L66-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 605#L76 assume !(0 != test_~tmp___0~0); 606#L76-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 686#L86 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 675#L94-1 assume !(0 != ~pumpRunning~0); 615#L131 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret4, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 616#L163 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret22, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 608#L892 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 609#L897 isHighWaterLevel_#t~ret22 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret22;havoc isHighWaterLevel_#t~ret22; 659#L265 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~1 := 0; 657#L265-2 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 658#L271 processEnvironment_#t~ret4 := isHighWaterLevel_#res;processEnvironment_~tmp~1 := processEnvironment_#t~ret4;havoc processEnvironment_#t~ret4; 732#L167 assume !(0 != processEnvironment_~tmp~1); 596#L138 havoc __utac_acc__Specification4_spec__1_#t~ret70, __utac_acc__Specification4_spec__1_#t~ret71, __utac_acc__Specification4_spec__1_~tmp~7, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~7;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;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; 597#L884 __utac_acc__Specification4_spec__1_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~7 := __utac_acc__Specification4_spec__1_#t~ret70;havoc __utac_acc__Specification4_spec__1_#t~ret70; 653#L911 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7); 612#L911-1 [2019-01-01 23:47:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:47:22,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:22,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:22,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:22,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1551490649, now seen corresponding path program 1 times [2019-01-01 23:47:22,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:22,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:22,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:22,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:22,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:22,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:22,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1536778675, now seen corresponding path program 1 times [2019-01-01 23:47:22,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:22,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:22,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:22,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:23,908 WARN L181 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-01-01 23:47:24,112 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 23:47:53,653 WARN L181 SmtUtils]: Spent 29.52 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:48:07,998 WARN L181 SmtUtils]: Spent 14.34 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:48:08,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:48:08 BoogieIcfgContainer [2019-01-01 23:48:08,082 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:48:08,083 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:48:08,083 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:48:08,083 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:48:08,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:20" (3/4) ... [2019-01-01 23:48:08,087 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:48:08,165 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:48:08,165 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:48:08,166 INFO L168 Benchmark]: Toolchain (without parser) took 50006.21 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 944.7 MB in the beginning and 957.1 MB in the end (delta: -12.5 MB). Peak memory consumption was 314.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:08,167 INFO L168 Benchmark]: CDTParser took 0.18 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-01 23:48:08,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:08,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:08,168 INFO L168 Benchmark]: Boogie Preprocessor took 58.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:08,170 INFO L168 Benchmark]: RCFGBuilder took 1212.09 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.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:08,171 INFO L168 Benchmark]: BuchiAutomizer took 47838.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 959.2 MB in the end (delta: 110.5 MB). Peak memory consumption was 411.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:08,171 INFO L168 Benchmark]: Witness Printer took 82.49 ms. Allocated memory is still 1.4 GB. Free memory was 959.2 MB in the beginning and 957.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:08,176 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.18 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 729.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.28 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 58.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1212.09 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.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47838.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 959.2 MB in the end (delta: 110.5 MB). Peak memory consumption was 411.4 MB. Max. memory is 11.5 GB. * Witness Printer took 82.49 ms. Allocated memory is still 1.4 GB. Free memory was 959.2 MB in the beginning and 957.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 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 215 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 46.8s. Construction of modules took 0.5s. 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 215 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 217 SDtfs, 185 SDslu, 146 SDs, 0 SdLazy, 32 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s 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: 56]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@780e7c4e=0, NULL=-10, NULL=0, NULL=0, NULL=-21, NULL=0, NULL=0, retValue_acc=1, NULL=0, NULL=-17, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49f81c4c=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@725d6b77=0, NULL=-9, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ac27027=72, NULL=-24, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@754b1c4f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64cf09f2=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@108a3eb9=0, NULL=-11, NULL=-4, methaneLevelCritical=0, tmp___0=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, tmp___1=0, cleanupTimeShifts=4, tmp=0, NULL=-2, tmp___0=0, NULL=-8, NULL=-16, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-3, \result=1, \result=0, NULL=-18, NULL=-6, NULL=0, tmp___0=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e1654b7=0, \result=1, head=0, pumpRunning=0, NULL=-20, \result=0, NULL=-19, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e6e2729=0, NULL=-7, tmp=1, NULL=0, NULL=0, NULL=0, retValue_acc=1, \result=1, NULL=-23, NULL=-26, NULL=-22, tmp=1, tmp=1, tmp___2=72, retValue_acc=1, splverifierCounter=0, NULL=0, NULL=0, NULL=-12, tmp=0, head=0, NULL=-15, NULL=-13, NULL=0, NULL=0, NULL=-14, NULL=-1, NULL=0, NULL=-25} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L123] int pumpRunning = 0; [L124] int systemActive = 1; [L299] int cleanupTimeShifts = 4; [L611] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L809] int waterLevel = 1; [L810] int methaneLevelCritical = 0; [L375] int retValue_acc ; [L376] int tmp ; [L424] int retValue_acc ; [L427] retValue_acc = 1 [L428] return (retValue_acc); [L382] tmp = valid_product() [L384] COND TRUE \read(tmp) [L47] int splverifierCounter ; [L48] int tmp ; [L49] int tmp___0 ; [L50] int tmp___1 ; [L51] int tmp___2 ; [L54] splverifierCounter = 0 Loop: [L56] COND TRUE 1 [L58] COND TRUE splverifierCounter < 4 [L64] tmp = __VERIFIER_nondet_int() [L66] COND FALSE !(\read(tmp)) [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L294] systemActive = 1 [L131] COND FALSE !(\read(pumpRunning)) [L138] COND TRUE \read(systemActive) [L160] int tmp ; [L163] COND TRUE ! pumpRunning [L257] int retValue_acc ; [L258] int tmp ; [L259] int tmp___0 ; [L889] int retValue_acc ; [L892] COND TRUE waterLevel < 2 [L893] retValue_acc = 1 [L894] return (retValue_acc); [L263] tmp = isHighWaterSensorDry() [L265] COND TRUE \read(tmp) [L266] tmp___0 = 0 [L270] retValue_acc = tmp___0 [L271] return (retValue_acc); [L165] tmp = isHighWaterLevel() [L167] COND FALSE !(\read(tmp)) [L904] int tmp ; [L905] int tmp___0 ; [L880] int retValue_acc ; [L883] retValue_acc = waterLevel [L884] return (retValue_acc); [L909] tmp = getWaterLevel() [L911] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...