./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product32_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product32_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 249d62a54436f1843aa0e9d30b8a57435cee856a .................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:30:45,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:30:45,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:30:45,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:30:45,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:30:45,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:30:45,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:30:45,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:30:45,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:30:45,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:30:45,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:30:45,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:30:45,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:30:45,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:30:45,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:30:45,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:30:45,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:30:45,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:30:45,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:30:45,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:30:45,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:30:45,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:30:45,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:30:45,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:30:45,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:30:45,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:30:45,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:30:45,073 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:30:45,074 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:30:45,075 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:30:45,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:30:45,076 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:30:45,076 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:30:45,076 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:30:45,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:30:45,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:30:45,078 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:30:45,094 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:30:45,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:30:45,095 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:30:45,095 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:30:45,095 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:30:45,096 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:30:45,096 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:30:45,096 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:30:45,096 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:30:45,096 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:30:45,096 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:30:45,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:30:45,097 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:30:45,097 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:30:45,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:30:45,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:30:45,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:30:45,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:30:45,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:30:45,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:30:45,098 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:30:45,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:30:45,098 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:30:45,099 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:30:45,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:30:45,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:30:45,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:30:45,099 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:30:45,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:30:45,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:30:45,100 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:30:45,101 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:30:45,101 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 -> 249d62a54436f1843aa0e9d30b8a57435cee856a [2019-01-14 04:30:45,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:30:45,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:30:45,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:30:45,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:30:45,152 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:30:45,154 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product32_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:45,211 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa1b3591/256d62e16f4646d49de2250b75fd4ec0/FLAGd8dc847c1 [2019-01-14 04:30:45,732 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:30:45,733 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product32_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:45,759 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa1b3591/256d62e16f4646d49de2250b75fd4ec0/FLAGd8dc847c1 [2019-01-14 04:30:46,020 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa1b3591/256d62e16f4646d49de2250b75fd4ec0 [2019-01-14 04:30:46,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:30:46,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:30:46,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:30:46,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:30:46,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:30:46,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:30:46" (1/1) ... [2019-01-14 04:30:46,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214e07d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46, skipping insertion in model container [2019-01-14 04:30:46,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:30:46" (1/1) ... [2019-01-14 04:30:46,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:30:46,086 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:30:46,429 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:30:46,462 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:30:46,654 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:30:46,700 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:30:46,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46 WrapperNode [2019-01-14 04:30:46,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:30:46,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:30:46,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:30:46,702 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:30:46,711 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:30:46" (1/1) ... [2019-01-14 04:30:46,745 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:30:46" (1/1) ... [2019-01-14 04:30:46,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:30:46,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:30:46,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:30:46,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:30:46,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46" (1/1) ... [2019-01-14 04:30:46,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46" (1/1) ... [2019-01-14 04:30:46,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46" (1/1) ... [2019-01-14 04:30:46,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46" (1/1) ... [2019-01-14 04:30:46,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46" (1/1) ... [2019-01-14 04:30:46,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46" (1/1) ... [2019-01-14 04:30:46,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46" (1/1) ... [2019-01-14 04:30:46,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:30:46,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:30:46,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:30:46,840 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:30:46,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46" (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:30:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:30:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:30:46,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:30:46,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:30:48,150 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:30:48,150 INFO L286 CfgBuilder]: Removed 176 assue(true) statements. [2019-01-14 04:30:48,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:30:48 BoogieIcfgContainer [2019-01-14 04:30:48,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:30:48,153 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:30:48,153 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:30:48,156 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:30:48,157 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:30:48,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:30:46" (1/3) ... [2019-01-14 04:30:48,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27d2bd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:30:48, skipping insertion in model container [2019-01-14 04:30:48,158 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:30:48,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:46" (2/3) ... [2019-01-14 04:30:48,159 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27d2bd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:30:48, skipping insertion in model container [2019-01-14 04:30:48,159 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:30:48,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:30:48" (3/3) ... [2019-01-14 04:30:48,161 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product32_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:48,217 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:30:48,218 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:30:48,218 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:30:48,218 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:30:48,219 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:30:48,219 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:30:48,219 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:30:48,219 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:30:48,219 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:30:48,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states. [2019-01-14 04:30:48,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2019-01-14 04:30:48,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:48,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:48,276 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:48,276 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:48,276 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:30:48,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states. [2019-01-14 04:30:48,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2019-01-14 04:30:48,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:48,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:48,285 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:48,286 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:48,291 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~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);~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(25);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 8#L-1true havoc main_#res;havoc main_#t~ret1, main_~retValue_acc~2, main_~tmp~0;havoc main_~retValue_acc~2;havoc main_~tmp~0; 9#L65true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 7#L73true main_#t~ret1 := valid_product_#res;main_~tmp~0 := main_#t~ret1;havoc main_#t~ret1; 99#L167true assume 0 != main_~tmp~0; 46#L141true ~switchedOnBeforeTS~0 := 0; 89#L498true havoc test_#t~nondet23, test_#t~nondet24, test_#t~nondet25, test_#t~nondet26, 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#L519-1true [2019-01-14 04:30:48,291 INFO L796 eck$LassoCheckResult]: Loop: 12#L519-1true assume !false; 26#L433true assume test_~splverifierCounter~0 < 4; 110#L434true test_~tmp~5 := test_#t~nondet23;havoc test_#t~nondet23; 15#L442true assume !(0 != test_~tmp~5); 4#L442-1true test_~tmp___0~1 := test_#t~nondet24;havoc test_#t~nondet24; 28#L452true assume !(0 != test_~tmp___0~1); 32#L452-1true test_~tmp___2~0 := test_#t~nondet25;havoc test_#t~nondet25; 90#L462true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 106#L470-1true havoc __utac_acc__Specification5_spec__2_#t~ret27;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 39#L339true __utac_acc__Specification5_spec__2_#t~ret27 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret27;havoc __utac_acc__Specification5_spec__2_#t~ret27; 11#L508true assume !(0 != ~pumpRunning~0); 104#L211true assume !(0 != ~systemActive~0); 30#L218true havoc __utac_acc__Specification5_spec__3_#t~ret28, __utac_acc__Specification5_spec__3_#t~ret29, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~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; 102#L982true __utac_acc__Specification5_spec__3_#t~ret28 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret28;havoc __utac_acc__Specification5_spec__3_#t~ret28; 10#L519true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 12#L519-1true [2019-01-14 04:30:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:48,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:30:48,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:48,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:48,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:48,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:48,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash 676518966, now seen corresponding path program 1 times [2019-01-14 04:30:49,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:49,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:49,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:30:49,279 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:30:49,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:30:49,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:30:49,287 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:30:49,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:30:49,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:30:49,309 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 3 states. [2019-01-14 04:30:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:30:49,484 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2019-01-14 04:30:49,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:30:49,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 311 transitions. [2019-01-14 04:30:49,496 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2019-01-14 04:30:49,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 205 states and 296 transitions. [2019-01-14 04:30:49,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2019-01-14 04:30:49,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2019-01-14 04:30:49,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 296 transitions. [2019-01-14 04:30:49,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:30:49,510 INFO L706 BuchiCegarLoop]: Abstraction has 205 states and 296 transitions. [2019-01-14 04:30:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 296 transitions. [2019-01-14 04:30:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2019-01-14 04:30:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-14 04:30:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 293 transitions. [2019-01-14 04:30:49,553 INFO L729 BuchiCegarLoop]: Abstraction has 203 states and 293 transitions. [2019-01-14 04:30:49,553 INFO L609 BuchiCegarLoop]: Abstraction has 203 states and 293 transitions. [2019-01-14 04:30:49,554 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:30:49,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 293 transitions. [2019-01-14 04:30:49,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 140 [2019-01-14 04:30:49,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:49,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:49,559 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:49,559 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:49,560 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~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);~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(25);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 350#L-1 havoc main_#res;havoc main_#t~ret1, main_~retValue_acc~2, main_~tmp~0;havoc main_~retValue_acc~2;havoc main_~tmp~0; 351#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 348#L73 main_#t~ret1 := valid_product_#res;main_~tmp~0 := main_#t~ret1;havoc main_#t~ret1; 349#L167 assume 0 != main_~tmp~0; 413#L141 ~switchedOnBeforeTS~0 := 0; 414#L498 havoc test_#t~nondet23, test_#t~nondet24, test_#t~nondet25, test_#t~nondet26, 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; 447#L519-1 [2019-01-14 04:30:49,560 INFO L796 eck$LassoCheckResult]: Loop: 447#L519-1 assume !false; 489#L433 assume test_~splverifierCounter~0 < 4; 490#L434 test_~tmp~5 := test_#t~nondet23;havoc test_#t~nondet23; 523#L442 assume !(0 != test_~tmp~5); 520#L442-1 test_~tmp___0~1 := test_#t~nondet24;havoc test_#t~nondet24; 518#L452 assume !(0 != test_~tmp___0~1); 516#L452-1 test_~tmp___2~0 := test_#t~nondet25;havoc test_#t~nondet25; 515#L462 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 449#L470-1 havoc __utac_acc__Specification5_spec__2_#t~ret27;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 513#L339 __utac_acc__Specification5_spec__2_#t~ret27 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret27;havoc __utac_acc__Specification5_spec__2_#t~ret27; 509#L508 assume !(0 != ~pumpRunning~0); 507#L211 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret3, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 506#L269 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret2, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 499#L243-1 assume !(0 != ~pumpRunning~0); 496#L218 havoc __utac_acc__Specification5_spec__3_#t~ret28, __utac_acc__Specification5_spec__3_#t~ret29, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~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; 495#L982 __utac_acc__Specification5_spec__3_#t~ret28 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret28;havoc __utac_acc__Specification5_spec__3_#t~ret28; 493#L519 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 447#L519-1 [2019-01-14 04:30:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:30:49,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:49,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:49,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash -554713784, now seen corresponding path program 1 times [2019-01-14 04:30:49,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:49,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:49,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:30:49,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1677326142, now seen corresponding path program 1 times [2019-01-14 04:30:49,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:49,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:49,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:30:50,151 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:30:50,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:30:50,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:30:50,528 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-14 04:30:50,701 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 04:30:50,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:30:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:30:50,732 INFO L87 Difference]: Start difference. First operand 203 states and 293 transitions. cyclomatic complexity: 93 Second operand 5 states. [2019-01-14 04:30:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:30:51,716 INFO L93 Difference]: Finished difference Result 608 states and 873 transitions. [2019-01-14 04:30:51,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:30:51,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 873 transitions. [2019-01-14 04:30:51,729 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 274 [2019-01-14 04:30:51,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 608 states and 873 transitions. [2019-01-14 04:30:51,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 608 [2019-01-14 04:30:51,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 608 [2019-01-14 04:30:51,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 608 states and 873 transitions. [2019-01-14 04:30:51,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:30:51,744 INFO L706 BuchiCegarLoop]: Abstraction has 608 states and 873 transitions. [2019-01-14 04:30:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states and 873 transitions. [2019-01-14 04:30:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 399. [2019-01-14 04:30:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-14 04:30:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 565 transitions. [2019-01-14 04:30:51,776 INFO L729 BuchiCegarLoop]: Abstraction has 399 states and 565 transitions. [2019-01-14 04:30:51,776 INFO L609 BuchiCegarLoop]: Abstraction has 399 states and 565 transitions. [2019-01-14 04:30:51,776 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:30:51,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 565 transitions. [2019-01-14 04:30:51,780 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 274 [2019-01-14 04:30:51,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:51,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:51,782 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:51,782 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] [2019-01-14 04:30:51,783 INFO L794 eck$LassoCheckResult]: Stem: 1291#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~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);~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(25);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 1177#L-1 havoc main_#res;havoc main_#t~ret1, main_~retValue_acc~2, main_~tmp~0;havoc main_~retValue_acc~2;havoc main_~tmp~0; 1178#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 1175#L73 main_#t~ret1 := valid_product_#res;main_~tmp~0 := main_#t~ret1;havoc main_#t~ret1; 1176#L167 assume 0 != main_~tmp~0; 1249#L141 ~switchedOnBeforeTS~0 := 0; 1250#L498 havoc test_#t~nondet23, test_#t~nondet24, test_#t~nondet25, test_#t~nondet26, 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; 1292#L519-1 [2019-01-14 04:30:51,783 INFO L796 eck$LassoCheckResult]: Loop: 1292#L519-1 assume !false; 1410#L433 assume test_~splverifierCounter~0 < 4; 1411#L434 test_~tmp~5 := test_#t~nondet23;havoc test_#t~nondet23; 1500#L442 assume !(0 != test_~tmp~5); 1489#L442-1 test_~tmp___0~1 := test_#t~nondet24;havoc test_#t~nondet24; 1479#L452 assume !(0 != test_~tmp___0~1); 1446#L452-1 test_~tmp___2~0 := test_#t~nondet25;havoc test_#t~nondet25; 1441#L462 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1437#L470-1 havoc __utac_acc__Specification5_spec__2_#t~ret27;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 1436#L339 __utac_acc__Specification5_spec__2_#t~ret27 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret27;havoc __utac_acc__Specification5_spec__2_#t~ret27; 1435#L508 assume !(0 != ~pumpRunning~0); 1432#L211 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret3, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 1427#L269 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret2, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 1420#L243-1 assume !(0 != ~pumpRunning~0); 1417#L218 havoc __utac_acc__Specification5_spec__3_#t~ret28, __utac_acc__Specification5_spec__3_#t~ret29, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~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; 1416#L982 __utac_acc__Specification5_spec__3_#t~ret28 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret28;havoc __utac_acc__Specification5_spec__3_#t~ret28; 1415#L519 assume 2 != __utac_acc__Specification5_spec__3_~tmp~6;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 1414#L339-1 __utac_acc__Specification5_spec__3_#t~ret29 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret29;havoc __utac_acc__Specification5_spec__3_#t~ret29; 1413#L523 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 1292#L519-1 [2019-01-14 04:30:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:30:51,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:51,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:51,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:51,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:52,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:52,057 INFO L82 PathProgramCache]: Analyzing trace with hash -504014109, now seen corresponding path program 1 times [2019-01-14 04:30:52,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:52,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:52,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:30:52,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:52,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1297698851, now seen corresponding path program 1 times [2019-01-14 04:30:52,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:52,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:52,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:52,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:52,996 WARN L181 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-14 04:30:53,108 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:31:14,285 WARN L181 SmtUtils]: Spent 21.15 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:31:27,104 WARN L181 SmtUtils]: Spent 12.81 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:31:27,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:31:27 BoogieIcfgContainer [2019-01-14 04:31:27,190 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:31:27,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:31:27,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:31:27,191 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:31:27,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:30:48" (3/4) ... [2019-01-14 04:31:27,197 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:31:27,288 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:31:27,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:31:27,289 INFO L168 Benchmark]: Toolchain (without parser) took 41264.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 944.7 MB in the beginning and 886.6 MB in the end (delta: 58.0 MB). Peak memory consumption was 380.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:27,292 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:31:27,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:27,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.09 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:31:27,298 INFO L168 Benchmark]: Boogie Preprocessor took 49.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:27,304 INFO L168 Benchmark]: RCFGBuilder took 1312.75 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:27,306 INFO L168 Benchmark]: BuchiAutomizer took 39037.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 889.7 MB in the end (delta: 172.8 MB). Peak memory consumption was 397.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:27,307 INFO L168 Benchmark]: Witness Printer took 97.79 ms. Allocated memory is still 1.4 GB. Free memory was 889.7 MB in the beginning and 886.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:27,314 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.28 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 674.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.09 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 49.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1312.75 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 39037.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 889.7 MB in the end (delta: 172.8 MB). Peak memory consumption was 397.2 MB. Max. memory is 11.5 GB. * Witness Printer took 97.79 ms. Allocated memory is still 1.4 GB. Free memory was 889.7 MB in the beginning and 886.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.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 5 locations. The remainder module has 399 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 37.5s. Construction of modules took 0.8s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 211 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 399 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 411 SDtfs, 727 SDslu, 637 SDs, 0 SdLazy, 107 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 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: 432]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=9472} State at position 1 is {NULL=9471, NULL=0, NULL=0, retValue_acc=1, retValue_acc=0, NULL=9472, NULL=-24, NULL=0, NULL=0, NULL=-22, NULL=-23, methaneLevelCritical=0, tmp=1, tmp=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1fb8e2fa=0, NULL=0, NULL=-12, tmp___1=0, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-4, \result=0, NULL=-7, NULL=-13, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=-16, NULL=0, NULL=0, NULL=0, NULL=-18, NULL=0, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, tmp___0=0, tmp=1, NULL=-5, NULL=-15, \result=0, NULL=-6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d7b9930=0, NULL=-9, NULL=-11, NULL=0, NULL=-21, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53054297=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e6191ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74339f09=63, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2849d94d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d1337de=0, NULL=0, NULL=0, NULL=-20, NULL=-3, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3da60b92=0, NULL=0, retValue_acc=1, tmp___2=63, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=-1, NULL=-8, NULL=-17, tmp=0, head=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@729c405=0, NULL=-10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@669607b=0, NULL=0, NULL=0, NULL=-19, NULL=-2, NULL=0, NULL=-14, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L78] int cleanupTimeShifts = 4; [L199] int pumpRunning = 0; [L200] int systemActive = 1; [L492] int switchedOnBeforeTS ; [L710] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L907] int waterLevel = 1; [L908] int methaneLevelCritical = 0; [L158] int retValue_acc ; [L159] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L165] tmp = valid_product() [L167] COND TRUE \read(tmp) [L497] switchedOnBeforeTS = 0 [L423] int splverifierCounter ; [L424] int tmp ; [L425] int tmp___0 ; [L426] int tmp___1 ; [L427] int tmp___2 ; [L430] splverifierCounter = 0 Loop: [L432] COND TRUE 1 [L434] COND TRUE splverifierCounter < 4 [L440] tmp = __VERIFIER_nondet_int() [L442] COND FALSE !(\read(tmp)) [L450] tmp___0 = __VERIFIER_nondet_int() [L452] COND FALSE !(\read(tmp___0)) [L460] tmp___2 = __VERIFIER_nondet_int() [L462] COND TRUE \read(tmp___2) [L417] systemActive = 1 [L335] int retValue_acc ; [L338] retValue_acc = pumpRunning [L339] return (retValue_acc); [L506] switchedOnBeforeTS = isPumpRunning() [L211] COND FALSE !(\read(pumpRunning)) [L218] COND TRUE \read(systemActive) [L266] int tmp ; [L269] COND FALSE !(\read(pumpRunning)) [L240] int tmp ; [L243] COND FALSE !(\read(pumpRunning)) [L512] int tmp ; [L513] int tmp___0 ; [L978] int retValue_acc ; [L981] retValue_acc = waterLevel [L982] return (retValue_acc); [L517] tmp = getWaterLevel() [L519] COND TRUE tmp != 2 [L335] int retValue_acc ; [L338] retValue_acc = pumpRunning [L339] return (retValue_acc); [L521] tmp___0 = isPumpRunning() [L523] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...