./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product47_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec1_product47_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 ef0694c6828fdd41a19c9b426d075f4f4dde925f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:35:49,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:35:49,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:35:49,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:35:49,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:35:49,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:35:49,928 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:35:49,931 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:35:49,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:35:49,935 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:35:49,943 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:35:49,944 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:35:49,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:35:49,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:35:49,949 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:35:49,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:35:49,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:35:49,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:35:49,959 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:35:49,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:35:49,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:35:49,964 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:35:49,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:35:49,969 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:35:49,969 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:35:49,971 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:35:49,972 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:35:49,975 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:35:49,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:35:49,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:35:49,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:35:49,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:35:49,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:35:49,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:35:49,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:35:49,983 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:35:49,983 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:35:50,005 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:35:50,005 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:35:50,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:35:50,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:35:50,006 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:35:50,007 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:35:50,007 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:35:50,007 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:35:50,007 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:35:50,007 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:35:50,007 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:35:50,008 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:35:50,008 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:35:50,008 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:35:50,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:35:50,008 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:35:50,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:35:50,009 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:35:50,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:35:50,009 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:35:50,009 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:35:50,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:35:50,009 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:35:50,010 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:35:50,010 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:35:50,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:35:50,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:35:50,010 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:35:50,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:35:50,011 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:35:50,011 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:35:50,012 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:35:50,012 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 -> ef0694c6828fdd41a19c9b426d075f4f4dde925f [2019-01-01 23:35:50,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:35:50,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:35:50,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:35:50,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:35:50,072 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:35:50,073 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product47_true-unreach-call_false-termination.cil.c [2019-01-01 23:35:50,146 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e4ae383/fe1f56b090a54bf98fcd925d8c53f5e0/FLAGedc343e60 [2019-01-01 23:35:50,638 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:35:50,639 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product47_true-unreach-call_false-termination.cil.c [2019-01-01 23:35:50,662 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e4ae383/fe1f56b090a54bf98fcd925d8c53f5e0/FLAGedc343e60 [2019-01-01 23:35:50,932 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e4ae383/fe1f56b090a54bf98fcd925d8c53f5e0 [2019-01-01 23:35:50,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:35:50,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:35:50,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:35:50,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:35:50,943 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:35:50,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:35:50" (1/1) ... [2019-01-01 23:35:50,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:50, skipping insertion in model container [2019-01-01 23:35:50,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:35:50" (1/1) ... [2019-01-01 23:35:50,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:35:51,024 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:35:51,386 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:35:51,418 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:35:51,519 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:35:51,578 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:35:51,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51 WrapperNode [2019-01-01 23:35:51,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:35:51,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:35:51,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:35:51,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:35:51,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... [2019-01-01 23:35:51,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... [2019-01-01 23:35:51,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:35:51,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:35:51,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:35:51,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:35:51,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... [2019-01-01 23:35:51,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... [2019-01-01 23:35:51,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... [2019-01-01 23:35:51,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... [2019-01-01 23:35:51,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... [2019-01-01 23:35:51,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... [2019-01-01 23:35:51,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... [2019-01-01 23:35:51,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:35:51,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:35:51,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:35:51,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:35:51,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:35:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:35:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:35:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:35:51,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:35:53,423 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:35:53,423 INFO L280 CfgBuilder]: Removed 196 assue(true) statements. [2019-01-01 23:35:53,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:35:53 BoogieIcfgContainer [2019-01-01 23:35:53,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:35:53,425 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:35:53,425 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:35:53,428 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:35:53,429 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:35:53,429 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:35:50" (1/3) ... [2019-01-01 23:35:53,430 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51353e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:35:53, skipping insertion in model container [2019-01-01 23:35:53,431 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:35:53,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:51" (2/3) ... [2019-01-01 23:35:53,431 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51353e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:35:53, skipping insertion in model container [2019-01-01 23:35:53,431 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:35:53,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:35:53" (3/3) ... [2019-01-01 23:35:53,433 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec1_product47_true-unreach-call_false-termination.cil.c [2019-01-01 23:35:53,507 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:35:53,508 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:35:53,508 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:35:53,509 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:35:53,509 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:35:53,509 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:35:53,509 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:35:53,509 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:35:53,509 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:35:53,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-01-01 23:35:53,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2019-01-01 23:35:53,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:35:53,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:35:53,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:35:53,573 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:35:53,574 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:35:53,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-01-01 23:35:53,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2019-01-01 23:35:53,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:35:53,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:35:53,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:35:53,586 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:35:53,591 INFO L794 eck$LassoCheckResult]: Stem: 109#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 16#L-1true havoc main_#res;havoc main_#t~ret73, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 19#L103true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 32#L111true main_#t~ret73 := valid_product_#res;main_~tmp~9 := main_#t~ret73;havoc main_#t~ret73; 88#L947true assume 0 != main_~tmp~9; 128#L924true havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 9#L51-1true [2019-01-01 23:35:53,592 INFO L796 eck$LassoCheckResult]: Loop: 9#L51-1true assume !false; 114#L443true assume test_~splverifierCounter~0 < 4; 52#L444true test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 59#L452true assume !(0 != test_~tmp~5); 60#L452-1true test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 119#L462true assume !(0 != test_~tmp___0~2); 120#L462-1true test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 18#L472true assume 0 != test_~tmp___2~0; 127#L478-1true assume !(0 != ~pumpRunning~0); 125#L228true assume !(0 != ~systemActive~0); 48#L235true havoc __utac_acc__Specification1_spec__1_#t~ret0, __utac_acc__Specification1_spec__1_#t~ret1, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 113#L165-3true __utac_acc__Specification1_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret0;havoc __utac_acc__Specification1_spec__1_#t~ret0; 13#L51true assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 9#L51-1true [2019-01-01 23:35:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:53,599 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:35:53,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:53,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:53,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:53,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:53,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:54,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1670724661, now seen corresponding path program 1 times [2019-01-01 23:35:54,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:54,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:54,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:54,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:54,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash 43554277, now seen corresponding path program 1 times [2019-01-01 23:35:54,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:54,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:54,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:35:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:35:54,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:35:54,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:35:54,919 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 23:35:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:35:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:35:55,035 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 6 states. [2019-01-01 23:35:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:35:55,507 INFO L93 Difference]: Finished difference Result 300 states and 426 transitions. [2019-01-01 23:35:55,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:35:55,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 426 transitions. [2019-01-01 23:35:55,532 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 193 [2019-01-01 23:35:55,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 279 states and 405 transitions. [2019-01-01 23:35:55,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2019-01-01 23:35:55,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279 [2019-01-01 23:35:55,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 405 transitions. [2019-01-01 23:35:55,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:35:55,563 INFO L705 BuchiCegarLoop]: Abstraction has 279 states and 405 transitions. [2019-01-01 23:35:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 405 transitions. [2019-01-01 23:35:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 162. [2019-01-01 23:35:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-01 23:35:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2019-01-01 23:35:55,610 INFO L728 BuchiCegarLoop]: Abstraction has 162 states and 234 transitions. [2019-01-01 23:35:55,610 INFO L608 BuchiCegarLoop]: Abstraction has 162 states and 234 transitions. [2019-01-01 23:35:55,610 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:35:55,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 234 transitions. [2019-01-01 23:35:55,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2019-01-01 23:35:55,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:35:55,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:35:55,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:35:55,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:35:55,616 INFO L794 eck$LassoCheckResult]: Stem: 566#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 467#L-1 havoc main_#res;havoc main_#t~ret73, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 468#L103 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 472#L111 main_#t~ret73 := valid_product_#res;main_~tmp~9 := main_#t~ret73;havoc main_#t~ret73; 493#L947 assume 0 != main_~tmp~9; 551#L924 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 457#L51-1 [2019-01-01 23:35:55,619 INFO L796 eck$LassoCheckResult]: Loop: 457#L51-1 assume !false; 458#L443 assume test_~splverifierCounter~0 < 4; 516#L444 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 517#L452 assume !(0 != test_~tmp~5); 525#L452-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 526#L462 assume !(0 != test_~tmp___0~2); 539#L462-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 469#L472 assume 0 != test_~tmp___2~0; 470#L478-1 assume !(0 != ~pumpRunning~0); 479#L228 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret14, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 563#L286 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret13, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 490#L260-1 assume !(0 == ~pumpRunning~0); 491#L235 havoc __utac_acc__Specification1_spec__1_#t~ret0, __utac_acc__Specification1_spec__1_#t~ret1, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 514#L165-3 __utac_acc__Specification1_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret0;havoc __utac_acc__Specification1_spec__1_#t~ret0; 463#L51 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 457#L51-1 [2019-01-01 23:35:55,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:35:55,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:55,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:55,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:55,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:55,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:55,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1966055757, now seen corresponding path program 1 times [2019-01-01 23:35:55,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:55,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:55,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:55,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:35:55,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:35:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:35:56,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:35:56,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:35:56,007 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:35:56,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:35:56,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:35:56,008 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. cyclomatic complexity: 75 Second operand 3 states. [2019-01-01 23:35:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:35:56,646 INFO L93 Difference]: Finished difference Result 201 states and 274 transitions. [2019-01-01 23:35:56,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:35:56,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 274 transitions. [2019-01-01 23:35:56,651 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2019-01-01 23:35:56,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 201 states and 274 transitions. [2019-01-01 23:35:56,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2019-01-01 23:35:56,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-01-01 23:35:56,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 274 transitions. [2019-01-01 23:35:56,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:35:56,657 INFO L705 BuchiCegarLoop]: Abstraction has 201 states and 274 transitions. [2019-01-01 23:35:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 274 transitions. [2019-01-01 23:35:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-01 23:35:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-01 23:35:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 274 transitions. [2019-01-01 23:35:56,670 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 274 transitions. [2019-01-01 23:35:56,670 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 274 transitions. [2019-01-01 23:35:56,670 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:35:56,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 274 transitions. [2019-01-01 23:35:56,673 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2019-01-01 23:35:56,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:35:56,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:35:56,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:35:56,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:35:56,675 INFO L794 eck$LassoCheckResult]: Stem: 939#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 837#L-1 havoc main_#res;havoc main_#t~ret73, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 838#L103 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 842#L111 main_#t~ret73 := valid_product_#res;main_~tmp~9 := main_#t~ret73;havoc main_#t~ret73; 864#L947 assume 0 != main_~tmp~9; 925#L924 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 827#L51-1 [2019-01-01 23:35:56,679 INFO L796 eck$LassoCheckResult]: Loop: 827#L51-1 assume !false; 828#L443 assume test_~splverifierCounter~0 < 4; 889#L444 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 890#L452 assume !(0 != test_~tmp~5); 898#L452-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 899#L462 assume !(0 != test_~tmp___0~2); 912#L462-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 839#L472 assume 0 != test_~tmp___2~0; 840#L478-1 assume !(0 != ~pumpRunning~0); 943#L228 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret14, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 936#L286 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret13, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 861#L260-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 855#L205-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~4 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 856#L210-1 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 875#L405-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 910#L405-5 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 895#L411-1 processEnvironment__wrappee__methaneQuery_#t~ret13 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~1 := processEnvironment__wrappee__methaneQuery_#t~ret13;havoc processEnvironment__wrappee__methaneQuery_#t~ret13; 896#L264-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~1); 886#L235 havoc __utac_acc__Specification1_spec__1_#t~ret0, __utac_acc__Specification1_spec__1_#t~ret1, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 887#L165-3 __utac_acc__Specification1_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret0;havoc __utac_acc__Specification1_spec__1_#t~ret0; 833#L51 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 827#L51-1 [2019-01-01 23:35:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:56,680 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:35:56,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:56,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:56,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:56,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:56,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:56,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1687938725, now seen corresponding path program 1 times [2019-01-01 23:35:56,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:56,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:56,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:56,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:35:56,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:35:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:35:57,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:35:57,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:35:57,122 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:35:57,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:35:57,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:35:57,122 INFO L87 Difference]: Start difference. First operand 201 states and 274 transitions. cyclomatic complexity: 76 Second operand 4 states. [2019-01-01 23:35:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:35:58,239 INFO L93 Difference]: Finished difference Result 567 states and 762 transitions. [2019-01-01 23:35:58,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:35:58,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 762 transitions. [2019-01-01 23:35:58,246 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 410 [2019-01-01 23:35:58,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 567 states and 762 transitions. [2019-01-01 23:35:58,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 567 [2019-01-01 23:35:58,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 567 [2019-01-01 23:35:58,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 567 states and 762 transitions. [2019-01-01 23:35:58,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:35:58,257 INFO L705 BuchiCegarLoop]: Abstraction has 567 states and 762 transitions. [2019-01-01 23:35:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states and 762 transitions. [2019-01-01 23:35:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 213. [2019-01-01 23:35:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-01 23:35:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 286 transitions. [2019-01-01 23:35:58,280 INFO L728 BuchiCegarLoop]: Abstraction has 213 states and 286 transitions. [2019-01-01 23:35:58,280 INFO L608 BuchiCegarLoop]: Abstraction has 213 states and 286 transitions. [2019-01-01 23:35:58,280 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:35:58,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 286 transitions. [2019-01-01 23:35:58,282 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 150 [2019-01-01 23:35:58,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:35:58,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:35:58,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:35:58,284 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:35:58,284 INFO L794 eck$LassoCheckResult]: Stem: 1727#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 1616#L-1 havoc main_#res;havoc main_#t~ret73, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 1617#L103 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 1621#L111 main_#t~ret73 := valid_product_#res;main_~tmp~9 := main_#t~ret73;havoc main_#t~ret73; 1647#L947 assume 0 != main_~tmp~9; 1713#L924 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1604#L51-1 [2019-01-01 23:35:58,285 INFO L796 eck$LassoCheckResult]: Loop: 1604#L51-1 assume !false; 1605#L443 assume test_~splverifierCounter~0 < 4; 1730#L444 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 1805#L452 assume !(0 != test_~tmp~5); 1803#L452-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 1802#L462 assume !(0 != test_~tmp___0~2); 1800#L462-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 1798#L472 assume 0 != test_~tmp___2~0; 1797#L478-1 assume !(0 != ~pumpRunning~0); 1733#L228 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret14, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 1724#L286 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret13, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 1644#L260-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 1636#L205-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~4 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 1637#L210-1 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 1696#L405-3 assume !(0 != isHighWaterLevel_~tmp~4);isHighWaterLevel_~tmp___0~1 := 1; 1697#L405-5 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 1681#L411-1 processEnvironment__wrappee__methaneQuery_#t~ret13 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~1 := processEnvironment__wrappee__methaneQuery_#t~ret13;havoc processEnvironment__wrappee__methaneQuery_#t~ret13; 1682#L264-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~1); 1675#L235 havoc __utac_acc__Specification1_spec__1_#t~ret0, __utac_acc__Specification1_spec__1_#t~ret1, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 1729#L165-3 __utac_acc__Specification1_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret0;havoc __utac_acc__Specification1_spec__1_#t~ret0; 1611#L51 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 1604#L51-1 [2019-01-01 23:35:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-01-01 23:35:58,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:58,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:58,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:58,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:58,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash 87068637, now seen corresponding path program 1 times [2019-01-01 23:35:58,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:58,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:58,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:35:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:35:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:35:58,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:35:58,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:35:58,713 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:35:58,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:35:58,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:35:58,714 INFO L87 Difference]: Start difference. First operand 213 states and 286 transitions. cyclomatic complexity: 76 Second operand 5 states. [2019-01-01 23:36:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:36:00,041 INFO L93 Difference]: Finished difference Result 525 states and 699 transitions. [2019-01-01 23:36:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:36:00,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 525 states and 699 transitions. [2019-01-01 23:36:00,048 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 382 [2019-01-01 23:36:00,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 525 states to 525 states and 699 transitions. [2019-01-01 23:36:00,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 525 [2019-01-01 23:36:00,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 525 [2019-01-01 23:36:00,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 525 states and 699 transitions. [2019-01-01 23:36:00,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:36:00,056 INFO L705 BuchiCegarLoop]: Abstraction has 525 states and 699 transitions. [2019-01-01 23:36:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states and 699 transitions. [2019-01-01 23:36:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 231. [2019-01-01 23:36:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-01 23:36:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 304 transitions. [2019-01-01 23:36:00,067 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 304 transitions. [2019-01-01 23:36:00,067 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 304 transitions. [2019-01-01 23:36:00,067 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:36:00,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 304 transitions. [2019-01-01 23:36:00,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 162 [2019-01-01 23:36:00,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:36:00,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:36:00,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:36:00,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:36:00,073 INFO L794 eck$LassoCheckResult]: Stem: 2492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string6.base, #t~string6.offset, 1);call write~init~int(77, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(101, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(116, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(104, #t~string6.base, 4 + #t~string6.offset, 1);call write~init~int(58, #t~string6.base, 5 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 6 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string8.base, #t~string8.offset, 1);call write~init~int(82, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(73, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(84, #t~string8.base, 3 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 4 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string10.base, #t~string10.offset, 1);call write~init~int(75, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 2 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string12.base, #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 1 + #t~string12.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 2369#L-1 havoc main_#res;havoc main_#t~ret73, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 2370#L103 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 2374#L111 main_#t~ret73 := valid_product_#res;main_~tmp~9 := main_#t~ret73;havoc main_#t~ret73; 2401#L947 assume 0 != main_~tmp~9; 2474#L924 havoc test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2357#L51-1 [2019-01-01 23:36:00,073 INFO L796 eck$LassoCheckResult]: Loop: 2357#L51-1 assume !false; 2358#L443 assume test_~splverifierCounter~0 < 4; 2559#L444 test_~tmp~5 := test_#t~nondet34;havoc test_#t~nondet34; 2575#L452 assume !(0 != test_~tmp~5); 2573#L452-1 test_~tmp___0~2 := test_#t~nondet35;havoc test_#t~nondet35; 2572#L462 assume !(0 != test_~tmp___0~2); 2570#L462-1 test_~tmp___2~0 := test_#t~nondet36;havoc test_#t~nondet36; 2568#L472 assume 0 != test_~tmp___2~0; 2501#L478-1 assume !(0 != ~pumpRunning~0); 2500#L228 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret14, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 2489#L286 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret13, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 2397#L260-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret33, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 2389#L205-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~4 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 2391#L210-1 isHighWaterLevel_#t~ret33 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret33;havoc isHighWaterLevel_#t~ret33; 2412#L405-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 2505#L405-5 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 2437#L411-1 processEnvironment__wrappee__methaneQuery_#t~ret13 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~1 := processEnvironment__wrappee__methaneQuery_#t~ret13;havoc processEnvironment__wrappee__methaneQuery_#t~ret13; 2438#L264-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~1); 2423#L235 havoc __utac_acc__Specification1_spec__1_#t~ret0, __utac_acc__Specification1_spec__1_#t~ret1, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 2424#L165-3 __utac_acc__Specification1_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret0;havoc __utac_acc__Specification1_spec__1_#t~ret0; 2364#L51 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 2357#L51-1 [2019-01-01 23:36:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 5 times [2019-01-01 23:36:00,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:00,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:00,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:00,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:36:00,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:00,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1926970201, now seen corresponding path program 1 times [2019-01-01 23:36:00,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:00,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:00,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:00,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:36:00,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1911925901, now seen corresponding path program 1 times [2019-01-01 23:36:00,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:00,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:00,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:00,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:36:00,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:01,016 WARN L181 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-01 23:36:01,124 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 23:36:21,283 WARN L181 SmtUtils]: Spent 20.15 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:36:35,694 WARN L181 SmtUtils]: Spent 14.41 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:36:35,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:36:35 BoogieIcfgContainer [2019-01-01 23:36:35,765 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:36:35,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:36:35,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:36:35,766 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:36:35,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:35:53" (3/4) ... [2019-01-01 23:36:35,771 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:36:35,871 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:36:35,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:36:35,873 INFO L168 Benchmark]: Toolchain (without parser) took 44936.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -280.8 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:35,875 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:36:35,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.32 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:35,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 221.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:35,883 INFO L168 Benchmark]: Boogie Preprocessor took 78.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:36:35,883 INFO L168 Benchmark]: RCFGBuilder took 1544.03 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: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:35,884 INFO L168 Benchmark]: BuchiAutomizer took 42340.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -173.4 MB). Peak memory consumption was 407.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:35,884 INFO L168 Benchmark]: Witness Printer took 106.50 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: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:35,891 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 640.32 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 221.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1544.03 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: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42340.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -173.4 MB). Peak memory consumption was 407.8 MB. Max. memory is 11.5 GB. * Witness Printer took 106.50 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: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 231 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 38.3s. Construction of modules took 3.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 765 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 231 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 937 SDtfs, 1680 SDslu, 1782 SDs, 0 SdLazy, 229 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont1 unkn0 SFLI3 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: 442]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=2} State at position 1 is {NULL=0, NULL=-2, NULL=2, NULL=0, NULL=0, NULL=-18, methaneLevelCritical=0, NULL=-11, tmp___0=0, NULL=0, NULL=0, tmp=0, NULL=0, NULL=0, NULL=-22, NULL=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58c90d9c=0, tmp___1=0, NULL=0, NULL=0, NULL=0, NULL=-25, tmp___0=0, NULL=-3, cleanupTimeShifts=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58679880=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75543786=69, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c12fca0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21ba29e1=0, NULL=0, systemActive=1, waterLevel=1, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16c7ea76=0, NULL=0, NULL=0, NULL=-16, NULL=0, NULL=-7, \result=0, retValue_acc=0, NULL=0, NULL=-10, NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=-23, \result=1, NULL=-12, head=0, pumpRunning=0, NULL=-15, \result=0, retValue_acc=1, NULL=-8, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@359201d=0, NULL=0, tmp=0, \result=1, NULL=-21, NULL=-13, NULL=-1, tmp=1, retValue_acc=1, tmp___2=69, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d869297=0, tmp___0=0, NULL=-17, NULL=-14, splverifierCounter=0, NULL=0, \result=0, NULL=-5, NULL=-24, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d1d62a5=0, NULL=-19, tmp=0, head=0, tmp=0, NULL=0, NULL=0, NULL=-6, NULL=0, tmp=1, NULL=0, NULL=-9, NULL=0, NULL=-20, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74923058=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L122] int waterLevel = 1; [L123] int methaneLevelCritical = 0; [L221] int pumpRunning = 0; [L222] int systemActive = 1; [L668] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L865] int cleanupTimeShifts = 4; [L938] int retValue_acc ; [L939] int tmp ; [L107] int retValue_acc ; [L110] retValue_acc = 1 [L111] return (retValue_acc); [L945] tmp = valid_product() [L947] COND TRUE \read(tmp) [L433] int splverifierCounter ; [L434] int tmp ; [L435] int tmp___0 ; [L436] int tmp___1 ; [L437] int tmp___2 ; [L440] splverifierCounter = 0 Loop: [L442] COND TRUE 1 [L444] COND TRUE splverifierCounter < 4 [L450] tmp = __VERIFIER_nondet_int() [L452] COND FALSE !(\read(tmp)) [L460] tmp___0 = __VERIFIER_nondet_int() [L462] COND FALSE !(\read(tmp___0)) [L470] tmp___2 = __VERIFIER_nondet_int() [L472] COND TRUE \read(tmp___2) [L228] COND FALSE !(\read(pumpRunning)) [L235] COND TRUE \read(systemActive) [L283] int tmp ; [L286] COND FALSE !(\read(pumpRunning)) [L257] int tmp ; [L260] COND TRUE ! pumpRunning [L397] int retValue_acc ; [L398] int tmp ; [L399] int tmp___0 ; [L202] int retValue_acc ; [L205] COND TRUE waterLevel < 2 [L206] retValue_acc = 1 [L207] return (retValue_acc); [L403] tmp = isHighWaterSensorDry() [L405] COND TRUE \read(tmp) [L406] tmp___0 = 0 [L410] retValue_acc = tmp___0 [L411] return (retValue_acc); [L262] tmp = isHighWaterLevel() [L264] COND FALSE !(\read(tmp)) [L44] int tmp ; [L45] int tmp___0 ; [L161] int retValue_acc ; [L164] retValue_acc = methaneLevelCritical [L165] return (retValue_acc); [L49] tmp = isMethaneLevelCritical() [L51] COND FALSE !(\read(tmp)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...