./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product32_false-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_spec3_product32_false-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 c2361d4ced817ad36e50edb6a8752f3651639931 .............................................................................................................................................................................................................................................................................................................................................................................................................................. 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:42:53,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:42:53,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:42:53,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:42:53,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:42:53,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:42:53,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:42:53,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:42:53,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:42:53,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:42:53,131 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:42:53,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:42:53,133 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:42:53,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:42:53,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:42:53,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:42:53,142 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:42:53,148 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:42:53,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:42:53,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:42:53,157 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:42:53,158 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:42:53,160 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:42:53,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:42:53,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:42:53,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:42:53,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:42:53,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:42:53,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:42:53,164 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:42:53,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:42:53,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:42:53,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:42:53,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:42:53,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:42:53,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:42:53,168 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:42:53,186 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:42:53,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:42:53,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:42:53,188 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:42:53,188 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:42:53,188 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:42:53,188 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:42:53,188 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:42:53,189 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:42:53,189 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:42:53,189 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:42:53,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:42:53,191 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:42:53,191 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:42:53,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:42:53,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:42:53,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:42:53,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:42:53,192 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:42:53,192 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:42:53,192 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:42:53,192 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:42:53,192 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:42:53,192 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:42:53,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:42:53,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:42:53,193 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:42:53,193 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:42:53,193 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:42:53,194 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:42:53,197 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:42:53,198 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:42:53,198 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 -> c2361d4ced817ad36e50edb6a8752f3651639931 [2019-01-01 23:42:53,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:42:53,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:42:53,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:42:53,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:42:53,279 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:42:53,279 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product32_false-unreach-call_false-termination.cil.c [2019-01-01 23:42:53,356 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d705a185d/563489c85f1f47c7aee14cdefd3dde55/FLAG2ae2754bc [2019-01-01 23:42:53,824 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:42:53,825 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product32_false-unreach-call_false-termination.cil.c [2019-01-01 23:42:53,840 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d705a185d/563489c85f1f47c7aee14cdefd3dde55/FLAG2ae2754bc [2019-01-01 23:42:54,132 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d705a185d/563489c85f1f47c7aee14cdefd3dde55 [2019-01-01 23:42:54,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:42:54,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:42:54,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:42:54,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:42:54,143 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:42:54,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:42:54" (1/1) ... [2019-01-01 23:42:54,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52869081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54, skipping insertion in model container [2019-01-01 23:42:54,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:42:54" (1/1) ... [2019-01-01 23:42:54,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:42:54,209 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:42:54,681 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:42:54,715 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:42:54,881 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:42:54,925 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:42:54,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54 WrapperNode [2019-01-01 23:42:54,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:42:54,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:42:54,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:42:54,927 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:42:54,934 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:42:54" (1/1) ... [2019-01-01 23:42:54,954 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:42:54" (1/1) ... [2019-01-01 23:42:55,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:42:55,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:42:55,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:42:55,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:42:55,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54" (1/1) ... [2019-01-01 23:42:55,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54" (1/1) ... [2019-01-01 23:42:55,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54" (1/1) ... [2019-01-01 23:42:55,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54" (1/1) ... [2019-01-01 23:42:55,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54" (1/1) ... [2019-01-01 23:42:55,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54" (1/1) ... [2019-01-01 23:42:55,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54" (1/1) ... [2019-01-01 23:42:55,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:42:55,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:42:55,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:42:55,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:42:55,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54" (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:42:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:42:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:42:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:42:55,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:42:56,549 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:42:56,549 INFO L280 CfgBuilder]: Removed 168 assue(true) statements. [2019-01-01 23:42:56,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:42:56 BoogieIcfgContainer [2019-01-01 23:42:56,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:42:56,550 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:42:56,550 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:42:56,554 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:42:56,555 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:42:56,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:42:54" (1/3) ... [2019-01-01 23:42:56,557 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f907c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:42:56, skipping insertion in model container [2019-01-01 23:42:56,557 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:42:56,557 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:42:54" (2/3) ... [2019-01-01 23:42:56,558 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f907c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:42:56, skipping insertion in model container [2019-01-01 23:42:56,558 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:42:56,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:42:56" (3/3) ... [2019-01-01 23:42:56,560 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product32_false-unreach-call_false-termination.cil.c [2019-01-01 23:42:56,621 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:42:56,622 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:42:56,622 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:42:56,622 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:42:56,622 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:42:56,622 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:42:56,623 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:42:56,623 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:42:56,623 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:42:56,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states. [2019-01-01 23:42:56,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2019-01-01 23:42:56,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:56,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:56,688 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:56,688 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:42:56,688 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:42:56,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states. [2019-01-01 23:42:56,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2019-01-01 23:42:56,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:56,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:56,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:56,698 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:42:56,704 INFO L794 eck$LassoCheckResult]: Stem: 81#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(13);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(110, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 3 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string50.base, #t~string50.offset, 1);call write~init~int(80, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(117, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(109, #t~string50.base, 3 + #t~string50.offset, 1);call write~init~int(112, #t~string50.base, 4 + #t~string50.offset, 1);call write~init~int(58, #t~string50.base, 5 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 6 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(110, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 2 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 3 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string56.base, #t~string56.offset, 1);call write~init~int(32, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string58.base, #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 1 + #t~string58.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 9#L-1true havoc main_#res;havoc main_#t~ret60, main_~retValue_acc~6, main_~tmp~8;havoc main_~retValue_acc~6;havoc main_~tmp~8; 41#L873true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 68#L881true main_#t~ret60 := valid_product_#res;main_~tmp~8 := main_#t~ret60;havoc main_#t~ret60; 28#L802true assume 0 != main_~tmp~8; 82#L776true havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 40#L832-1true [2019-01-01 23:42:56,704 INFO L796 eck$LassoCheckResult]: Loop: 40#L832-1true assume !false; 108#L423true assume test_~splverifierCounter~0 < 4; 63#L424true test_~tmp~3 := test_#t~nondet35;havoc test_#t~nondet35; 87#L432true assume !(0 != test_~tmp~3); 90#L432-1true test_~tmp___0~0 := test_#t~nondet36;havoc test_#t~nondet36; 15#L442true assume !(0 != test_~tmp___0~0); 3#L442-1true test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 35#L452true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 58#L460-1true assume !(0 != ~pumpRunning~0); 13#L497true assume !(0 != ~systemActive~0); 50#L504true havoc __utac_acc__Specification3_spec__1_#t~ret61, __utac_acc__Specification3_spec__1_#t~ret62, __utac_acc__Specification3_spec__1_#t~ret63, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~9;havoc isMethaneLevelCritical_~retValue_acc~9;isMethaneLevelCritical_~retValue_acc~9 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~9; 20#L929-1true __utac_acc__Specification3_spec__1_#t~ret61 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret61;havoc __utac_acc__Specification3_spec__1_#t~ret61; 75#L826true assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 40#L832-1true [2019-01-01 23:42:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:56,711 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:42:56,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:56,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:56,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:56,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:57,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:57,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1670755457, now seen corresponding path program 1 times [2019-01-01 23:42:57,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:57,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:57,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:57,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:42:57,922 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:42:57,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:42:57,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:42:57,930 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:42:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:42:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:42:57,952 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2019-01-01 23:42:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:42:58,175 INFO L93 Difference]: Finished difference Result 214 states and 306 transitions. [2019-01-01 23:42:58,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:42:58,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 306 transitions. [2019-01-01 23:42:58,196 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 138 [2019-01-01 23:42:58,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 200 states and 291 transitions. [2019-01-01 23:42:58,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2019-01-01 23:42:58,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 200 [2019-01-01 23:42:58,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 200 states and 291 transitions. [2019-01-01 23:42:58,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:42:58,216 INFO L705 BuchiCegarLoop]: Abstraction has 200 states and 291 transitions. [2019-01-01 23:42:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 291 transitions. [2019-01-01 23:42:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2019-01-01 23:42:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-01 23:42:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 288 transitions. [2019-01-01 23:42:58,280 INFO L728 BuchiCegarLoop]: Abstraction has 198 states and 288 transitions. [2019-01-01 23:42:58,281 INFO L608 BuchiCegarLoop]: Abstraction has 198 states and 288 transitions. [2019-01-01 23:42:58,281 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:42:58,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 288 transitions. [2019-01-01 23:42:58,287 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 136 [2019-01-01 23:42:58,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:42:58,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:42:58,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:42:58,289 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:42:58,290 INFO L794 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(13);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(110, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 3 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string50.base, #t~string50.offset, 1);call write~init~int(80, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(117, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(109, #t~string50.base, 3 + #t~string50.offset, 1);call write~init~int(112, #t~string50.base, 4 + #t~string50.offset, 1);call write~init~int(58, #t~string50.base, 5 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 6 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(110, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 2 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 3 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string56.base, #t~string56.offset, 1);call write~init~int(32, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string58.base, #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 1 + #t~string58.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 345#L-1 havoc main_#res;havoc main_#t~ret60, main_~retValue_acc~6, main_~tmp~8;havoc main_~retValue_acc~6;havoc main_~tmp~8; 346#L873 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 401#L881 main_#t~ret60 := valid_product_#res;main_~tmp~8 := main_#t~ret60;havoc main_#t~ret60; 380#L802 assume 0 != main_~tmp~8; 381#L776 havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 399#L832-1 [2019-01-01 23:42:58,290 INFO L796 eck$LassoCheckResult]: Loop: 399#L832-1 assume !false; 400#L423 assume test_~splverifierCounter~0 < 4; 458#L424 test_~tmp~3 := test_#t~nondet35;havoc test_#t~nondet35; 530#L432 assume !(0 != test_~tmp~3); 528#L432-1 test_~tmp___0~0 := test_#t~nondet36;havoc test_#t~nondet36; 527#L442 assume !(0 != test_~tmp___0~0); 525#L442-1 test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 524#L452 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 390#L460-1 assume !(0 != ~pumpRunning~0); 353#L497 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret40, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 354#L555 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret39, processEnvironment__wrappee__methaneQuery_~tmp~4;havoc processEnvironment__wrappee__methaneQuery_~tmp~4; 512#L529-1 assume !(0 != ~pumpRunning~0); 511#L504 havoc __utac_acc__Specification3_spec__1_#t~ret61, __utac_acc__Specification3_spec__1_#t~ret62, __utac_acc__Specification3_spec__1_#t~ret63, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~9;havoc isMethaneLevelCritical_~retValue_acc~9;isMethaneLevelCritical_~retValue_acc~9 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~9; 365#L929-1 __utac_acc__Specification3_spec__1_#t~ret61 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret61;havoc __utac_acc__Specification3_spec__1_#t~ret61; 366#L826 assume 0 != __utac_acc__Specification3_spec__1_~tmp~9; 399#L832-1 [2019-01-01 23:42:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:42:58,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:58,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:58,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1427585839, now seen corresponding path program 1 times [2019-01-01 23:42:58,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:58,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:42:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:42:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:42:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1021999211, now seen corresponding path program 1 times [2019-01-01 23:42:58,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:42:58,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:42:58,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:58,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:42:58,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:42:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:42:59,043 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:42:59,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:42:59,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:42:59,268 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-01 23:42:59,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:42:59,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:42:59,358 INFO L87 Difference]: Start difference. First operand 198 states and 288 transitions. cyclomatic complexity: 93 Second operand 5 states. [2019-01-01 23:43:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:43:00,390 INFO L93 Difference]: Finished difference Result 686 states and 1012 transitions. [2019-01-01 23:43:00,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:43:00,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 1012 transitions. [2019-01-01 23:43:00,400 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 494 [2019-01-01 23:43:00,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 686 states and 1012 transitions. [2019-01-01 23:43:00,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 686 [2019-01-01 23:43:00,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 686 [2019-01-01 23:43:00,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 686 states and 1012 transitions. [2019-01-01 23:43:00,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:43:00,415 INFO L705 BuchiCegarLoop]: Abstraction has 686 states and 1012 transitions. [2019-01-01 23:43:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states and 1012 transitions. [2019-01-01 23:43:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 390. [2019-01-01 23:43:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-01-01 23:43:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 562 transitions. [2019-01-01 23:43:00,446 INFO L728 BuchiCegarLoop]: Abstraction has 390 states and 562 transitions. [2019-01-01 23:43:00,447 INFO L608 BuchiCegarLoop]: Abstraction has 390 states and 562 transitions. [2019-01-01 23:43:00,447 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:43:00,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 390 states and 562 transitions. [2019-01-01 23:43:00,451 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 272 [2019-01-01 23:43:00,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:43:00,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:43:00,452 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:43:00,452 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:43:00,452 INFO L794 eck$LassoCheckResult]: Stem: 1355#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(13);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(110, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(102, #t~string48.base, 2 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 3 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string50.base, #t~string50.offset, 1);call write~init~int(80, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(117, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(109, #t~string50.base, 3 + #t~string50.offset, 1);call write~init~int(112, #t~string50.base, 4 + #t~string50.offset, 1);call write~init~int(58, #t~string50.base, 5 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 6 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(110, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 2 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 3 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string56.base, #t~string56.offset, 1);call write~init~int(32, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string58.base, #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 1 + #t~string58.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(13);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string68.base, #t~string68.offset, 1);call write~init~int(77, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(101, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(116, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(104, #t~string68.base, 4 + #t~string68.offset, 1);call write~init~int(58, #t~string68.base, 5 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 6 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string70.base, #t~string70.offset, 1);call write~init~int(82, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(73, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(84, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string72.base, #t~string72.offset, 1);call write~init~int(75, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string74.base, #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 1 + #t~string74.offset, 1); 1247#L-1 havoc main_#res;havoc main_#t~ret60, main_~retValue_acc~6, main_~tmp~8;havoc main_~retValue_acc~6;havoc main_~tmp~8; 1248#L873 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 1304#L881 main_#t~ret60 := valid_product_#res;main_~tmp~8 := main_#t~ret60;havoc main_#t~ret60; 1283#L802 assume 0 != main_~tmp~8; 1284#L776 havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1356#L832-1 [2019-01-01 23:43:00,457 INFO L796 eck$LassoCheckResult]: Loop: 1356#L832-1 assume !false; 1495#L423 assume test_~splverifierCounter~0 < 4; 1338#L424 test_~tmp~3 := test_#t~nondet35;havoc test_#t~nondet35; 1339#L432 assume !(0 != test_~tmp~3); 1274#L432-1 test_~tmp___0~0 := test_#t~nondet36;havoc test_#t~nondet36; 1260#L442 assume !(0 != test_~tmp___0~0); 1261#L442-1 test_~tmp___2~0 := test_#t~nondet37;havoc test_#t~nondet37; 1624#L452 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1294#L460-1 assume !(0 != ~pumpRunning~0); 1255#L497 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret40, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 1256#L555 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret39, processEnvironment__wrappee__methaneQuery_~tmp~4;havoc processEnvironment__wrappee__methaneQuery_~tmp~4; 1306#L529-1 assume !(0 != ~pumpRunning~0); 1243#L504 havoc __utac_acc__Specification3_spec__1_#t~ret61, __utac_acc__Specification3_spec__1_#t~ret62, __utac_acc__Specification3_spec__1_#t~ret63, __utac_acc__Specification3_spec__1_~tmp~9, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~9;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~9;havoc isMethaneLevelCritical_~retValue_acc~9;isMethaneLevelCritical_~retValue_acc~9 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~9; 1501#L929-1 __utac_acc__Specification3_spec__1_#t~ret61 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~9 := __utac_acc__Specification3_spec__1_#t~ret61;havoc __utac_acc__Specification3_spec__1_#t~ret61; 1500#L826 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~9);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 1499#L961 __utac_acc__Specification3_spec__1_#t~ret62 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret62;havoc __utac_acc__Specification3_spec__1_#t~ret62; 1496#L832 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 1356#L832-1 [2019-01-01 23:43:00,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:00,457 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:43:00,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:00,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:00,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:43:00,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1815416189, now seen corresponding path program 1 times [2019-01-01 23:43:00,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:00,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:00,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:00,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:43:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:43:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1406261347, now seen corresponding path program 1 times [2019-01-01 23:43:00,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:43:00,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:43:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:00,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:43:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:43:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:43:01,935 WARN L181 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-01-01 23:43:02,330 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:43:29,825 WARN L181 SmtUtils]: Spent 27.48 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:43:42,600 WARN L181 SmtUtils]: Spent 12.77 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:43:42,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:43:42 BoogieIcfgContainer [2019-01-01 23:43:42,682 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:43:42,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:43:42,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:43:42,683 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:43:42,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:42:56" (3/4) ... [2019-01-01 23:43:42,689 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:43:42,793 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:43:42,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:43:42,794 INFO L168 Benchmark]: Toolchain (without parser) took 48657.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -343.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:43:42,797 INFO L168 Benchmark]: CDTParser took 0.16 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:43:42,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -133.2 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:42,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:43:42,799 INFO L168 Benchmark]: Boogie Preprocessor took 65.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:43:42,801 INFO L168 Benchmark]: RCFGBuilder took 1479.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:42,803 INFO L168 Benchmark]: BuchiAutomizer took 46131.90 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -279.3 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:42,810 INFO L168 Benchmark]: Witness Printer took 110.75 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:43:42,818 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.16 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 787.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -133.2 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1479.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46131.90 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -279.3 MB). Peak memory consumption was 413.9 MB. Max. memory is 11.5 GB. * Witness Printer took 110.75 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 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 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 390 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 44.4s. Construction of modules took 0.8s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 298 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 390 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 368 SDtfs, 719 SDslu, 781 SDs, 0 SdLazy, 89 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI1 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: 422]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=8642} State at position 1 is {NULL=0, NULL=0, retValue_acc=1, NULL=8642, NULL=-17, NULL=0, retValue_acc=0, NULL=-23, NULL=-15, methaneLevelCritical=0, tmp=0, NULL=0, NULL=0, NULL=-22, tmp___1=0, NULL=-12, NULL=-6, NULL=-4, NULL=-10, cleanupTimeShifts=4, NULL=-13, NULL=-18, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ae46fd6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@248da45=59, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16b36401=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61425c86=0, tmp___0=1, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b033abd=0, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@273cef09=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@373e49d1=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@780038a9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b32485c=0, NULL=-7, NULL=0, tmp___0=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, NULL=-3, head=0, pumpRunning=0, \result=0, NULL=-20, NULL=-2, NULL=-24, NULL=0, NULL=-21, NULL=0, tmp=1, NULL=0, NULL=-19, NULL=-5, NULL=0, retValue_acc=1, NULL=0, tmp___2=59, NULL=-8, splverifierCounter=0, \result=0, NULL=8641, tmp___1=0, head=0, NULL=0, tmp=0, NULL=-1, NULL=-14, NULL=0, NULL=-16, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f11b510=0, NULL=-9, NULL=0, tmp=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L489] int pumpRunning = 0; [L490] int systemActive = 1; [L717] int cleanupTimeShifts = 4; [L886] int waterLevel = 1; [L887] int methaneLevelCritical = 0; [L793] int retValue_acc ; [L794] int tmp ; [L877] int retValue_acc ; [L880] retValue_acc = 1 [L881] return (retValue_acc); [L800] tmp = valid_product() [L802] COND TRUE \read(tmp) [L413] int splverifierCounter ; [L414] int tmp ; [L415] int tmp___0 ; [L416] int tmp___1 ; [L417] int tmp___2 ; [L420] splverifierCounter = 0 Loop: [L422] COND TRUE 1 [L424] COND TRUE splverifierCounter < 4 [L430] tmp = __VERIFIER_nondet_int() [L432] COND FALSE !(\read(tmp)) [L440] tmp___0 = __VERIFIER_nondet_int() [L442] COND FALSE !(\read(tmp___0)) [L450] tmp___2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp___2) [L703] systemActive = 1 [L497] COND FALSE !(\read(pumpRunning)) [L504] COND TRUE \read(systemActive) [L552] int tmp ; [L555] COND FALSE !(\read(pumpRunning)) [L526] int tmp ; [L529] COND FALSE !(\read(pumpRunning)) [L818] int tmp ; [L819] int tmp___0 ; [L820] int tmp___1 ; [L925] int retValue_acc ; [L928] retValue_acc = methaneLevelCritical [L929] return (retValue_acc); [L824] tmp = isMethaneLevelCritical() [L826] COND FALSE !(\read(tmp)) [L957] int retValue_acc ; [L960] retValue_acc = waterLevel [L961] return (retValue_acc); [L830] tmp___0 = getWaterLevel() [L832] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...