./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/minepump_spec4_product48.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 5f57b6f2bb2bb4fa43dac897ff23a28c21886d7b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-11-28 21:10:41,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:10:41,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:10:41,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:10:41,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:10:41,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:10:41,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:10:41,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:10:41,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:10:41,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:10:41,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:10:41,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:10:41,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:10:41,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:10:41,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:10:41,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:10:41,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:10:41,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:10:41,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:10:41,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:10:41,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:10:41,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:10:41,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:10:41,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:10:41,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:10:41,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:10:41,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:10:41,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:10:41,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:10:41,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:10:41,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:10:41,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:10:41,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:10:41,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:10:41,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:10:41,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:10:41,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:10:41,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:10:41,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:10:41,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:10:41,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:10:41,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:10:41,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:10:41,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:10:41,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:10:41,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:10:41,702 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:10:41,702 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:10:41,703 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:10:41,703 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:10:41,703 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:10:41,703 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:10:41,703 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:10:41,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:10:41,704 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:10:41,704 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:10:41,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:10:41,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:10:41,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:10:41,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:10:41,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:10:41,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:10:41,706 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:10:41,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:10:41,707 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:10:41,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:10:41,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:10:41,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:10:41,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:10:41,708 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:10:41,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:10:41,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:10:41,710 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:10:41,711 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:10:41,712 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:10:41,713 INFO L138 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 -> 5f57b6f2bb2bb4fa43dac897ff23a28c21886d7b [2019-11-28 21:10:42,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:10:42,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:10:42,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:10:42,125 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:10:42,126 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:10:42,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c [2019-11-28 21:10:42,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebf72925/08edc142f09b42a2a3fad22ed435fa8c/FLAGe0a383991 [2019-11-28 21:10:42,770 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:10:42,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c [2019-11-28 21:10:42,786 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebf72925/08edc142f09b42a2a3fad22ed435fa8c/FLAGe0a383991 [2019-11-28 21:10:43,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebf72925/08edc142f09b42a2a3fad22ed435fa8c [2019-11-28 21:10:43,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:10:43,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:10:43,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:10:43,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:10:43,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:10:43,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a49d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43, skipping insertion in model container [2019-11-28 21:10:43,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:10:43,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:10:43,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:10:43,533 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:10:43,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:10:43,676 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:10:43,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43 WrapperNode [2019-11-28 21:10:43,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:10:43,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:10:43,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:10:43,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:10:43,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:10:43,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:10:43,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:10:43,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:10:43,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (1/1) ... [2019-11-28 21:10:43,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:10:43,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:10:43,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:10:43,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:10:43,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (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-11-28 21:10:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:10:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 21:10:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:10:43,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:10:44,809 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:10:44,809 INFO L287 CfgBuilder]: Removed 198 assume(true) statements. [2019-11-28 21:10:44,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:10:44 BoogieIcfgContainer [2019-11-28 21:10:44,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:10:44,812 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:10:44,812 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:10:44,816 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:10:44,817 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:10:44,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:10:43" (1/3) ... [2019-11-28 21:10:44,819 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c2c627b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:10:44, skipping insertion in model container [2019-11-28 21:10:44,819 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:10:44,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:10:43" (2/3) ... [2019-11-28 21:10:44,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c2c627b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:10:44, skipping insertion in model container [2019-11-28 21:10:44,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:10:44,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:10:44" (3/3) ... [2019-11-28 21:10:44,822 INFO L371 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product48.cil.c [2019-11-28 21:10:44,876 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:10:44,877 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:10:44,877 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:10:44,878 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:10:44,878 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:10:44,878 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:10:44,878 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:10:44,879 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:10:44,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-11-28 21:10:44,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2019-11-28 21:10:44,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:10:44,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:10:44,970 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:10:44,971 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:10:44,971 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:10:44,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-11-28 21:10:44,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2019-11-28 21:10:44,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:10:44,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:10:44,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:10:44,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:10:44,986 INFO L794 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(110, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 3 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string49.base, #t~string49.offset, 1);call write~init~int(80, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(117, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(109, #t~string49.base, 3 + #t~string49.offset, 1);call write~init~int(112, #t~string49.base, 4 + #t~string49.offset, 1);call write~init~int(58, #t~string49.base, 5 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 6 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string55.base, #t~string55.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string57.base, #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 1 + #t~string57.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(13);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(77, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(101, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(116, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(104, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string64.base, #t~string64.offset, 1);call write~init~int(82, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(73, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(84, #t~string64.base, 3 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 4 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(75, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 16#L-1true havoc main_#res;havoc main_#t~ret37, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 37#L959true 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; 38#L967true main_#t~ret37 := valid_product_#res;main_~tmp~4 := main_#t~ret37;havoc main_#t~ret37; 81#L534true assume 0 != main_~tmp~4; 51#L507true havoc test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 11#L51-1true [2019-11-28 21:10:44,987 INFO L796 eck$LassoCheckResult]: Loop: 11#L51-1true assume !false; 39#L879true assume test_~splverifierCounter~0 < 4; 129#L880true test_~tmp~9 := test_#t~nondet69;havoc test_#t~nondet69; 5#L888true assume !(0 != test_~tmp~9); 8#L888-1true test_~tmp___0~2 := test_#t~nondet70;havoc test_#t~nondet70; 42#L898true assume !(0 != test_~tmp___0~2); 43#L898-1true test_~tmp___2~0 := test_#t~nondet71;havoc test_#t~nondet71; 102#L908true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 111#L916-1true assume !(0 != ~pumpRunning~0); 17#L563true assume !(0 != ~systemActive~0); 77#L570true havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 27#L849true __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 14#L51true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 11#L51-1true [2019-11-28 21:10:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:10:44,995 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-11-28 21:10:45,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:10:45,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127892990] [2019-11-28 21:10:45,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:10:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:45,344 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:10:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:10:45,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1669770356, now seen corresponding path program 1 times [2019-11-28 21:10:45,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:10:45,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349736112] [2019-11-28 21:10:45,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:10:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:10:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:10:45,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349736112] [2019-11-28 21:10:45,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:10:45,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:10:45,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280839113] [2019-11-28 21:10:45,418 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:10:45,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:10:45,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:10:45,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:10:45,433 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2019-11-28 21:10:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:10:45,536 INFO L93 Difference]: Finished difference Result 250 states and 360 transitions. [2019-11-28 21:10:45,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:10:45,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 250 states and 360 transitions. [2019-11-28 21:10:45,548 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 162 [2019-11-28 21:10:45,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 250 states to 236 states and 345 transitions. [2019-11-28 21:10:45,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 236 [2019-11-28 21:10:45,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2019-11-28 21:10:45,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 345 transitions. [2019-11-28 21:10:45,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:10:45,579 INFO L688 BuchiCegarLoop]: Abstraction has 236 states and 345 transitions. [2019-11-28 21:10:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 345 transitions. [2019-11-28 21:10:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-11-28 21:10:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-28 21:10:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 342 transitions. [2019-11-28 21:10:45,635 INFO L711 BuchiCegarLoop]: Abstraction has 234 states and 342 transitions. [2019-11-28 21:10:45,636 INFO L591 BuchiCegarLoop]: Abstraction has 234 states and 342 transitions. [2019-11-28 21:10:45,636 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:10:45,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 234 states and 342 transitions. [2019-11-28 21:10:45,641 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 160 [2019-11-28 21:10:45,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:10:45,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:10:45,643 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:10:45,643 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:10:45,643 INFO L794 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(110, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 3 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string49.base, #t~string49.offset, 1);call write~init~int(80, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(117, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(109, #t~string49.base, 3 + #t~string49.offset, 1);call write~init~int(112, #t~string49.base, 4 + #t~string49.offset, 1);call write~init~int(58, #t~string49.base, 5 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 6 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string55.base, #t~string55.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string57.base, #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 1 + #t~string57.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(13);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(77, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(101, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(116, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(104, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string64.base, #t~string64.offset, 1);call write~init~int(82, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(73, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(84, #t~string64.base, 3 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 4 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(75, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 419#L-1 havoc main_#res;havoc main_#t~ret37, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 420#L959 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; 446#L967 main_#t~ret37 := valid_product_#res;main_~tmp~4 := main_#t~ret37;havoc main_#t~ret37; 447#L534 assume 0 != main_~tmp~4; 463#L507 havoc test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 407#L51-1 [2019-11-28 21:10:45,644 INFO L796 eck$LassoCheckResult]: Loop: 407#L51-1 assume !false; 408#L879 assume test_~splverifierCounter~0 < 4; 537#L880 test_~tmp~9 := test_#t~nondet69;havoc test_#t~nondet69; 536#L888 assume !(0 != test_~tmp~9); 534#L888-1 test_~tmp___0~2 := test_#t~nondet70;havoc test_#t~nondet70; 533#L898 assume !(0 != test_~tmp___0~2); 531#L898-1 test_~tmp___2~0 := test_#t~nondet71;havoc test_#t~nondet71; 508#L908 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 509#L916-1 assume !(0 != ~pumpRunning~0); 421#L563 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret39, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 395#L621 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret38, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 397#L595-1 assume !(0 == ~pumpRunning~0); 569#L570 havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 568#L849 __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 414#L51 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 407#L51-1 [2019-11-28 21:10:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:10:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-11-28 21:10:45,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:10:45,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315740736] [2019-11-28 21:10:45,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:10:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:45,779 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:10:45,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:10:45,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1411824402, now seen corresponding path program 1 times [2019-11-28 21:10:45,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:10:45,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659574742] [2019-11-28 21:10:45,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:10:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:10:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:10:45,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659574742] [2019-11-28 21:10:45,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:10:45,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:10:45,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129077830] [2019-11-28 21:10:45,806 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:10:45,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:10:45,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:10:45,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:10:45,807 INFO L87 Difference]: Start difference. First operand 234 states and 342 transitions. cyclomatic complexity: 111 Second operand 3 states. [2019-11-28 21:10:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:10:45,968 INFO L93 Difference]: Finished difference Result 317 states and 442 transitions. [2019-11-28 21:10:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:10:45,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 442 transitions. [2019-11-28 21:10:45,977 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 223 [2019-11-28 21:10:45,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 317 states and 442 transitions. [2019-11-28 21:10:45,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2019-11-28 21:10:45,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2019-11-28 21:10:45,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 442 transitions. [2019-11-28 21:10:45,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:10:45,988 INFO L688 BuchiCegarLoop]: Abstraction has 317 states and 442 transitions. [2019-11-28 21:10:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 442 transitions. [2019-11-28 21:10:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2019-11-28 21:10:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-28 21:10:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 442 transitions. [2019-11-28 21:10:46,011 INFO L711 BuchiCegarLoop]: Abstraction has 317 states and 442 transitions. [2019-11-28 21:10:46,011 INFO L591 BuchiCegarLoop]: Abstraction has 317 states and 442 transitions. [2019-11-28 21:10:46,011 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:10:46,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 442 transitions. [2019-11-28 21:10:46,015 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 223 [2019-11-28 21:10:46,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:10:46,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:10:46,016 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:10:46,017 INFO L850 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] [2019-11-28 21:10:46,017 INFO L794 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(110, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 3 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string49.base, #t~string49.offset, 1);call write~init~int(80, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(117, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(109, #t~string49.base, 3 + #t~string49.offset, 1);call write~init~int(112, #t~string49.base, 4 + #t~string49.offset, 1);call write~init~int(58, #t~string49.base, 5 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 6 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string55.base, #t~string55.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string57.base, #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 1 + #t~string57.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(13);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(77, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(101, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(116, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(104, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string64.base, #t~string64.offset, 1);call write~init~int(82, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(73, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(84, #t~string64.base, 3 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 4 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(75, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 975#L-1 havoc main_#res;havoc main_#t~ret37, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 976#L959 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; 1004#L967 main_#t~ret37 := valid_product_#res;main_~tmp~4 := main_#t~ret37;havoc main_#t~ret37; 1005#L534 assume 0 != main_~tmp~4; 1022#L507 havoc test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 963#L51-1 [2019-11-28 21:10:46,018 INFO L796 eck$LassoCheckResult]: Loop: 963#L51-1 assume !false; 964#L879 assume test_~splverifierCounter~0 < 4; 1006#L880 test_~tmp~9 := test_#t~nondet69;havoc test_#t~nondet69; 949#L888 assume !(0 != test_~tmp~9); 951#L888-1 test_~tmp___0~2 := test_#t~nondet70;havoc test_#t~nondet70; 1009#L898 assume !(0 != test_~tmp___0~2); 1010#L898-1 test_~tmp___2~0 := test_#t~nondet71;havoc test_#t~nondet71; 1070#L908 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1071#L916-1 assume !(0 != ~pumpRunning~0); 977#L563 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret39, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 978#L621 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret38, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 1149#L595-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret58, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~9;havoc isHighWaterSensorDry_~retValue_acc~9; 1161#L857-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~9 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~9; 1160#L862-1 isHighWaterLevel_#t~ret58 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret58;havoc isHighWaterLevel_#t~ret58; 1075#L740-3 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~1 := 0; 1076#L740-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 1033#L746-1 processEnvironment__wrappee__methaneQuery_#t~ret38 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~5 := processEnvironment__wrappee__methaneQuery_#t~ret38;havoc processEnvironment__wrappee__methaneQuery_#t~ret38; 1034#L599-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~5); 960#L570 havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 1049#L849 __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 970#L51 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 963#L51-1 [2019-11-28 21:10:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:10:46,018 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-11-28 21:10:46,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:10:46,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27832237] [2019-11-28 21:10:46,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:10:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:46,165 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:10:46,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:10:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1301686428, now seen corresponding path program 1 times [2019-11-28 21:10:46,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:10:46,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94795220] [2019-11-28 21:10:46,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:10:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:10:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:10:46,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94795220] [2019-11-28 21:10:46,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:10:46,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:10:46,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228946455] [2019-11-28 21:10:46,209 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:10:46,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:10:46,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:10:46,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:10:46,212 INFO L87 Difference]: Start difference. First operand 317 states and 442 transitions. cyclomatic complexity: 128 Second operand 4 states. [2019-11-28 21:10:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:10:46,359 INFO L93 Difference]: Finished difference Result 891 states and 1218 transitions. [2019-11-28 21:10:46,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:10:46,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 891 states and 1218 transitions. [2019-11-28 21:10:46,370 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 637 [2019-11-28 21:10:46,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 891 states to 891 states and 1218 transitions. [2019-11-28 21:10:46,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 891 [2019-11-28 21:10:46,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 891 [2019-11-28 21:10:46,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 891 states and 1218 transitions. [2019-11-28 21:10:46,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:10:46,386 INFO L688 BuchiCegarLoop]: Abstraction has 891 states and 1218 transitions. [2019-11-28 21:10:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states and 1218 transitions. [2019-11-28 21:10:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 341. [2019-11-28 21:10:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-28 21:10:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 466 transitions. [2019-11-28 21:10:46,406 INFO L711 BuchiCegarLoop]: Abstraction has 341 states and 466 transitions. [2019-11-28 21:10:46,406 INFO L591 BuchiCegarLoop]: Abstraction has 341 states and 466 transitions. [2019-11-28 21:10:46,407 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:10:46,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 341 states and 466 transitions. [2019-11-28 21:10:46,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 239 [2019-11-28 21:10:46,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:10:46,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:10:46,411 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:10:46,411 INFO L850 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] [2019-11-28 21:10:46,412 INFO L794 eck$LassoCheckResult]: Stem: 2302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(110, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 3 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string49.base, #t~string49.offset, 1);call write~init~int(80, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(117, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(109, #t~string49.base, 3 + #t~string49.offset, 1);call write~init~int(112, #t~string49.base, 4 + #t~string49.offset, 1);call write~init~int(58, #t~string49.base, 5 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 6 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string55.base, #t~string55.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string57.base, #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 1 + #t~string57.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(13);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(77, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(101, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(116, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(104, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string64.base, #t~string64.offset, 1);call write~init~int(82, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(73, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(84, #t~string64.base, 3 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 4 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(75, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 2194#L-1 havoc main_#res;havoc main_#t~ret37, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 2195#L959 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; 2231#L967 main_#t~ret37 := valid_product_#res;main_~tmp~4 := main_#t~ret37;havoc main_#t~ret37; 2232#L534 assume 0 != main_~tmp~4; 2255#L507 havoc test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2256#L51-1 [2019-11-28 21:10:46,412 INFO L796 eck$LassoCheckResult]: Loop: 2256#L51-1 assume !false; 2433#L879 assume test_~splverifierCounter~0 < 4; 2432#L880 test_~tmp~9 := test_#t~nondet69;havoc test_#t~nondet69; 2431#L888 assume !(0 != test_~tmp~9); 2178#L888-1 test_~tmp___0~2 := test_#t~nondet70;havoc test_#t~nondet70; 2179#L898 assume !(0 != test_~tmp___0~2); 2428#L898-1 test_~tmp___2~0 := test_#t~nondet71;havoc test_#t~nondet71; 2427#L908 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2319#L916-1 assume !(0 != ~pumpRunning~0); 2425#L563 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret39, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 2424#L621 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret38, processEnvironment__wrappee__methaneQuery_~tmp~5;havoc processEnvironment__wrappee__methaneQuery_~tmp~5; 2249#L595-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret58, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~8, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~8;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~9;havoc isHighWaterSensorDry_~retValue_acc~9; 2250#L857-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~9 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~9; 2422#L862-1 isHighWaterLevel_#t~ret58 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~8 := isHighWaterLevel_#t~ret58;havoc isHighWaterLevel_#t~ret58; 2420#L740-3 assume 0 != isHighWaterLevel_~tmp~8;isHighWaterLevel_~tmp___0~1 := 0; 2417#L740-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 2269#L746-1 processEnvironment__wrappee__methaneQuery_#t~ret38 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~5 := processEnvironment__wrappee__methaneQuery_#t~ret38;havoc processEnvironment__wrappee__methaneQuery_#t~ret38; 2270#L599-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~5); 2282#L570 havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 2207#L849 __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 2208#L51 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 2256#L51-1 [2019-11-28 21:10:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:10:46,413 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-11-28 21:10:46,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:10:46,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951882451] [2019-11-28 21:10:46,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:10:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:46,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:10:46,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:10:46,499 INFO L82 PathProgramCache]: Analyzing trace with hash 621628058, now seen corresponding path program 1 times [2019-11-28 21:10:46,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:10:46,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154543893] [2019-11-28 21:10:46,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:10:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:46,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:10:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:10:46,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1077699252, now seen corresponding path program 1 times [2019-11-28 21:10:46,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:10:46,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304252943] [2019-11-28 21:10:46,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:10:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:10:46,655 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:10:46,794 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-28 21:11:17,373 WARN L192 SmtUtils]: Spent 30.50 s on a formula simplification. DAG size of input: 452 DAG size of output: 400 [2019-11-28 21:11:31,996 WARN L192 SmtUtils]: Spent 14.62 s on a formula simplification that was a NOOP. DAG size: 400 [2019-11-28 21:11:32,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:11:32 BoogieIcfgContainer [2019-11-28 21:11:32,099 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:11:32,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:11:32,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:11:32,101 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:11:32,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:10:44" (3/4) ... [2019-11-28 21:11:32,106 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 21:11:32,185 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 21:11:32,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:11:32,187 INFO L168 Benchmark]: Toolchain (without parser) took 49130.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 959.0 MB in the beginning and 1.2 GB in the end (delta: -246.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:11:32,187 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:11:32,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -129.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 21:11:32,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.00 ms. Allocated memory is still 1.1 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-11-28 21:11:32,189 INFO L168 Benchmark]: Boogie Preprocessor took 73.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:11:32,190 INFO L168 Benchmark]: RCFGBuilder took 977.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:11:32,190 INFO L168 Benchmark]: BuchiAutomizer took 47286.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -188.9 MB). Peak memory consumption was 386.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:11:32,191 INFO L168 Benchmark]: Witness Printer took 84.72 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:11:32,194 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -129.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.00 ms. Allocated memory is still 1.1 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 73.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 977.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47286.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -188.9 MB). Peak memory consumption was 386.4 MB. Max. memory is 11.5 GB. * Witness Printer took 84.72 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. 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 4 locations. The remainder module has 341 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 46.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 552 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 341 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 688 SDtfs, 650 SDslu, 654 SDs, 0 SdLazy, 101 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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: 878]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=2182} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=0, NULL=6392, NULL=2182, retValue_acc=0, NULL=0, NULL=0, NULL=0, NULL=2185, methaneLevelCritical=0, tmp___0=0, retValue_acc=1, NULL=0, NULL=3343, NULL=0, NULL=3346, tmp___1=0, tmp=0, NULL=3344, retValue_acc=0, NULL=2186, NULL=3347, tmp___0=0, cleanupTimeShifts=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d1edc9a=0, NULL=6393, NULL=3352, NULL=6394, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@299bce50=0, NULL=3351, NULL=7267, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c133d0c=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13f445bf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28226d26=0, NULL=0, \result=0, NULL=2184, NULL=6391, NULL=0, NULL=0, NULL=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, NULL=3349, NULL=6395, \result=0, NULL=3350, tmp=1, NULL=3348, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@732ab76e=0, NULL=0, NULL=0, NULL=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@761893c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a45e5e0=50, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63e8a230=0, NULL=2183, retValue_acc=1, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2546b725=0, tmp___2=50, tmp___0=0, NULL=6396, splverifierCounter=0, head=0, NULL=6389, NULL=0, tmp=0, NULL=0, NULL=6388, NULL=0, NULL=0, NULL=3345, NULL=6390, NULL=7268, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L238] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L444] int cleanupTimeShifts = 4; [L556] int pumpRunning = 0; [L557] int systemActive = 1; [L774] int waterLevel = 1; [L775] int methaneLevelCritical = 0; [L525] int retValue_acc ; [L526] int tmp ; [L963] int retValue_acc ; [L966] retValue_acc = 1 [L967] return (retValue_acc); [L532] tmp = valid_product() [L534] COND TRUE \read(tmp) [L869] int splverifierCounter ; [L870] int tmp ; [L871] int tmp___0 ; [L872] int tmp___1 ; [L873] int tmp___2 ; [L876] splverifierCounter = 0 Loop: [L878] COND TRUE 1 [L880] COND TRUE splverifierCounter < 4 [L886] tmp = __VERIFIER_nondet_int() [L888] COND FALSE !(\read(tmp)) [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND TRUE \read(tmp___2) [L769] systemActive = 1 [L563] COND FALSE !(\read(pumpRunning)) [L570] COND TRUE \read(systemActive) [L618] int tmp ; [L621] COND FALSE !(\read(pumpRunning)) [L592] int tmp ; [L595] COND TRUE ! pumpRunning [L732] int retValue_acc ; [L733] int tmp ; [L734] int tmp___0 ; [L854] int retValue_acc ; [L857] COND TRUE waterLevel < 2 [L858] retValue_acc = 1 [L859] return (retValue_acc); [L738] tmp = isHighWaterSensorDry() [L740] COND TRUE \read(tmp) [L741] tmp___0 = 0 [L745] retValue_acc = tmp___0 [L746] return (retValue_acc); [L597] tmp = isHighWaterLevel() [L599] COND FALSE !(\read(tmp)) [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...