./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product38_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_product38_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 023bd19a3cee0a73a15679923c85e228e629b6a0 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:51:29,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:51:29,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:51:29,827 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:51:29,827 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:51:29,828 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:51:29,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:51:29,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:51:29,833 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:51:29,834 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:51:29,835 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:51:29,836 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:51:29,837 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:51:29,838 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:51:29,839 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:51:29,840 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:51:29,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:51:29,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:51:29,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:51:29,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:51:29,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:51:29,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:51:29,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:51:29,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:51:29,854 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:51:29,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:51:29,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:51:29,857 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:51:29,858 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:51:29,859 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:51:29,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:51:29,860 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:51:29,860 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:51:29,861 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:51:29,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:51:29,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:51:29,863 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:51:29,892 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:51:29,892 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:51:29,894 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:51:29,894 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:51:29,894 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:51:29,894 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:51:29,894 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:51:29,895 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:51:29,896 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:51:29,896 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:51:29,896 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:51:29,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:51:29,896 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:51:29,896 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:51:29,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:51:29,898 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:51:29,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:51:29,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:51:29,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:51:29,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:51:29,899 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:51:29,899 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:51:29,899 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:51:29,899 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:51:29,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:51:29,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:51:29,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:51:29,901 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:51:29,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:51:29,901 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:51:29,902 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:51:29,903 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:51:29,903 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 -> 023bd19a3cee0a73a15679923c85e228e629b6a0 [2019-01-01 23:51:29,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:51:29,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:51:29,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:51:29,981 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:51:29,982 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:51:29,983 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product38_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:30,052 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc8c429d/9b6ee8c279d348899c599a46af5418b6/FLAG68f3a2c9b [2019-01-01 23:51:30,583 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:51:30,583 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product38_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:30,598 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc8c429d/9b6ee8c279d348899c599a46af5418b6/FLAG68f3a2c9b [2019-01-01 23:51:30,891 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc8c429d/9b6ee8c279d348899c599a46af5418b6 [2019-01-01 23:51:30,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:51:30,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:51:30,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:51:30,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:51:30,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:51:30,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:51:30" (1/1) ... [2019-01-01 23:51:30,907 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:51:30, skipping insertion in model container [2019-01-01 23:51:30,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:51:30" (1/1) ... [2019-01-01 23:51:30,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:51:30,967 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:51:31,335 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:51:31,359 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:51:31,446 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:51:31,571 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:51:31,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31 WrapperNode [2019-01-01 23:51:31,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:51:31,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:51:31,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:51:31,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:51:31,583 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:51:31" (1/1) ... [2019-01-01 23:51:31,602 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:51:31" (1/1) ... [2019-01-01 23:51:31,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:51:31,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:51:31,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:51:31,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:51:31,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31" (1/1) ... [2019-01-01 23:51:31,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31" (1/1) ... [2019-01-01 23:51:31,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31" (1/1) ... [2019-01-01 23:51:31,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31" (1/1) ... [2019-01-01 23:51:31,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31" (1/1) ... [2019-01-01 23:51:31,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31" (1/1) ... [2019-01-01 23:51:31,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31" (1/1) ... [2019-01-01 23:51:31,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:51:31,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:51:31,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:51:31,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:51:31,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31" (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:51:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:51:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:51:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:51:31,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:51:33,269 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:51:33,270 INFO L280 CfgBuilder]: Removed 172 assue(true) statements. [2019-01-01 23:51:33,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:33 BoogieIcfgContainer [2019-01-01 23:51:33,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:51:33,272 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:51:33,272 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:51:33,277 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:51:33,278 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:33,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:51:30" (1/3) ... [2019-01-01 23:51:33,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24a917ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:51:33, skipping insertion in model container [2019-01-01 23:51:33,281 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:33,281 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:51:31" (2/3) ... [2019-01-01 23:51:33,281 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24a917ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:51:33, skipping insertion in model container [2019-01-01 23:51:33,281 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:51:33,283 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:33" (3/3) ... [2019-01-01 23:51:33,285 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product38_true-unreach-call_false-termination.cil.c [2019-01-01 23:51:33,345 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:51:33,345 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:51:33,346 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:51:33,346 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:51:33,346 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:51:33,346 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:51:33,346 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:51:33,346 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:51:33,347 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:51:33,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states. [2019-01-01 23:51:33,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-01-01 23:51:33,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:33,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:33,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:33,411 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:51:33,411 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:51:33,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states. [2019-01-01 23:51:33,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-01-01 23:51:33,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:33,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:33,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:33,422 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:51:33,429 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(13);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(110, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string59.base, #t~string59.offset, 1);call write~init~int(80, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(117, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(109, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(112, #t~string59.base, 4 + #t~string59.offset, 1);call write~init~int(58, #t~string59.base, 5 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 6 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string65.base, #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1); 4#L-1true havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 65#L884true havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 80#L892true main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 71#L141true assume 0 != main_~tmp~0; 107#L112true ~switchedOnBeforeTS~0 := 0; 72#L163true havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 103#L184-1true [2019-01-01 23:51:33,430 INFO L796 eck$LassoCheckResult]: Loop: 103#L184-1true assume !false; 91#L908true assume test_~splverifierCounter~0 < 4; 56#L909true test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 78#L917true assume !(0 != test_~tmp~8); 66#L917-1true test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 112#L927true assume !(0 != test_~tmp___0~2); 95#L927-1true test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 21#L937true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 50#L945-2true havoc __utac_acc__Specification5_spec__2_#t~ret1;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~8;havoc isPumpRunning_~retValue_acc~8;isPumpRunning_~retValue_acc~8 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~8; 32#L794true __utac_acc__Specification5_spec__2_#t~ret1 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret1;havoc __utac_acc__Specification5_spec__2_#t~ret1; 104#L173true assume !(0 != ~pumpRunning~0); 77#L683true assume !(0 != ~systemActive~0); 115#L690true havoc __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_#t~ret3, __utac_acc__Specification5_spec__3_~tmp~1, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 17#L651true __utac_acc__Specification5_spec__3_#t~ret2 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~1 := __utac_acc__Specification5_spec__3_#t~ret2;havoc __utac_acc__Specification5_spec__3_#t~ret2; 106#L184true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~1); 103#L184-1true [2019-01-01 23:51:33,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:33,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:51:33,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:33,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:33,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:33,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:33,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1012977165, now seen corresponding path program 1 times [2019-01-01 23:51:34,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:34,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:34,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:34,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:34,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:34,390 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:51:34,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:34,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:51:34,399 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:34,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:51:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:51:34,425 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2019-01-01 23:51:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:34,596 INFO L93 Difference]: Finished difference Result 117 states and 167 transitions. [2019-01-01 23:51:34,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:51:34,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 167 transitions. [2019-01-01 23:51:34,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2019-01-01 23:51:34,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 110 states and 159 transitions. [2019-01-01 23:51:34,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2019-01-01 23:51:34,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2019-01-01 23:51:34,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 159 transitions. [2019-01-01 23:51:34,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:34,627 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 159 transitions. [2019-01-01 23:51:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 159 transitions. [2019-01-01 23:51:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-01 23:51:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 23:51:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2019-01-01 23:51:34,669 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 159 transitions. [2019-01-01 23:51:34,669 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 159 transitions. [2019-01-01 23:51:34,669 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:51:34,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 159 transitions. [2019-01-01 23:51:34,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2019-01-01 23:51:34,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:34,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:34,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:34,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:34,675 INFO L794 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(13);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(110, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string59.base, #t~string59.offset, 1);call write~init~int(80, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(117, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(109, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(112, #t~string59.base, 4 + #t~string59.offset, 1);call write~init~int(58, #t~string59.base, 5 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 6 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string65.base, #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1); 245#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 246#L884 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 329#L892 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 336#L141 assume 0 != main_~tmp~0; 337#L112 ~switchedOnBeforeTS~0 := 0; 338#L163 havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 307#L184-1 [2019-01-01 23:51:34,675 INFO L796 eck$LassoCheckResult]: Loop: 307#L184-1 assume !false; 349#L908 assume test_~splverifierCounter~0 < 4; 325#L909 test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 326#L917 assume !(0 != test_~tmp~8); 330#L917-1 test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 331#L927 assume !(0 != test_~tmp___0~2); 333#L927-1 test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 276#L937 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 278#L945-2 havoc __utac_acc__Specification5_spec__2_#t~ret1;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~8;havoc isPumpRunning_~retValue_acc~8;isPumpRunning_~retValue_acc~8 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~8; 296#L794 __utac_acc__Specification5_spec__2_#t~ret1 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret1;havoc __utac_acc__Specification5_spec__2_#t~ret1; 297#L173 assume !(0 != ~pumpRunning~0); 291#L683 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 341#L741 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret49, processEnvironment__wrappee__highWaterSensor_~tmp~5;havoc processEnvironment__wrappee__highWaterSensor_~tmp~5; 342#L715-1 assume !(0 == ~pumpRunning~0); 319#L690 havoc __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_#t~ret3, __utac_acc__Specification5_spec__3_~tmp~1, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 268#L651 __utac_acc__Specification5_spec__3_#t~ret2 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~1 := __utac_acc__Specification5_spec__3_#t~ret2;havoc __utac_acc__Specification5_spec__3_#t~ret2; 269#L184 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~1); 307#L184-1 [2019-01-01 23:51:34,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:34,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:51:34,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:34,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:34,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:34,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:34,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:34,974 INFO L82 PathProgramCache]: Analyzing trace with hash 368159172, now seen corresponding path program 1 times [2019-01-01 23:51:34,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:34,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:34,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:34,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:34,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:35,039 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:51:35,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:35,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:51:35,040 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:35,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:51:35,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:51:35,043 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. cyclomatic complexity: 51 Second operand 3 states. [2019-01-01 23:51:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:35,548 INFO L93 Difference]: Finished difference Result 159 states and 218 transitions. [2019-01-01 23:51:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:51:35,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 218 transitions. [2019-01-01 23:51:35,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2019-01-01 23:51:35,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 218 transitions. [2019-01-01 23:51:35,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2019-01-01 23:51:35,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2019-01-01 23:51:35,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 218 transitions. [2019-01-01 23:51:35,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:35,560 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 218 transitions. [2019-01-01 23:51:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 218 transitions. [2019-01-01 23:51:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-01 23:51:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-01 23:51:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 218 transitions. [2019-01-01 23:51:35,572 INFO L728 BuchiCegarLoop]: Abstraction has 159 states and 218 transitions. [2019-01-01 23:51:35,572 INFO L608 BuchiCegarLoop]: Abstraction has 159 states and 218 transitions. [2019-01-01 23:51:35,573 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:51:35,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 218 transitions. [2019-01-01 23:51:35,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2019-01-01 23:51:35,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:35,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:35,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:35,577 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] [2019-01-01 23:51:35,578 INFO L794 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(13);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(110, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string59.base, #t~string59.offset, 1);call write~init~int(80, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(117, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(109, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(112, #t~string59.base, 4 + #t~string59.offset, 1);call write~init~int(58, #t~string59.base, 5 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 6 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string65.base, #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1); 520#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 521#L884 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 605#L892 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 613#L141 assume 0 != main_~tmp~0; 614#L112 ~switchedOnBeforeTS~0 := 0; 615#L163 havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 582#L184-1 [2019-01-01 23:51:35,578 INFO L796 eck$LassoCheckResult]: Loop: 582#L184-1 assume !false; 628#L908 assume test_~splverifierCounter~0 < 4; 599#L909 test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 600#L917 assume !(0 != test_~tmp~8); 606#L917-1 test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 607#L927 assume !(0 != test_~tmp___0~2); 610#L927-1 test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 551#L937 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 553#L945-2 havoc __utac_acc__Specification5_spec__2_#t~ret1;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~8;havoc isPumpRunning_~retValue_acc~8;isPumpRunning_~retValue_acc~8 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~8; 571#L794 __utac_acc__Specification5_spec__2_#t~ret1 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret1;havoc __utac_acc__Specification5_spec__2_#t~ret1; 572#L173 assume !(0 != ~pumpRunning~0); 622#L683 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 618#L741 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret49, processEnvironment__wrappee__highWaterSensor_~tmp~5;havoc processEnvironment__wrappee__highWaterSensor_~tmp~5; 619#L715-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret68, isHighWaterLevel_~retValue_acc~9, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~9;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 557#L659-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 558#L664-1 isHighWaterLevel_#t~ret68 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret68;havoc isHighWaterLevel_#t~ret68; 586#L843-3 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~1 := 0; 587#L843-5 isHighWaterLevel_~retValue_acc~9 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~9; 569#L849-1 processEnvironment__wrappee__highWaterSensor_#t~ret49 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~5 := processEnvironment__wrappee__highWaterSensor_#t~ret49;havoc processEnvironment__wrappee__highWaterSensor_#t~ret49; 570#L719-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~5); 594#L690 havoc __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_#t~ret3, __utac_acc__Specification5_spec__3_~tmp~1, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 543#L651 __utac_acc__Specification5_spec__3_#t~ret2 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~1 := __utac_acc__Specification5_spec__3_#t~ret2;havoc __utac_acc__Specification5_spec__3_#t~ret2; 544#L184 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~1); 582#L184-1 [2019-01-01 23:51:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:35,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:51:35,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:35,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:35,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:35,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:35,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:35,814 INFO L82 PathProgramCache]: Analyzing trace with hash 156241456, now seen corresponding path program 1 times [2019-01-01 23:51:35,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:35,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:35,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:35,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:51:35,983 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:51:35,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:51:35,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:51:35,987 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:51:35,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:51:35,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:51:35,988 INFO L87 Difference]: Start difference. First operand 159 states and 218 transitions. cyclomatic complexity: 61 Second operand 5 states. [2019-01-01 23:51:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:51:37,069 INFO L93 Difference]: Finished difference Result 437 states and 587 transitions. [2019-01-01 23:51:37,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:51:37,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 437 states and 587 transitions. [2019-01-01 23:51:37,076 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 283 [2019-01-01 23:51:37,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 437 states to 437 states and 587 transitions. [2019-01-01 23:51:37,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 437 [2019-01-01 23:51:37,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 437 [2019-01-01 23:51:37,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 437 states and 587 transitions. [2019-01-01 23:51:37,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:51:37,086 INFO L705 BuchiCegarLoop]: Abstraction has 437 states and 587 transitions. [2019-01-01 23:51:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states and 587 transitions. [2019-01-01 23:51:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 311. [2019-01-01 23:51:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-01-01 23:51:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 415 transitions. [2019-01-01 23:51:37,124 INFO L728 BuchiCegarLoop]: Abstraction has 311 states and 415 transitions. [2019-01-01 23:51:37,124 INFO L608 BuchiCegarLoop]: Abstraction has 311 states and 415 transitions. [2019-01-01 23:51:37,124 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:51:37,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 311 states and 415 transitions. [2019-01-01 23:51:37,129 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 220 [2019-01-01 23:51:37,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:51:37,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:51:37,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:51:37,135 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] [2019-01-01 23:51:37,135 INFO L794 eck$LassoCheckResult]: Stem: 1242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(13);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(110, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(102, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string59.base, #t~string59.offset, 1);call write~init~int(80, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(117, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(109, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(112, #t~string59.base, 4 + #t~string59.offset, 1);call write~init~int(58, #t~string59.base, 5 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 6 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(110, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(102, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string65.base, #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1); 1132#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 1133#L884 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 1219#L892 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 1227#L141 assume 0 != main_~tmp~0; 1228#L112 ~switchedOnBeforeTS~0 := 0; 1229#L163 havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1195#L184-1 [2019-01-01 23:51:37,135 INFO L796 eck$LassoCheckResult]: Loop: 1195#L184-1 assume !false; 1244#L908 assume test_~splverifierCounter~0 < 4; 1215#L909 test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 1216#L917 assume !(0 != test_~tmp~8); 1220#L917-1 test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 1221#L927 assume !(0 != test_~tmp___0~2); 1224#L927-1 test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 1163#L937 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1165#L945-2 havoc __utac_acc__Specification5_spec__2_#t~ret1;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~8;havoc isPumpRunning_~retValue_acc~8;isPumpRunning_~retValue_acc~8 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~8; 1183#L794 __utac_acc__Specification5_spec__2_#t~ret1 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret1;havoc __utac_acc__Specification5_spec__2_#t~ret1; 1184#L173 assume !(0 != ~pumpRunning~0); 1236#L683 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 1232#L741 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret49, processEnvironment__wrappee__highWaterSensor_~tmp~5;havoc processEnvironment__wrappee__highWaterSensor_~tmp~5; 1233#L715-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret68, isHighWaterLevel_~retValue_acc~9, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~9;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 1169#L659-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 1170#L664-1 isHighWaterLevel_#t~ret68 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret68;havoc isHighWaterLevel_#t~ret68; 1199#L843-3 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~1 := 0; 1200#L843-5 isHighWaterLevel_~retValue_acc~9 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~9; 1179#L849-1 processEnvironment__wrappee__highWaterSensor_#t~ret49 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~5 := processEnvironment__wrappee__highWaterSensor_#t~ret49;havoc processEnvironment__wrappee__highWaterSensor_#t~ret49; 1180#L719-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~5); 1207#L690 havoc __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_#t~ret3, __utac_acc__Specification5_spec__3_~tmp~1, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 1155#L651 __utac_acc__Specification5_spec__3_#t~ret2 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~1 := __utac_acc__Specification5_spec__3_#t~ret2;havoc __utac_acc__Specification5_spec__3_#t~ret2; 1156#L184 assume 2 != __utac_acc__Specification5_spec__3_~tmp~1;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~8;havoc isPumpRunning_~retValue_acc~8;isPumpRunning_~retValue_acc~8 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~8; 1138#L794-1 __utac_acc__Specification5_spec__3_#t~ret3 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret3;havoc __utac_acc__Specification5_spec__3_#t~ret3; 1139#L188 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 1195#L184-1 [2019-01-01 23:51:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:37,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-01 23:51:37,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:37,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:37,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:37,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:37,349 INFO L82 PathProgramCache]: Analyzing trace with hash -175828501, now seen corresponding path program 1 times [2019-01-01 23:51:37,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:37,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:37,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:37,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:51:37,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:37,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:51:37,364 INFO L82 PathProgramCache]: Analyzing trace with hash -239254683, now seen corresponding path program 1 times [2019-01-01 23:51:37,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:51:37,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:51:37,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:37,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:51:37,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:51:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:51:38,961 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-01-01 23:51:39,522 WARN L181 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 23:52:04,665 WARN L181 SmtUtils]: Spent 25.12 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:52:18,911 WARN L181 SmtUtils]: Spent 14.24 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:52:19,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:52:19 BoogieIcfgContainer [2019-01-01 23:52:19,003 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:52:19,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:52:19,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:52:19,003 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:52:19,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:51:33" (3/4) ... [2019-01-01 23:52:19,008 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:52:19,115 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:52:19,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:52:19,116 INFO L168 Benchmark]: Toolchain (without parser) took 48220.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 946.0 MB in the beginning and 874.0 MB in the end (delta: 72.0 MB). Peak memory consumption was 380.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:19,123 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:52:19,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:19,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:19,126 INFO L168 Benchmark]: Boogie Preprocessor took 80.82 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:52:19,126 INFO L168 Benchmark]: RCFGBuilder took 1536.44 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: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:19,127 INFO L168 Benchmark]: BuchiAutomizer took 45730.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.0 GB in the beginning and 883.5 MB in the end (delta: 163.8 MB). Peak memory consumption was 415.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:19,127 INFO L168 Benchmark]: Witness Printer took 111.84 ms. Allocated memory is still 1.3 GB. Free memory was 883.5 MB in the beginning and 874.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:52:19,137 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 674.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1536.44 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: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 45730.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.0 GB in the beginning and 883.5 MB in the end (delta: 163.8 MB). Peak memory consumption was 415.0 MB. Max. memory is 11.5 GB. * Witness Printer took 111.84 ms. Allocated memory is still 1.3 GB. Free memory was 883.5 MB in the beginning and 874.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 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 311 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 43.5s. Construction of modules took 1.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 126 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 311 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 563 SDtfs, 781 SDslu, 579 SDs, 0 SdLazy, 122 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s 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: 907]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=14395} State at position 1 is {NULL=0, NULL=-11, NULL=0, retValue_acc=0, NULL=0, NULL=14395, NULL=-9, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b32485c=0, NULL=0, NULL=0, NULL=-14, NULL=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@543de175=0, tmp___0=0, retValue_acc=1, NULL=0, NULL=-4, retValue_acc=0, NULL=0, tmp=0, tmp=1, tmp___1=0, NULL=-2, NULL=-10, cleanupTimeShifts=4, NULL=-16, switchedOnBeforeTS=0, NULL=-20, NULL=-3, NULL=-17, tmp=0, \result=0, NULL=-21, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7585137=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, \result=0, NULL=-13, NULL=0, NULL=0, NULL=0, tmp___0=0, \result=1, head=0, pumpRunning=0, tmp=1, NULL=-5, \result=0, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4eb6a11f=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-8, \result=1, NULL=14394, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d66712=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43771df3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e65b1d1=61, NULL=-15, NULL=-18, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4108905a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@796db172=0, NULL=-22, tmp=1, tmp___2=61, tmp___0=0, NULL=-1, retValue_acc=1, splverifierCounter=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2953bbe6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a5f8dac=0, NULL=-12, head=0, NULL=0, NULL=-19, NULL=0, tmp=0, NULL=-6, NULL=-7, NULL=0, NULL=0, NULL=9374, retValue_acc=0, NULL=0, NULL=-23} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L49] int cleanupTimeShifts = 4; [L157] int switchedOnBeforeTS ; [L375] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L576] int waterLevel = 1; [L577] int methaneLevelCritical = 0; [L673] int pumpRunning = 0; [L674] int systemActive = 1; [L132] int retValue_acc ; [L133] int tmp ; [L888] int retValue_acc ; [L891] retValue_acc = 1 [L892] return (retValue_acc); [L139] tmp = valid_product() [L141] COND TRUE \read(tmp) [L162] switchedOnBeforeTS = 0 [L898] int splverifierCounter ; [L899] int tmp ; [L900] int tmp___0 ; [L901] int tmp___1 ; [L902] int tmp___2 ; [L905] splverifierCounter = 0 Loop: [L907] COND TRUE 1 [L909] COND TRUE splverifierCounter < 4 [L915] tmp = __VERIFIER_nondet_int() [L917] COND FALSE !(\read(tmp)) [L925] tmp___0 = __VERIFIER_nondet_int() [L927] COND FALSE !(\read(tmp___0)) [L935] tmp___2 = __VERIFIER_nondet_int() [L937] COND TRUE \read(tmp___2) [L857] systemActive = 1 [L790] int retValue_acc ; [L793] retValue_acc = pumpRunning [L794] return (retValue_acc); [L171] switchedOnBeforeTS = isPumpRunning() [L683] COND FALSE !(\read(pumpRunning)) [L690] COND TRUE \read(systemActive) [L738] int tmp ; [L741] COND FALSE !(\read(pumpRunning)) [L712] int tmp ; [L715] COND TRUE ! pumpRunning [L835] int retValue_acc ; [L836] int tmp ; [L837] int tmp___0 ; [L656] int retValue_acc ; [L659] COND TRUE waterLevel < 2 [L660] retValue_acc = 1 [L661] return (retValue_acc); [L841] tmp = isHighWaterSensorDry() [L843] COND TRUE \read(tmp) [L844] tmp___0 = 0 [L848] retValue_acc = tmp___0 [L849] return (retValue_acc); [L717] tmp = isHighWaterLevel() [L719] COND FALSE !(\read(tmp)) [L177] int tmp ; [L178] int tmp___0 ; [L647] int retValue_acc ; [L650] retValue_acc = waterLevel [L651] return (retValue_acc); [L182] tmp = getWaterLevel() [L184] COND TRUE tmp != 2 [L790] int retValue_acc ; [L793] retValue_acc = pumpRunning [L794] return (retValue_acc); [L186] tmp___0 = isPumpRunning() [L188] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...