./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product33_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product33_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 819c3ebf0e51053d89fb24b2dea5d171f2fed0d0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:30:48,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:30:48,900 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:30:48,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:30:48,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:30:48,923 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:30:48,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:30:48,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:30:48,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:30:48,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:30:48,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:30:48,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:30:48,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:30:48,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:30:48,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:30:48,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:30:48,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:30:48,936 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:30:48,938 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:30:48,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:30:48,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:30:48,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:30:48,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:30:48,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:30:48,945 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:30:48,946 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:30:48,947 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:30:48,948 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:30:48,949 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:30:48,950 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:30:48,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:30:48,951 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:30:48,952 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:30:48,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:30:48,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:30:48,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:30:48,954 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:30:48,971 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:30:48,971 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:30:48,973 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:30:48,973 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:30:48,973 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:30:48,973 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:30:48,973 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:30:48,973 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:30:48,974 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:30:48,974 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:30:48,974 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:30:48,974 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:30:48,974 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:30:48,974 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:30:48,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:30:48,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:30:48,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:30:48,975 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:30:48,975 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:30:48,975 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:30:48,976 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:30:48,976 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:30:48,976 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:30:48,976 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:30:48,976 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:30:48,977 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:30:48,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:30:48,977 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:30:48,977 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:30:48,977 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:30:48,977 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:30:48,978 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:30:48,979 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 -> 819c3ebf0e51053d89fb24b2dea5d171f2fed0d0 [2019-01-14 04:30:49,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:30:49,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:30:49,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:30:49,029 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:30:49,029 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:30:49,030 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product33_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:49,086 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e6bc60d/ca6555cb9cf2479b923de986f9e2805c/FLAG8c99086b7 [2019-01-14 04:30:49,583 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:30:49,584 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product33_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:49,604 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e6bc60d/ca6555cb9cf2479b923de986f9e2805c/FLAG8c99086b7 [2019-01-14 04:30:49,920 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04e6bc60d/ca6555cb9cf2479b923de986f9e2805c [2019-01-14 04:30:49,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:30:49,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:30:49,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:30:49,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:30:49,932 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:30:49,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:30:49" (1/1) ... [2019-01-14 04:30:49,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b067cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:49, skipping insertion in model container [2019-01-14 04:30:49,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:30:49" (1/1) ... [2019-01-14 04:30:49,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:30:50,013 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:30:50,439 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:30:50,454 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:30:50,615 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:30:50,650 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:30:50,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50 WrapperNode [2019-01-14 04:30:50,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:30:50,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:30:50,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:30:50,652 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:30:50,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... [2019-01-14 04:30:50,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... [2019-01-14 04:30:50,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:30:50,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:30:50,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:30:50,723 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:30:50,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... [2019-01-14 04:30:50,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... [2019-01-14 04:30:50,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... [2019-01-14 04:30:50,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... [2019-01-14 04:30:50,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... [2019-01-14 04:30:50,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... [2019-01-14 04:30:50,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... [2019-01-14 04:30:50,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:30:50,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:30:50,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:30:50,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:30:50,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:30:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:30:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:30:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:30:50,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:30:51,965 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:30:51,965 INFO L286 CfgBuilder]: Removed 110 assue(true) statements. [2019-01-14 04:30:51,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:30:51 BoogieIcfgContainer [2019-01-14 04:30:51,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:30:51,967 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:30:51,968 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:30:51,971 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:30:51,972 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:30:51,972 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:30:49" (1/3) ... [2019-01-14 04:30:51,973 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5aaa0405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:30:51, skipping insertion in model container [2019-01-14 04:30:51,973 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:30:51,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:30:50" (2/3) ... [2019-01-14 04:30:51,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5aaa0405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:30:51, skipping insertion in model container [2019-01-14 04:30:51,974 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:30:51,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:30:51" (3/3) ... [2019-01-14 04:30:51,976 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product33_true-unreach-call_false-termination.cil.c [2019-01-14 04:30:52,031 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:30:52,032 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:30:52,032 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:30:52,032 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:30:52,033 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:30:52,033 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:30:52,033 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:30:52,033 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:30:52,033 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:30:52,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states. [2019-01-14 04:30:52,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-14 04:30:52,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:52,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:52,103 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:52,103 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:52,103 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:30:52,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states. [2019-01-14 04:30:52,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-14 04:30:52,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:52,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:52,111 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:52,112 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:52,118 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(13);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string44.base, #t~string44.offset, 1);call write~init~int(110, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 2 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(102, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(102, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 3 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string48.base, #t~string48.offset, 1);call write~init~int(80, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(117, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(109, #t~string48.base, 3 + #t~string48.offset, 1);call write~init~int(112, #t~string48.base, 4 + #t~string48.offset, 1);call write~init~int(58, #t~string48.base, 5 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 6 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(110, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 2 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(102, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(102, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 3 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string54.base, #t~string54.offset, 1);call write~init~int(32, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string56.base, #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 1 + #t~string56.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1);~switchedOnBeforeTS~0 := 0; 7#L-1true havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 4#L665true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 25#L673true main_#t~ret59 := valid_product_#res;main_~tmp~6 := main_#t~ret59;havoc main_#t~ret59; 63#L762true assume 0 != main_~tmp~6; 75#L737true ~switchedOnBeforeTS~0 := 0; 50#L886true havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 30#L907-1true [2019-01-14 04:30:52,119 INFO L796 eck$LassoCheckResult]: Loop: 30#L907-1true assume !false; 39#L421true assume test_~splverifierCounter~0 < 4; 60#L422true test_~tmp~3 := test_#t~nondet35;havoc test_#t~nondet35; 69#L430true assume !(0 != test_~tmp~3); 73#L430-1true test_~tmp___0~0 := test_#t~nondet36;havoc test_#t~nondet36; 45#L440true assume !(0 != test_~tmp___0~0); 47#L440-1true test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 24#L450true assume 0 != test_~tmp___2~0; 83#L456-2true havoc __utac_acc__Specification5_spec__2_#t~ret70;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 67#L580true __utac_acc__Specification5_spec__2_#t~ret70 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret70;havoc __utac_acc__Specification5_spec__2_#t~ret70; 28#L896true assume !(0 != ~pumpRunning~0); 65#L495true assume !(0 != ~systemActive~0); 51#L502true havoc __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 56#L861true __utac_acc__Specification5_spec__3_#t~ret71 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret71;havoc __utac_acc__Specification5_spec__3_#t~ret71; 26#L907true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 30#L907-1true [2019-01-14 04:30:52,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-14 04:30:52,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:52,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:52,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:52,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:52,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:53,239 INFO L82 PathProgramCache]: Analyzing trace with hash 94350828, now seen corresponding path program 1 times [2019-01-14 04:30:53,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:53,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:53,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:53,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:53,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:53,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2028376038, now seen corresponding path program 1 times [2019-01-14 04:30:53,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:53,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:53,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:53,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:53,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:30:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:30:53,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:30:53,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:30:53,833 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 04:30:53,992 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 04:30:54,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:30:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:30:54,018 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 6 states. [2019-01-14 04:30:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:30:54,420 INFO L93 Difference]: Finished difference Result 84 states and 115 transitions. [2019-01-14 04:30:54,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:30:54,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 115 transitions. [2019-01-14 04:30:54,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:30:54,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 77 states and 108 transitions. [2019-01-14 04:30:54,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2019-01-14 04:30:54,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2019-01-14 04:30:54,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 108 transitions. [2019-01-14 04:30:54,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:30:54,448 INFO L706 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-14 04:30:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 108 transitions. [2019-01-14 04:30:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-14 04:30:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 04:30:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2019-01-14 04:30:54,487 INFO L729 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-14 04:30:54,487 INFO L609 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-14 04:30:54,487 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:30:54,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 108 transitions. [2019-01-14 04:30:54,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-14 04:30:54,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:54,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:54,493 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:54,494 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:54,494 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(13);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string44.base, #t~string44.offset, 1);call write~init~int(110, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 2 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(102, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(102, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 3 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string48.base, #t~string48.offset, 1);call write~init~int(80, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(117, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(109, #t~string48.base, 3 + #t~string48.offset, 1);call write~init~int(112, #t~string48.base, 4 + #t~string48.offset, 1);call write~init~int(58, #t~string48.base, 5 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 6 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(110, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 2 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(102, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(102, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 3 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string54.base, #t~string54.offset, 1);call write~init~int(32, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string56.base, #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 1 + #t~string56.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1);~switchedOnBeforeTS~0 := 0; 192#L-1 havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 188#L665 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 189#L673 main_#t~ret59 := valid_product_#res;main_~tmp~6 := main_#t~ret59;havoc main_#t~ret59; 222#L762 assume 0 != main_~tmp~6; 259#L737 ~switchedOnBeforeTS~0 := 0; 253#L886 havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 225#L907-1 [2019-01-14 04:30:54,494 INFO L796 eck$LassoCheckResult]: Loop: 225#L907-1 assume !false; 233#L421 assume test_~splverifierCounter~0 < 4; 245#L422 test_~tmp~3 := test_#t~nondet35;havoc test_#t~nondet35; 258#L430 assume !(0 != test_~tmp~3); 187#L430-1 test_~tmp___0~0 := test_#t~nondet36;havoc test_#t~nondet36; 251#L440 assume !(0 != test_~tmp___0~0); 244#L440-1 test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 219#L450 assume 0 != test_~tmp___2~0; 221#L456-2 havoc __utac_acc__Specification5_spec__2_#t~ret70;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 261#L580 __utac_acc__Specification5_spec__2_#t~ret70 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret70;havoc __utac_acc__Specification5_spec__2_#t~ret70; 228#L896 assume !(0 != ~pumpRunning~0); 229#L495 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret39, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 247#L527 assume !(0 == ~pumpRunning~0); 239#L502 havoc __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 252#L861 __utac_acc__Specification5_spec__3_#t~ret71 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret71;havoc __utac_acc__Specification5_spec__3_#t~ret71; 223#L907 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 225#L907-1 [2019-01-14 04:30:54,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:54,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-14 04:30:54,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:54,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:54,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:54,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:54,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1401702333, now seen corresponding path program 1 times [2019-01-14 04:30:54,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:54,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:54,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:30:54,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:30:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:30:54,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:30:54,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:30:54,939 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:30:54,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:30:54,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:30:54,940 INFO L87 Difference]: Start difference. First operand 77 states and 108 transitions. cyclomatic complexity: 33 Second operand 3 states. [2019-01-14 04:30:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:30:55,268 INFO L93 Difference]: Finished difference Result 126 states and 170 transitions. [2019-01-14 04:30:55,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:30:55,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 170 transitions. [2019-01-14 04:30:55,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 88 [2019-01-14 04:30:55,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 170 transitions. [2019-01-14 04:30:55,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2019-01-14 04:30:55,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2019-01-14 04:30:55,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 170 transitions. [2019-01-14 04:30:55,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:30:55,310 INFO L706 BuchiCegarLoop]: Abstraction has 126 states and 170 transitions. [2019-01-14 04:30:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 170 transitions. [2019-01-14 04:30:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-14 04:30:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 04:30:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 170 transitions. [2019-01-14 04:30:55,330 INFO L729 BuchiCegarLoop]: Abstraction has 126 states and 170 transitions. [2019-01-14 04:30:55,330 INFO L609 BuchiCegarLoop]: Abstraction has 126 states and 170 transitions. [2019-01-14 04:30:55,330 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:30:55,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 170 transitions. [2019-01-14 04:30:55,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 88 [2019-01-14 04:30:55,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:55,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:55,340 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:55,340 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:55,340 INFO L794 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(13);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string44.base, #t~string44.offset, 1);call write~init~int(110, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 2 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(102, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(102, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 3 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string48.base, #t~string48.offset, 1);call write~init~int(80, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(117, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(109, #t~string48.base, 3 + #t~string48.offset, 1);call write~init~int(112, #t~string48.base, 4 + #t~string48.offset, 1);call write~init~int(58, #t~string48.base, 5 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 6 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(110, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 2 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(102, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(102, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 3 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string54.base, #t~string54.offset, 1);call write~init~int(32, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string56.base, #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 1 + #t~string56.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1);~switchedOnBeforeTS~0 := 0; 401#L-1 havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 397#L665 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 398#L673 main_#t~ret59 := valid_product_#res;main_~tmp~6 := main_#t~ret59;havoc main_#t~ret59; 428#L762 assume 0 != main_~tmp~6; 472#L737 ~switchedOnBeforeTS~0 := 0; 462#L886 havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 463#L907-1 [2019-01-14 04:30:55,340 INFO L796 eck$LassoCheckResult]: Loop: 463#L907-1 assume !false; 454#L421 assume test_~splverifierCounter~0 < 4; 455#L422 test_~tmp~3 := test_#t~nondet35;havoc test_#t~nondet35; 471#L430 assume !(0 != test_~tmp~3); 396#L430-1 test_~tmp___0~0 := test_#t~nondet36;havoc test_#t~nondet36; 461#L440 assume !(0 != test_~tmp___0~0); 453#L440-1 test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 425#L450 assume 0 != test_~tmp___2~0; 427#L456-2 havoc __utac_acc__Specification5_spec__2_#t~ret70;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 474#L580 __utac_acc__Specification5_spec__2_#t~ret70 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret70;havoc __utac_acc__Specification5_spec__2_#t~ret70; 434#L896 assume !(0 != ~pumpRunning~0); 435#L495 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret39, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 457#L527 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret57, isHighWaterLevel_~retValue_acc~5, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~5;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 458#L869 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 438#L874 isHighWaterLevel_#t~ret57 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret57;havoc isHighWaterLevel_#t~ret57; 436#L629 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 409#L629-2 isHighWaterLevel_~retValue_acc~5 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~5; 410#L635 processEnvironment_#t~ret39 := isHighWaterLevel_#res;processEnvironment_~tmp~4 := processEnvironment_#t~ret39;havoc processEnvironment_#t~ret39; 444#L531 assume !(0 != processEnvironment_~tmp~4); 446#L502 havoc __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 517#L861 __utac_acc__Specification5_spec__3_#t~ret71 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret71;havoc __utac_acc__Specification5_spec__3_#t~ret71; 511#L907 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 463#L907-1 [2019-01-14 04:30:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:55,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-14 04:30:55,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:55,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:55,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:55,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:55,668 INFO L82 PathProgramCache]: Analyzing trace with hash 393719183, now seen corresponding path program 1 times [2019-01-14 04:30:55,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:55,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:55,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:55,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:30:55,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:30:55,874 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2019-01-14 04:30:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:30:56,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:30:56,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:30:56,049 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:30:56,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:30:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:30:56,050 INFO L87 Difference]: Start difference. First operand 126 states and 170 transitions. cyclomatic complexity: 46 Second operand 5 states. [2019-01-14 04:30:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:30:57,646 INFO L93 Difference]: Finished difference Result 466 states and 633 transitions. [2019-01-14 04:30:57,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:30:57,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 466 states and 633 transitions. [2019-01-14 04:30:57,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 325 [2019-01-14 04:30:57,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 466 states to 466 states and 633 transitions. [2019-01-14 04:30:57,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2019-01-14 04:30:57,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2019-01-14 04:30:57,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 466 states and 633 transitions. [2019-01-14 04:30:57,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:30:57,676 INFO L706 BuchiCegarLoop]: Abstraction has 466 states and 633 transitions. [2019-01-14 04:30:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states and 633 transitions. [2019-01-14 04:30:57,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 242. [2019-01-14 04:30:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-14 04:30:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2019-01-14 04:30:57,698 INFO L729 BuchiCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-01-14 04:30:57,698 INFO L609 BuchiCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-01-14 04:30:57,698 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:30:57,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 321 transitions. [2019-01-14 04:30:57,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 174 [2019-01-14 04:30:57,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:30:57,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:30:57,703 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:57,703 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:30:57,703 INFO L794 eck$LassoCheckResult]: Stem: 1057#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(13);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string44.base, #t~string44.offset, 1);call write~init~int(110, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 2 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(102, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(102, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 3 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string48.base, #t~string48.offset, 1);call write~init~int(80, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(117, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(109, #t~string48.base, 3 + #t~string48.offset, 1);call write~init~int(112, #t~string48.base, 4 + #t~string48.offset, 1);call write~init~int(58, #t~string48.base, 5 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 6 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(110, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 2 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(102, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(102, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 3 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string54.base, #t~string54.offset, 1);call write~init~int(32, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string56.base, #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 1 + #t~string56.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1);~switchedOnBeforeTS~0 := 0; 1012#L-1 havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 1008#L665 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 1009#L673 main_#t~ret59 := valid_product_#res;main_~tmp~6 := main_#t~ret59;havoc main_#t~ret59; 1041#L762 assume 0 != main_~tmp~6; 1093#L737 ~switchedOnBeforeTS~0 := 0; 1077#L886 havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1049#L907-1 [2019-01-14 04:30:57,703 INFO L796 eck$LassoCheckResult]: Loop: 1049#L907-1 assume !false; 1050#L421 assume test_~splverifierCounter~0 < 4; 1068#L422 test_~tmp~3 := test_#t~nondet35;havoc test_#t~nondet35; 1240#L430 assume !(0 != test_~tmp~3); 1224#L430-1 test_~tmp___0~0 := test_#t~nondet36;havoc test_#t~nondet36; 1223#L440 assume !(0 != test_~tmp___0~0); 1206#L440-1 test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 1205#L450 assume 0 != test_~tmp___2~0; 1202#L456-2 havoc __utac_acc__Specification5_spec__2_#t~ret70;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 1199#L580 __utac_acc__Specification5_spec__2_#t~ret70 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret70;havoc __utac_acc__Specification5_spec__2_#t~ret70; 1198#L896 assume !(0 != ~pumpRunning~0); 1197#L495 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret39, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 1196#L527 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret57, isHighWaterLevel_~retValue_acc~5, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~5;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 1110#L869 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 1111#L874 isHighWaterLevel_#t~ret57 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret57;havoc isHighWaterLevel_#t~ret57; 1048#L629 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 1019#L629-2 isHighWaterLevel_~retValue_acc~5 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~5; 1020#L635 processEnvironment_#t~ret39 := isHighWaterLevel_#res;processEnvironment_~tmp~4 := processEnvironment_#t~ret39;havoc processEnvironment_#t~ret39; 1058#L531 assume !(0 != processEnvironment_~tmp~4); 1060#L502 havoc __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 1078#L861 __utac_acc__Specification5_spec__3_#t~ret71 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret71;havoc __utac_acc__Specification5_spec__3_#t~ret71; 1130#L907 assume 2 != __utac_acc__Specification5_spec__3_~tmp~7;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 1131#L580-1 __utac_acc__Specification5_spec__3_#t~ret72 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 1072#L911 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 1049#L907-1 [2019-01-14 04:30:57,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-14 04:30:57,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:57,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:57,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash 406998826, now seen corresponding path program 1 times [2019-01-14 04:30:58,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:58,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:58,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:30:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:58,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:30:58,101 INFO L82 PathProgramCache]: Analyzing trace with hash 266405488, now seen corresponding path program 1 times [2019-01-14 04:30:58,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:30:58,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:30:58,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:58,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:30:58,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:30:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:30:59,471 WARN L181 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-14 04:30:59,595 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 04:31:22,992 WARN L181 SmtUtils]: Spent 23.39 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-14 04:31:36,579 WARN L181 SmtUtils]: Spent 13.58 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-14 04:31:36,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:31:36 BoogieIcfgContainer [2019-01-14 04:31:36,675 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:31:36,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:31:36,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:31:36,676 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:31:36,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:30:51" (3/4) ... [2019-01-14 04:31:36,681 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:31:36,790 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:31:36,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:31:36,791 INFO L168 Benchmark]: Toolchain (without parser) took 46865.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -213.7 MB). Peak memory consumption was 129.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:36,792 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-14 04:31:36,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:36,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:36,793 INFO L168 Benchmark]: Boogie Preprocessor took 42.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:31:36,796 INFO L168 Benchmark]: RCFGBuilder took 1201.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:36,797 INFO L168 Benchmark]: BuchiAutomizer took 44707.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.2 MB). Peak memory consumption was 397.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:36,798 INFO L168 Benchmark]: Witness Printer took 114.72 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:31:36,810 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 723.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.44 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 1201.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 44707.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.2 MB). Peak memory consumption was 397.2 MB. Max. memory is 11.5 GB. * Witness Printer took 114.72 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 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 6 locations. The remainder module has 242 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 41.9s. Construction of modules took 1.6s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 224 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 242 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 387 SDtfs, 971 SDslu, 497 SDs, 0 SdLazy, 131 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 420]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, NULL=0, NULL=0, retValue_acc=1, NULL=0, NULL=-18, NULL=0, NULL=0, NULL=-10, retValue_acc=0, NULL=0, NULL=-19, methaneLevelCritical=0, tmp=1, tmp___0=0, retValue_acc=0, tmp=0, NULL=0, NULL=0, NULL=0, tmp___1=0, NULL=-9, NULL=-13, NULL=-5, NULL=-11, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-8, NULL=-12, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40b8f1f2=0, NULL=-23, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b7fcc19=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a63a999=61, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d94de86=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d981a64=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45be15dc=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-25, \result=1, NULL=0, NULL=0, \result=0, NULL=-15, NULL=0, tmp___0=0, NULL=0, NULL=0, NULL=0, \result=1, NULL=-6, head=0, pumpRunning=0, tmp___0=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b0f7eb6=0, NULL=-22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1dfec128=0, NULL=-7, NULL=0, NULL=0, tmp=1, \result=1, NULL=-2, NULL=-24, NULL=-1, retValue_acc=1, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47c29e73=0, tmp___2=61, tmp=1, retValue_acc=1, NULL=-17, splverifierCounter=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2091b34e=0, head=0, tmp=0, NULL=0, NULL=-4, NULL=-3, NULL=0, NULL=-14, NULL=0, NULL=0, NULL=-21, NULL=0, NULL=-20, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L483] int pumpRunning = 0; [L484] int systemActive = 1; [L678] int cleanupTimeShifts = 4; [L786] int waterLevel = 1; [L787] int methaneLevelCritical = 0; [L880] int switchedOnBeforeTS ; [L753] int retValue_acc ; [L754] int tmp ; [L669] int retValue_acc ; [L672] retValue_acc = 1 [L673] return (retValue_acc); [L760] tmp = valid_product() [L762] COND TRUE \read(tmp) [L885] switchedOnBeforeTS = 0 [L411] int splverifierCounter ; [L412] int tmp ; [L413] int tmp___0 ; [L414] int tmp___1 ; [L415] int tmp___2 ; [L418] splverifierCounter = 0 Loop: [L420] COND TRUE 1 [L422] COND TRUE splverifierCounter < 4 [L428] tmp = __VERIFIER_nondet_int() [L430] COND FALSE !(\read(tmp)) [L438] tmp___0 = __VERIFIER_nondet_int() [L440] COND FALSE !(\read(tmp___0)) [L448] tmp___2 = __VERIFIER_nondet_int() [L450] COND TRUE \read(tmp___2) [L576] int retValue_acc ; [L579] retValue_acc = pumpRunning [L580] return (retValue_acc); [L894] switchedOnBeforeTS = isPumpRunning() [L495] COND FALSE !(\read(pumpRunning)) [L502] COND TRUE \read(systemActive) [L524] int tmp ; [L527] COND TRUE ! pumpRunning [L621] int retValue_acc ; [L622] int tmp ; [L623] int tmp___0 ; [L866] int retValue_acc ; [L869] COND TRUE waterLevel < 2 [L870] retValue_acc = 1 [L871] return (retValue_acc); [L627] tmp = isHighWaterSensorDry() [L629] COND TRUE \read(tmp) [L630] tmp___0 = 0 [L634] retValue_acc = tmp___0 [L635] return (retValue_acc); [L529] tmp = isHighWaterLevel() [L531] COND FALSE !(\read(tmp)) [L900] int tmp ; [L901] int tmp___0 ; [L857] int retValue_acc ; [L860] retValue_acc = waterLevel [L861] return (retValue_acc); [L905] tmp = getWaterLevel() [L907] COND TRUE tmp != 2 [L576] int retValue_acc ; [L579] retValue_acc = pumpRunning [L580] return (retValue_acc); [L909] tmp___0 = isPumpRunning() [L911] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...