./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product62_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product62_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 aba800ab301c8226900a4d7cbc461b1db848e476 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:53:14,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:53:14,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:53:14,166 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:53:14,167 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:53:14,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:53:14,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:53:14,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:53:14,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:53:14,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:53:14,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:53:14,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:53:14,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:53:14,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:53:14,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:53:14,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:53:14,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:53:14,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:53:14,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:53:14,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:53:14,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:53:14,208 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:53:14,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:53:14,214 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:53:14,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:53:14,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:53:14,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:53:14,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:53:14,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:53:14,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:53:14,228 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:53:14,229 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:53:14,229 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:53:14,229 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:53:14,230 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:53:14,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:53:14,234 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:53:14,264 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:53:14,267 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:53:14,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:53:14,272 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:53:14,273 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:53:14,273 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:53:14,274 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:53:14,274 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:53:14,274 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:53:14,274 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:53:14,275 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:53:14,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:53:14,275 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:53:14,275 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:53:14,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:53:14,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:53:14,276 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:53:14,276 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:53:14,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:53:14,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:53:14,276 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:53:14,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:53:14,280 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:53:14,280 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:53:14,280 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:53:14,280 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:53:14,281 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:53:14,281 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:53:14,281 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:53:14,281 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:53:14,281 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:53:14,283 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:53:14,284 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 -> aba800ab301c8226900a4d7cbc461b1db848e476 [2019-01-01 23:53:14,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:53:14,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:53:14,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:53:14,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:53:14,365 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:53:14,366 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product62_true-unreach-call_false-termination.cil.c [2019-01-01 23:53:14,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4d2b28c/2365913b8dec47dcbfcf2aff68601a57/FLAGb47374132 [2019-01-01 23:53:14,911 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:53:14,912 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product62_true-unreach-call_false-termination.cil.c [2019-01-01 23:53:14,935 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4d2b28c/2365913b8dec47dcbfcf2aff68601a57/FLAGb47374132 [2019-01-01 23:53:15,200 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4d2b28c/2365913b8dec47dcbfcf2aff68601a57 [2019-01-01 23:53:15,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:53:15,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:53:15,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:15,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:53:15,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:53:15,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:15" (1/1) ... [2019-01-01 23:53:15,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9e942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15, skipping insertion in model container [2019-01-01 23:53:15,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:15" (1/1) ... [2019-01-01 23:53:15,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:53:15,284 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:53:15,698 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:15,728 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:53:15,940 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:15,988 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:53:15,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15 WrapperNode [2019-01-01 23:53:15,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:15,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:15,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:53:15,990 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:53:16,000 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:53:15" (1/1) ... [2019-01-01 23:53:16,027 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:53:15" (1/1) ... [2019-01-01 23:53:16,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:16,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:53:16,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:53:16,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:53:16,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15" (1/1) ... [2019-01-01 23:53:16,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15" (1/1) ... [2019-01-01 23:53:16,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15" (1/1) ... [2019-01-01 23:53:16,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15" (1/1) ... [2019-01-01 23:53:16,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15" (1/1) ... [2019-01-01 23:53:16,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15" (1/1) ... [2019-01-01 23:53:16,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15" (1/1) ... [2019-01-01 23:53:16,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:53:16,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:53:16,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:53:16,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:53:16,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15" (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:53:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:53:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:53:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:53:16,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:53:18,192 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:53:18,193 INFO L280 CfgBuilder]: Removed 364 assue(true) statements. [2019-01-01 23:53:18,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:18 BoogieIcfgContainer [2019-01-01 23:53:18,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:53:18,194 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:53:18,195 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:53:18,199 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:53:18,200 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:18,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:53:15" (1/3) ... [2019-01-01 23:53:18,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62796b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:18, skipping insertion in model container [2019-01-01 23:53:18,201 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:18,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:15" (2/3) ... [2019-01-01 23:53:18,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62796b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:18, skipping insertion in model container [2019-01-01 23:53:18,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:18,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:18" (3/3) ... [2019-01-01 23:53:18,204 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product62_true-unreach-call_false-termination.cil.c [2019-01-01 23:53:18,265 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:53:18,266 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:53:18,267 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:53:18,267 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:53:18,267 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:53:18,267 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:53:18,268 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:53:18,268 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:53:18,268 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:53:18,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states. [2019-01-01 23:53:18,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 151 [2019-01-01 23:53:18,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:18,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:18,357 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:18,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:18,358 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:53:18,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states. [2019-01-01 23:53:18,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 151 [2019-01-01 23:53:18,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:18,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:18,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:18,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:18,381 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(13);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(110, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(102, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(102, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 3 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string12.base, #t~string12.offset, 1);call write~init~int(80, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(117, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(109, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(112, #t~string12.base, 4 + #t~string12.offset, 1);call write~init~int(58, #t~string12.base, 5 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 6 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string18.base, #t~string18.offset, 1);call write~init~int(32, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string20.base, #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 1 + #t~string20.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);~cleanupTimeShifts~0 := 4; 15#L-1true havoc main_#res;havoc main_#t~ret75, main_~retValue_acc~11, main_~tmp~11;havoc main_~retValue_acc~11;havoc main_~tmp~11; 137#L1025true havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 59#L1033true main_#t~ret75 := valid_product_#res;main_~tmp~11 := main_#t~ret75;havoc main_#t~ret75; 70#L980true assume 0 != main_~tmp~11; 138#L953true ~switchedOnBeforeTS~0 := 0; 54#L312true havoc test_#t~nondet26, test_#t~nondet27, test_#t~nondet28, test_#t~nondet29, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 173#L333-1true [2019-01-01 23:53:18,381 INFO L796 eck$LassoCheckResult]: Loop: 173#L333-1true assume !false; 72#L369true assume test_~splverifierCounter~0 < 4; 133#L370true test_~tmp~7 := test_#t~nondet26;havoc test_#t~nondet26; 61#L378true assume !(0 != test_~tmp~7); 52#L378-1true test_~tmp___0~3 := test_#t~nondet27;havoc test_#t~nondet27; 161#L388true assume !(0 != test_~tmp___0~3); 165#L388-1true test_~tmp___2~0 := test_#t~nondet28;havoc test_#t~nondet28; 110#L398true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 16#L406-2true havoc __utac_acc__Specification5_spec__2_#t~ret23;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 219#L217true __utac_acc__Specification5_spec__2_#t~ret23 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret23;havoc __utac_acc__Specification5_spec__2_#t~ret23; 170#L322true assume !(0 != ~pumpRunning~0); 200#L63true assume !(0 != ~systemActive~0); 36#L70true havoc __utac_acc__Specification5_spec__3_#t~ret24, __utac_acc__Specification5_spec__3_#t~ret25, __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~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 112#L866true __utac_acc__Specification5_spec__3_#t~ret24 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret24;havoc __utac_acc__Specification5_spec__3_#t~ret24; 168#L333true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 173#L333-1true [2019-01-01 23:53:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:53:18,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:18,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:19,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1017841037, now seen corresponding path program 1 times [2019-01-01 23:53:19,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:19,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:19,280 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:53:19,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:19,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:53:19,287 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:53:19,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:53:19,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:53:19,306 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2019-01-01 23:53:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:19,434 INFO L93 Difference]: Finished difference Result 231 states and 335 transitions. [2019-01-01 23:53:19,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:53:19,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 335 transitions. [2019-01-01 23:53:19,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 149 [2019-01-01 23:53:19,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 224 states and 327 transitions. [2019-01-01 23:53:19,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2019-01-01 23:53:19,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2019-01-01 23:53:19,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 327 transitions. [2019-01-01 23:53:19,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:53:19,459 INFO L705 BuchiCegarLoop]: Abstraction has 224 states and 327 transitions. [2019-01-01 23:53:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 327 transitions. [2019-01-01 23:53:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-01-01 23:53:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-01 23:53:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 327 transitions. [2019-01-01 23:53:19,541 INFO L728 BuchiCegarLoop]: Abstraction has 224 states and 327 transitions. [2019-01-01 23:53:19,541 INFO L608 BuchiCegarLoop]: Abstraction has 224 states and 327 transitions. [2019-01-01 23:53:19,541 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:53:19,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 327 transitions. [2019-01-01 23:53:19,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 149 [2019-01-01 23:53:19,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:19,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:19,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:19,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:19,555 INFO L794 eck$LassoCheckResult]: Stem: 602#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(13);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(110, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(102, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(102, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 3 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string12.base, #t~string12.offset, 1);call write~init~int(80, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(117, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(109, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(112, #t~string12.base, 4 + #t~string12.offset, 1);call write~init~int(58, #t~string12.base, 5 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 6 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string18.base, #t~string18.offset, 1);call write~init~int(32, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string20.base, #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 1 + #t~string20.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);~cleanupTimeShifts~0 := 4; 494#L-1 havoc main_#res;havoc main_#t~ret75, main_~retValue_acc~11, main_~tmp~11;havoc main_~retValue_acc~11;havoc main_~tmp~11; 495#L1025 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 571#L1033 main_#t~ret75 := valid_product_#res;main_~tmp~11 := main_#t~ret75;havoc main_#t~ret75; 572#L980 assume 0 != main_~tmp~11; 590#L953 ~switchedOnBeforeTS~0 := 0; 565#L312 havoc test_#t~nondet26, test_#t~nondet27, test_#t~nondet28, test_#t~nondet29, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 566#L333-1 [2019-01-01 23:53:19,555 INFO L796 eck$LassoCheckResult]: Loop: 566#L333-1 assume !false; 591#L369 assume test_~splverifierCounter~0 < 4; 592#L370 test_~tmp~7 := test_#t~nondet26;havoc test_#t~nondet26; 573#L378 assume !(0 != test_~tmp~7); 562#L378-1 test_~tmp___0~3 := test_#t~nondet27;havoc test_#t~nondet27; 563#L388 assume !(0 != test_~tmp___0~3); 662#L388-1 test_~tmp___2~0 := test_#t~nondet28;havoc test_#t~nondet28; 645#L398 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 496#L406-2 havoc __utac_acc__Specification5_spec__2_#t~ret23;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 497#L217 __utac_acc__Specification5_spec__2_#t~ret23 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret23;havoc __utac_acc__Specification5_spec__2_#t~ret23; 674#L322 assume !(0 != ~pumpRunning~0); 509#L63 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret2, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 546#L147 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret1, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 547#L121-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 614#L95-3 assume !(0 == ~pumpRunning~0); 533#L70 havoc __utac_acc__Specification5_spec__3_#t~ret24, __utac_acc__Specification5_spec__3_#t~ret25, __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~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 534#L866 __utac_acc__Specification5_spec__3_#t~ret24 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret24;havoc __utac_acc__Specification5_spec__3_#t~ret24; 646#L333 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 566#L333-1 [2019-01-01 23:53:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:53:19,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:19,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:19,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 901397577, now seen corresponding path program 1 times [2019-01-01 23:53:19,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:19,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:19,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:19,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:19,929 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:53:19,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:19,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:53:19,930 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:53:19,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:53:19,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:53:19,930 INFO L87 Difference]: Start difference. First operand 224 states and 327 transitions. cyclomatic complexity: 105 Second operand 3 states. [2019-01-01 23:53:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:20,748 INFO L93 Difference]: Finished difference Result 228 states and 314 transitions. [2019-01-01 23:53:20,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:53:20,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 228 states and 314 transitions. [2019-01-01 23:53:20,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 156 [2019-01-01 23:53:20,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 228 states to 228 states and 314 transitions. [2019-01-01 23:53:20,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 228 [2019-01-01 23:53:20,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 228 [2019-01-01 23:53:20,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 228 states and 314 transitions. [2019-01-01 23:53:20,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:53:20,759 INFO L705 BuchiCegarLoop]: Abstraction has 228 states and 314 transitions. [2019-01-01 23:53:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states and 314 transitions. [2019-01-01 23:53:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-01-01 23:53:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-01-01 23:53:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2019-01-01 23:53:20,773 INFO L728 BuchiCegarLoop]: Abstraction has 228 states and 314 transitions. [2019-01-01 23:53:20,773 INFO L608 BuchiCegarLoop]: Abstraction has 228 states and 314 transitions. [2019-01-01 23:53:20,773 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:53:20,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states and 314 transitions. [2019-01-01 23:53:20,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 156 [2019-01-01 23:53:20,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:20,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:20,777 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:20,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:20,777 INFO L794 eck$LassoCheckResult]: Stem: 1095#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(13);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(110, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(102, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(102, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 3 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string12.base, #t~string12.offset, 1);call write~init~int(80, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(117, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(109, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(112, #t~string12.base, 4 + #t~string12.offset, 1);call write~init~int(58, #t~string12.base, 5 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 6 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string18.base, #t~string18.offset, 1);call write~init~int(32, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string20.base, #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 1 + #t~string20.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);~cleanupTimeShifts~0 := 4; 969#L-1 havoc main_#res;havoc main_#t~ret75, main_~retValue_acc~11, main_~tmp~11;havoc main_~retValue_acc~11;havoc main_~tmp~11; 970#L1025 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 1029#L1033 main_#t~ret75 := valid_product_#res;main_~tmp~11 := main_#t~ret75;havoc main_#t~ret75; 1033#L980 assume 0 != main_~tmp~11; 1035#L953 ~switchedOnBeforeTS~0 := 0; 1028#L312 havoc test_#t~nondet26, test_#t~nondet27, test_#t~nondet28, test_#t~nondet29, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1017#L333-1 [2019-01-01 23:53:20,778 INFO L796 eck$LassoCheckResult]: Loop: 1017#L333-1 assume !false; 1067#L369 assume test_~splverifierCounter~0 < 4; 1068#L370 test_~tmp~7 := test_#t~nondet26;havoc test_#t~nondet26; 1155#L378 assume !(0 != test_~tmp~7); 1153#L378-1 test_~tmp___0~3 := test_#t~nondet27;havoc test_#t~nondet27; 1152#L388 assume !(0 != test_~tmp___0~3); 1150#L388-1 test_~tmp___2~0 := test_#t~nondet28;havoc test_#t~nondet28; 936#L398 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 938#L406-2 havoc __utac_acc__Specification5_spec__2_#t~ret23;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 971#L217 __utac_acc__Specification5_spec__2_#t~ret23 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret23;havoc __utac_acc__Specification5_spec__2_#t~ret23; 1077#L322 assume !(0 != ~pumpRunning~0); 1078#L63 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret2, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 1008#L147 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret1, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 1009#L121-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 954#L95-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret21, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~9;havoc isHighWaterSensorDry_~retValue_acc~9; 955#L874-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~9 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~9; 983#L879-3 isHighWaterLevel_#t~ret21 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret21;havoc isHighWaterLevel_#t~ret21; 1030#L266-9 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~0 := 0; 1115#L266-11 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 1108#L272-3 processEnvironment__wrappee__highWaterSensor_#t~ret0 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret0;havoc processEnvironment__wrappee__highWaterSensor_#t~ret0; 1096#L99-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 950#L70 havoc __utac_acc__Specification5_spec__3_#t~ret24, __utac_acc__Specification5_spec__3_#t~ret25, __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~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 947#L866 __utac_acc__Specification5_spec__3_#t~ret24 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret24;havoc __utac_acc__Specification5_spec__3_#t~ret24; 948#L333 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 1017#L333-1 [2019-01-01 23:53:20,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:20,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:53:20,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:20,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:20,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -9342763, now seen corresponding path program 1 times [2019-01-01 23:53:21,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:21,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:21,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:21,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:21,176 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2019-01-01 23:53:21,199 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:53:21,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:21,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:53:21,201 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:53:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:53:21,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:53:21,202 INFO L87 Difference]: Start difference. First operand 228 states and 314 transitions. cyclomatic complexity: 88 Second operand 5 states. [2019-01-01 23:53:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:22,824 INFO L93 Difference]: Finished difference Result 1078 states and 1497 transitions. [2019-01-01 23:53:22,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:53:22,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1078 states and 1497 transitions. [2019-01-01 23:53:22,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 733 [2019-01-01 23:53:22,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1078 states to 1078 states and 1497 transitions. [2019-01-01 23:53:22,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1078 [2019-01-01 23:53:22,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1078 [2019-01-01 23:53:22,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1078 states and 1497 transitions. [2019-01-01 23:53:22,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:53:22,851 INFO L705 BuchiCegarLoop]: Abstraction has 1078 states and 1497 transitions. [2019-01-01 23:53:22,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states and 1497 transitions. [2019-01-01 23:53:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 446. [2019-01-01 23:53:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-01 23:53:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 609 transitions. [2019-01-01 23:53:22,898 INFO L728 BuchiCegarLoop]: Abstraction has 446 states and 609 transitions. [2019-01-01 23:53:22,898 INFO L608 BuchiCegarLoop]: Abstraction has 446 states and 609 transitions. [2019-01-01 23:53:22,898 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:53:22,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 446 states and 609 transitions. [2019-01-01 23:53:22,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 310 [2019-01-01 23:53:22,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:22,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:22,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:22,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:22,914 INFO L794 eck$LassoCheckResult]: Stem: 2438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(13);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(110, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(102, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(102, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 3 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string12.base, #t~string12.offset, 1);call write~init~int(80, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(117, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(109, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(112, #t~string12.base, 4 + #t~string12.offset, 1);call write~init~int(58, #t~string12.base, 5 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 6 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string18.base, #t~string18.offset, 1);call write~init~int(32, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string20.base, #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 1 + #t~string20.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);~cleanupTimeShifts~0 := 4; 2296#L-1 havoc main_#res;havoc main_#t~ret75, main_~retValue_acc~11, main_~tmp~11;havoc main_~retValue_acc~11;havoc main_~tmp~11; 2297#L1025 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 2365#L1033 main_#t~ret75 := valid_product_#res;main_~tmp~11 := main_#t~ret75;havoc main_#t~ret75; 2369#L980 assume 0 != main_~tmp~11; 2372#L953 ~switchedOnBeforeTS~0 := 0; 2363#L312 havoc test_#t~nondet26, test_#t~nondet27, test_#t~nondet28, test_#t~nondet29, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2364#L333-1 [2019-01-01 23:53:22,914 INFO L796 eck$LassoCheckResult]: Loop: 2364#L333-1 assume !false; 2639#L369 assume test_~splverifierCounter~0 < 4; 2640#L370 test_~tmp~7 := test_#t~nondet26;havoc test_#t~nondet26; 2676#L378 assume !(0 != test_~tmp~7); 2673#L378-1 test_~tmp___0~3 := test_#t~nondet27;havoc test_#t~nondet27; 2672#L388 assume !(0 != test_~tmp___0~3); 2670#L388-1 test_~tmp___2~0 := test_#t~nondet28;havoc test_#t~nondet28; 2669#L398 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2667#L406-2 havoc __utac_acc__Specification5_spec__2_#t~ret23;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 2666#L217 __utac_acc__Specification5_spec__2_#t~ret23 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret23;havoc __utac_acc__Specification5_spec__2_#t~ret23; 2665#L322 assume !(0 != ~pumpRunning~0); 2664#L63 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret2, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 2533#L147 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret1, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 2530#L121-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 2528#L95-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret21, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~9;havoc isHighWaterSensorDry_~retValue_acc~9; 2526#L874-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~9 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~9; 2313#L879-3 isHighWaterLevel_#t~ret21 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret21;havoc isHighWaterLevel_#t~ret21; 2523#L266-9 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~0 := 0; 2521#L266-11 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 2519#L272-3 processEnvironment__wrappee__highWaterSensor_#t~ret0 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret0;havoc processEnvironment__wrappee__highWaterSensor_#t~ret0; 2517#L99-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 2277#L70 havoc __utac_acc__Specification5_spec__3_#t~ret24, __utac_acc__Specification5_spec__3_#t~ret25, __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~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 2647#L866 __utac_acc__Specification5_spec__3_#t~ret24 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret24;havoc __utac_acc__Specification5_spec__3_#t~ret24; 2646#L333 assume 2 != __utac_acc__Specification5_spec__3_~tmp~6;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 2645#L217-1 __utac_acc__Specification5_spec__3_#t~ret25 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret25;havoc __utac_acc__Specification5_spec__3_#t~ret25; 2644#L337 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 2364#L333-1 [2019-01-01 23:53:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:22,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-01 23:53:22,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:22,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:22,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:22,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:22,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash -388467952, now seen corresponding path program 1 times [2019-01-01 23:53:23,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:23,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:23,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:23,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1940287702, now seen corresponding path program 1 times [2019-01-01 23:53:23,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:23,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:23,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:23,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:23,640 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-01-01 23:53:23,781 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 23:53:48,486 WARN L181 SmtUtils]: Spent 24.69 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:54:03,714 WARN L181 SmtUtils]: Spent 15.22 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:54:03,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:54:03 BoogieIcfgContainer [2019-01-01 23:54:03,819 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:54:03,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:54:03,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:54:03,820 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:54:03,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:18" (3/4) ... [2019-01-01 23:54:03,825 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:54:03,935 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:54:03,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:54:03,936 INFO L168 Benchmark]: Toolchain (without parser) took 48731.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.7 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -338.9 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:03,937 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:03,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:03,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.24 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:54:03,938 INFO L168 Benchmark]: Boogie Preprocessor took 104.10 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:54:03,941 INFO L168 Benchmark]: RCFGBuilder took 1950.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.5 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:03,941 INFO L168 Benchmark]: BuchiAutomizer took 45624.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -277.1 MB). Peak memory consumption was 393.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:03,942 INFO L168 Benchmark]: Witness Printer took 115.55 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:03,953 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 782.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 149.24 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 104.10 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 1950.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.5 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 45624.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -277.1 MB). Peak memory consumption was 393.3 MB. Max. memory is 11.5 GB. * Witness Printer took 115.55 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 446 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 42.5s. Construction of modules took 1.9s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 632 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 446 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1027 SDtfs, 1807 SDslu, 1326 SDs, 0 SdLazy, 232 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 368]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=4770} State at position 1 is {NULL=0, NULL=-24, NULL=4770, NULL=0, retValue_acc=1, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5225093d=0, NULL=0, retValue_acc=0, tmp=0, NULL=-6, tmp___1=0, NULL=0, NULL=-11, cleanupTimeShifts=4, NULL=-3, tmp=1, waterLevel=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@590d91b3=0, NULL=-18, NULL=0, NULL=0, NULL=-17, \result=1, retValue_acc=1, head=0, pumpRunning=0, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c82ddfe=0, NULL=-21, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b1e0f84=68, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1df3a4df=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@611b195a=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@113ab3f2=0, NULL=-4, NULL=0, tmp=1, retValue_acc=1, NULL=0, tmp___0=0, NULL=-9, tmp=0, head=0, tmp=0, NULL=-20, NULL=0, NULL=0, NULL=-1, NULL=-2, tmp=1, tmp___0=0, NULL=0, NULL=0, tmp=0, switchedOnBeforeTS=0, NULL=-13, \result=0, NULL=-19, NULL=0, systemActive=1, \result=1, NULL=0, NULL=-5, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, NULL=-10, tmp___0=0, NULL=-12, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32a8354e=0, NULL=-15, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64c8be88=0, NULL=-22, NULL=0, NULL=0, NULL=0, NULL=-23, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@672fe03f=0, tmp___2=68, splverifierCounter=0, NULL=0, NULL=-8, NULL=4769, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f964da2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43ddcaf7=0, retValue_acc=0, NULL=0, NULL=-7, NULL=0, NULL=-14} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L51] int pumpRunning = 0; [L52] int systemActive = 1; [L306] int switchedOnBeforeTS ; [L594] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L791] int waterLevel = 1; [L792] int methaneLevelCritical = 0; [L894] int cleanupTimeShifts = 4; [L971] int retValue_acc ; [L972] int tmp ; [L1029] int retValue_acc ; [L1032] retValue_acc = 1 [L1033] return (retValue_acc); [L978] tmp = valid_product() [L980] COND TRUE \read(tmp) [L311] switchedOnBeforeTS = 0 [L359] int splverifierCounter ; [L360] int tmp ; [L361] int tmp___0 ; [L362] int tmp___1 ; [L363] int tmp___2 ; [L366] splverifierCounter = 0 Loop: [L368] COND TRUE 1 [L370] COND TRUE splverifierCounter < 4 [L376] tmp = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp)) [L386] tmp___0 = __VERIFIER_nondet_int() [L388] COND FALSE !(\read(tmp___0)) [L396] tmp___2 = __VERIFIER_nondet_int() [L398] COND TRUE \read(tmp___2) [L299] systemActive = 1 [L213] int retValue_acc ; [L216] retValue_acc = pumpRunning [L217] return (retValue_acc); [L320] switchedOnBeforeTS = isPumpRunning() [L63] COND FALSE !(\read(pumpRunning)) [L70] COND TRUE \read(systemActive) [L144] int tmp ; [L147] COND FALSE !(\read(pumpRunning)) [L118] int tmp ; [L121] COND FALSE !(\read(pumpRunning)) [L92] int tmp ; [L95] COND TRUE ! pumpRunning [L258] int retValue_acc ; [L259] int tmp ; [L260] int tmp___0 ; [L871] int retValue_acc ; [L874] COND TRUE waterLevel < 2 [L875] retValue_acc = 1 [L876] return (retValue_acc); [L264] tmp = isHighWaterSensorDry() [L266] COND TRUE \read(tmp) [L267] tmp___0 = 0 [L271] retValue_acc = tmp___0 [L272] return (retValue_acc); [L97] tmp = isHighWaterLevel() [L99] COND FALSE !(\read(tmp)) [L326] int tmp ; [L327] int tmp___0 ; [L862] int retValue_acc ; [L865] retValue_acc = waterLevel [L866] return (retValue_acc); [L331] tmp = getWaterLevel() [L333] COND TRUE tmp != 2 [L213] int retValue_acc ; [L216] retValue_acc = pumpRunning [L217] return (retValue_acc); [L335] tmp___0 = isPumpRunning() [L337] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...