./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product46_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_product46_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 e7c5f28f8e853ca099a40c34c7e85dac8d6464b4 ............................................................................................................................................................................................................................................................................................................................................................................................................................. 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:46,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:35:46,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:35:46,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:35:46,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:35:46,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:35:46,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:35:46,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:35:46,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:35:46,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:35:46,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:35:46,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:35:46,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:35:46,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:35:46,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:35:46,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:35:46,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:35:46,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:35:46,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:35:46,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:35:46,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:35:46,160 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:35:46,162 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:35:46,163 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:35:46,163 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:35:46,164 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:35:46,165 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:35:46,169 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:35:46,170 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:35:46,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:35:46,175 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:35:46,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:35:46,176 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:35:46,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:35:46,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:35:46,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:35:46,180 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:46,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:35:46,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:35:46,215 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:35:46,216 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:35:46,216 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:35:46,217 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:35:46,217 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:35:46,218 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:35:46,218 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:35:46,219 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:35:46,219 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:35:46,219 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:35:46,219 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:35:46,219 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:35:46,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:35:46,220 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:35:46,220 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:35:46,220 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:35:46,220 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:35:46,220 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:35:46,220 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:35:46,221 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:35:46,221 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:35:46,221 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:35:46,221 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:35:46,221 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:35:46,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:35:46,222 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:35:46,222 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:35:46,222 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:35:46,222 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:35:46,225 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:35:46,225 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 -> e7c5f28f8e853ca099a40c34c7e85dac8d6464b4 [2019-01-01 23:35:46,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:35:46,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:35:46,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:35:46,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:35:46,304 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:35:46,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product46_true-unreach-call_false-termination.cil.c [2019-01-01 23:35:46,372 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e4a49be/6c263552ee764fd2a04cde74ed6cc8f5/FLAG0c95d054d [2019-01-01 23:35:46,931 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:35:46,932 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product46_true-unreach-call_false-termination.cil.c [2019-01-01 23:35:46,956 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e4a49be/6c263552ee764fd2a04cde74ed6cc8f5/FLAG0c95d054d [2019-01-01 23:35:47,218 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e4a49be/6c263552ee764fd2a04cde74ed6cc8f5 [2019-01-01 23:35:47,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:35:47,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:35:47,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:35:47,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:35:47,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:35:47,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:35:47" (1/1) ... [2019-01-01 23:35:47,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a354ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:47, skipping insertion in model container [2019-01-01 23:35:47,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:35:47" (1/1) ... [2019-01-01 23:35:47,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:35:47,312 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:35:47,669 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:35:47,704 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:35:47,908 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:35:47,955 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:35:47,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:47 WrapperNode [2019-01-01 23:35:47,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:35:47,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:35:47,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:35:47,956 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:35:47,963 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:47" (1/1) ... [2019-01-01 23:35:47,983 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:47" (1/1) ... [2019-01-01 23:35:48,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:35:48,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:35:48,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:35:48,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:35:48,048 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:47" (1/1) ... [2019-01-01 23:35:48,048 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:47" (1/1) ... [2019-01-01 23:35:48,057 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:47" (1/1) ... [2019-01-01 23:35:48,058 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:47" (1/1) ... [2019-01-01 23:35:48,089 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:47" (1/1) ... [2019-01-01 23:35:48,111 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:47" (1/1) ... [2019-01-01 23:35:48,118 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:47" (1/1) ... [2019-01-01 23:35:48,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:35:48,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:35:48,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:35:48,128 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:35:48,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:47" (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:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:35:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:35:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:35:48,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:35:49,588 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:35:49,589 INFO L280 CfgBuilder]: Removed 194 assue(true) statements. [2019-01-01 23:35:49,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:35:49 BoogieIcfgContainer [2019-01-01 23:35:49,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:35:49,592 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:35:49,592 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:35:49,596 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:35:49,600 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:35:49,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:35:47" (1/3) ... [2019-01-01 23:35:49,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a5b47d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:35:49, skipping insertion in model container [2019-01-01 23:35:49,602 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:35:49,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:35:47" (2/3) ... [2019-01-01 23:35:49,603 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a5b47d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:35:49, skipping insertion in model container [2019-01-01 23:35:49,603 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:35:49,603 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:35:49" (3/3) ... [2019-01-01 23:35:49,606 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec1_product46_true-unreach-call_false-termination.cil.c [2019-01-01 23:35:49,668 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:35:49,668 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:35:49,669 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:35:49,669 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:35:49,669 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:35:49,669 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:35:49,669 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:35:49,670 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:35:49,670 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:35:49,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states. [2019-01-01 23:35:49,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-01 23:35:49,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:35:49,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:35:49,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:35:49,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:35:49,739 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:35:49,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states. [2019-01-01 23:35:49,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-01 23:35:49,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:35:49,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:35:49,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:35:49,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:35:49,758 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(110, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 2 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 3 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(80, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(117, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(109, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(112, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(110, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 2 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 3 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(32, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string23.base, #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 1 + #t~string23.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(13);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string32.base, #t~string32.offset, 1);call write~init~int(77, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(101, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(116, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(104, #t~string32.base, 4 + #t~string32.offset, 1);call write~init~int(58, #t~string32.base, 5 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 6 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string34.base, #t~string34.offset, 1);call write~init~int(82, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(73, #t~string34.base, 2 + #t~string34.offset, 1);call write~init~int(84, #t~string34.base, 3 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 4 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string36.base, #t~string36.offset, 1);call write~init~int(75, #t~string36.base, 1 + #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 2 + #t~string36.offset, 1);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string38.base, #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 1 + #t~string38.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 15#L-1true havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 120#L445true havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 25#L453true main_#t~ret25 := valid_product_#res;main_~tmp~5 := main_#t~ret25;havoc main_#t~ret25; 3#L409true assume 0 != main_~tmp~5; 67#L383true havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 26#L475-1true [2019-01-01 23:35:49,759 INFO L796 eck$LassoCheckResult]: Loop: 26#L475-1true assume !false; 39#L56true assume test_~splverifierCounter~0 < 4; 128#L57true test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 19#L65true assume !(0 != test_~tmp~0); 17#L65-1true test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 49#L75true assume !(0 != test_~tmp___0~0); 46#L75-1true test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 109#L85true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 97#L93-2true assume !(0 != ~pumpRunning~0); 35#L128true assume !(0 != ~systemActive~0); 61#L135true havoc __utac_acc__Specification1_spec__1_#t~ret27, __utac_acc__Specification1_spec__1_#t~ret28, __utac_acc__Specification1_spec__1_~tmp~6, __utac_acc__Specification1_spec__1_~tmp___0~2;havoc __utac_acc__Specification1_spec__1_~tmp~6;havoc __utac_acc__Specification1_spec__1_~tmp___0~2;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~6;havoc isMethaneLevelCritical_~retValue_acc~6;isMethaneLevelCritical_~retValue_acc~6 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~6; 63#L537-3true __utac_acc__Specification1_spec__1_#t~ret27 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~6 := __utac_acc__Specification1_spec__1_#t~ret27;havoc __utac_acc__Specification1_spec__1_#t~ret27; 22#L475true assume !(0 != __utac_acc__Specification1_spec__1_~tmp~6); 26#L475-1true [2019-01-01 23:35:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:35:49,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:49,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:50,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:50,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1678359101, now seen corresponding path program 1 times [2019-01-01 23:35:50,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:50,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:50,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:50,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:35:50,754 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:50,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:35:50,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:35:50,762 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:35:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:35:50,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:35:50,783 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-01-01 23:35:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:35:50,900 INFO L93 Difference]: Finished difference Result 126 states and 179 transitions. [2019-01-01 23:35:50,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:35:50,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 179 transitions. [2019-01-01 23:35:50,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2019-01-01 23:35:50,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 119 states and 171 transitions. [2019-01-01 23:35:50,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-01 23:35:50,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-01-01 23:35:50,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 171 transitions. [2019-01-01 23:35:50,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:35:50,934 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 171 transitions. [2019-01-01 23:35:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 171 transitions. [2019-01-01 23:35:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-01 23:35:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 23:35:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2019-01-01 23:35:50,977 INFO L728 BuchiCegarLoop]: Abstraction has 119 states and 171 transitions. [2019-01-01 23:35:50,977 INFO L608 BuchiCegarLoop]: Abstraction has 119 states and 171 transitions. [2019-01-01 23:35:50,977 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:35:50,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 171 transitions. [2019-01-01 23:35:50,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2019-01-01 23:35:50,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:35:50,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:35:50,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:35:50,983 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:50,983 INFO L794 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(110, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 2 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 3 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(80, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(117, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(109, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(112, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(110, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 2 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 3 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(32, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string23.base, #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 1 + #t~string23.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(13);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string32.base, #t~string32.offset, 1);call write~init~int(77, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(101, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(116, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(104, #t~string32.base, 4 + #t~string32.offset, 1);call write~init~int(58, #t~string32.base, 5 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 6 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string34.base, #t~string34.offset, 1);call write~init~int(82, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(73, #t~string34.base, 2 + #t~string34.offset, 1);call write~init~int(84, #t~string34.base, 3 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 4 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string36.base, #t~string36.offset, 1);call write~init~int(75, #t~string36.base, 1 + #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 2 + #t~string36.offset, 1);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string38.base, #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 1 + #t~string38.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 283#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 284#L445 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 307#L453 main_#t~ret25 := valid_product_#res;main_~tmp~5 := main_#t~ret25;havoc main_#t~ret25; 261#L409 assume 0 != main_~tmp~5; 262#L383 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 300#L475-1 [2019-01-01 23:35:50,986 INFO L796 eck$LassoCheckResult]: Loop: 300#L475-1 assume !false; 308#L56 assume test_~splverifierCounter~0 < 4; 328#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 292#L65 assume !(0 != test_~tmp~0); 290#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 291#L75 assume !(0 != test_~tmp___0~0); 327#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 336#L85 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 372#L93-2 assume !(0 != ~pumpRunning~0); 323#L128 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret5, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 266#L186 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret4, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 267#L160-1 assume !(0 == ~pumpRunning~0); 305#L135 havoc __utac_acc__Specification1_spec__1_#t~ret27, __utac_acc__Specification1_spec__1_#t~ret28, __utac_acc__Specification1_spec__1_~tmp~6, __utac_acc__Specification1_spec__1_~tmp___0~2;havoc __utac_acc__Specification1_spec__1_~tmp~6;havoc __utac_acc__Specification1_spec__1_~tmp___0~2;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~6;havoc isMethaneLevelCritical_~retValue_acc~6;isMethaneLevelCritical_~retValue_acc~6 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~6; 349#L537-3 __utac_acc__Specification1_spec__1_#t~ret27 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~6 := __utac_acc__Specification1_spec__1_#t~ret27;havoc __utac_acc__Specification1_spec__1_#t~ret27; 299#L475 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~6); 300#L475-1 [2019-01-01 23:35:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:35:50,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:50,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:50,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1075674043, now seen corresponding path program 1 times [2019-01-01 23:35:51,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:51,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:35:51,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:35:51,467 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:51,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:35:51,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:35:51,470 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:35:51,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:35:51,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:35:51,473 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. cyclomatic complexity: 54 Second operand 3 states. [2019-01-01 23:35:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:35:51,905 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2019-01-01 23:35:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:35:51,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 219 transitions. [2019-01-01 23:35:51,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2019-01-01 23:35:51,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 219 transitions. [2019-01-01 23:35:51,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2019-01-01 23:35:51,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2019-01-01 23:35:51,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 219 transitions. [2019-01-01 23:35:51,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:35:51,915 INFO L705 BuchiCegarLoop]: Abstraction has 160 states and 219 transitions. [2019-01-01 23:35:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 219 transitions. [2019-01-01 23:35:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-01-01 23:35:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-01 23:35:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 219 transitions. [2019-01-01 23:35:51,926 INFO L728 BuchiCegarLoop]: Abstraction has 160 states and 219 transitions. [2019-01-01 23:35:51,926 INFO L608 BuchiCegarLoop]: Abstraction has 160 states and 219 transitions. [2019-01-01 23:35:51,926 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:35:51,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 219 transitions. [2019-01-01 23:35:51,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2019-01-01 23:35:51,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:35:51,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:35:51,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:35:51,931 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:51,932 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(110, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 2 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 3 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(80, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(117, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(109, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(112, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(110, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 2 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 3 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(32, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string23.base, #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 1 + #t~string23.offset, 1);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(13);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string32.base, #t~string32.offset, 1);call write~init~int(77, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(101, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(116, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(104, #t~string32.base, 4 + #t~string32.offset, 1);call write~init~int(58, #t~string32.base, 5 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 6 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string34.base, #t~string34.offset, 1);call write~init~int(82, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(73, #t~string34.base, 2 + #t~string34.offset, 1);call write~init~int(84, #t~string34.base, 3 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 4 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string36.base, #t~string36.offset, 1);call write~init~int(75, #t~string36.base, 1 + #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 2 + #t~string36.offset, 1);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string38.base, #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 1 + #t~string38.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25); 567#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 568#L445 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 590#L453 main_#t~ret25 := valid_product_#res;main_~tmp~5 := main_#t~ret25;havoc main_#t~ret25; 548#L409 assume 0 != main_~tmp~5; 549#L383 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 584#L475-1 [2019-01-01 23:35:51,932 INFO L796 eck$LassoCheckResult]: Loop: 584#L475-1 assume !false; 591#L56 assume test_~splverifierCounter~0 < 4; 609#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 576#L65 assume !(0 != test_~tmp~0); 574#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 575#L75 assume !(0 != test_~tmp___0~0); 608#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 619#L85 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 658#L93-2 assume !(0 != ~pumpRunning~0); 604#L128 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret5, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 546#L186 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret4, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 547#L160-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret24, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~8;havoc isHighWaterSensorDry_~retValue_acc~8; 561#L577-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~8 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~8; 562#L582-1 isHighWaterLevel_#t~ret24 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret24;havoc isHighWaterLevel_#t~ret24; 606#L305-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 656#L305-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 649#L311-1 processEnvironment__wrappee__methaneQuery_#t~ret4 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~1 := processEnvironment__wrappee__methaneQuery_#t~ret4;havoc processEnvironment__wrappee__methaneQuery_#t~ret4; 587#L164-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~1); 588#L135 havoc __utac_acc__Specification1_spec__1_#t~ret27, __utac_acc__Specification1_spec__1_#t~ret28, __utac_acc__Specification1_spec__1_~tmp~6, __utac_acc__Specification1_spec__1_~tmp___0~2;havoc __utac_acc__Specification1_spec__1_~tmp~6;havoc __utac_acc__Specification1_spec__1_~tmp___0~2;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~6;havoc isMethaneLevelCritical_~retValue_acc~6;isMethaneLevelCritical_~retValue_acc~6 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~6; 633#L537-3 __utac_acc__Specification1_spec__1_#t~ret27 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~6 := __utac_acc__Specification1_spec__1_#t~ret27;havoc __utac_acc__Specification1_spec__1_#t~ret27; 583#L475 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~6); 584#L475-1 [2019-01-01 23:35:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:51,932 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:35:51,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:51,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:51,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:51,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:52,272 INFO L82 PathProgramCache]: Analyzing trace with hash -515194543, now seen corresponding path program 1 times [2019-01-01 23:35:52,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:52,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:52,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:52,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:35:52,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:35:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash -59123349, now seen corresponding path program 1 times [2019-01-01 23:35:52,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:35:52,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:35:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:52,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:35:52,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:35:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:35:53,454 WARN L181 SmtUtils]: Spent 890.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-01-01 23:35:53,729 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 23:36:26,273 WARN L181 SmtUtils]: Spent 32.52 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:36:42,678 WARN L181 SmtUtils]: Spent 16.40 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:36:42,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:36:42 BoogieIcfgContainer [2019-01-01 23:36:42,776 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:36:42,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:36:42,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:36:42,777 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:36:42,777 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:49" (3/4) ... [2019-01-01 23:36:42,780 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:36:42,883 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:36:42,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:36:42,884 INFO L168 Benchmark]: Toolchain (without parser) took 55659.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 954.0 MB in the beginning and 923.3 MB in the end (delta: 30.7 MB). Peak memory consumption was 330.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:42,886 INFO L168 Benchmark]: CDTParser took 0.15 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:42,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -135.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:42,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.61 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:36:42,888 INFO L168 Benchmark]: Boogie Preprocessor took 91.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:42,889 INFO L168 Benchmark]: RCFGBuilder took 1462.86 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: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:42,891 INFO L168 Benchmark]: BuchiAutomizer took 53184.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.0 GB in the beginning and 923.3 MB in the end (delta: 106.0 MB). Peak memory consumption was 410.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:36:42,892 INFO L168 Benchmark]: Witness Printer took 106.64 ms. Allocated memory is still 1.3 GB. Free memory was 923.3 MB in the beginning and 923.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 23:36:42,898 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.15 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 728.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -135.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.61 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 91.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1462.86 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: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 53184.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.0 GB in the beginning and 923.3 MB in the end (delta: 106.0 MB). Peak memory consumption was 410.6 MB. Max. memory is 11.5 GB. * Witness Printer took 106.64 ms. Allocated memory is still 1.3 GB. Free memory was 923.3 MB in the beginning and 923.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 3 locations. The remainder module has 160 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 53.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 52.2s. Construction of modules took 0.4s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 160 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 332 SDtfs, 304 SDslu, 57 SDs, 0 SdLazy, 33 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 55]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=-1} State at position 1 is {NULL=-12, NULL=0, NULL=0, NULL=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25d803b7=0, retValue_acc=0, NULL=-18, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5af90a45=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@705b31c5=74, NULL=0, NULL=-22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c808948=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22e0e4a7=0, NULL=-10, methaneLevelCritical=0, tmp___0=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@556a5acb=0, NULL=-5, NULL=0, tmp___1=0, NULL=-19, tmp___0=0, NULL=-17, cleanupTimeShifts=4, tmp=0, NULL=-7, NULL=-14, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-15, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1152efa=0, NULL=-23, retValue_acc=0, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fd53053=0, NULL=-25, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, retValue_acc=1, NULL=-21, \result=0, NULL=-13, tmp=0, NULL=0, NULL=0, NULL=-27, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d58cefd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@782ba4d=0, NULL=0, tmp=1, NULL=0, retValue_acc=1, \result=1, NULL=-28, NULL=-16, NULL=0, tmp=1, tmp___2=74, NULL=-6, splverifierCounter=0, NULL=0, NULL=0, \result=0, NULL=-29, NULL=-11, NULL=-24, tmp=0, head=0, tmp=0, NULL=-8, NULL=-20, NULL=0, NULL=0, NULL=-26, NULL=-9} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L120] int pumpRunning = 0; [L121] int systemActive = 1; [L324] int cleanupTimeShifts = 4; [L494] int waterLevel = 1; [L495] int methaneLevelCritical = 0; [L757] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L400] int retValue_acc ; [L401] int tmp ; [L449] int retValue_acc ; [L452] retValue_acc = 1 [L453] return (retValue_acc); [L407] tmp = valid_product() [L409] COND TRUE \read(tmp) [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 Loop: [L55] COND TRUE 1 [L57] COND TRUE splverifierCounter < 4 [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) [L319] systemActive = 1 [L128] COND FALSE !(\read(pumpRunning)) [L135] COND TRUE \read(systemActive) [L183] int tmp ; [L186] COND FALSE !(\read(pumpRunning)) [L157] int tmp ; [L160] COND TRUE ! pumpRunning [L297] int retValue_acc ; [L298] int tmp ; [L299] int tmp___0 ; [L574] int retValue_acc ; [L577] COND TRUE waterLevel < 2 [L578] retValue_acc = 1 [L579] return (retValue_acc); [L303] tmp = isHighWaterSensorDry() [L305] COND TRUE \read(tmp) [L306] tmp___0 = 0 [L310] retValue_acc = tmp___0 [L311] return (retValue_acc); [L162] tmp = isHighWaterLevel() [L164] COND FALSE !(\read(tmp)) [L468] int tmp ; [L469] int tmp___0 ; [L533] int retValue_acc ; [L536] retValue_acc = methaneLevelCritical [L537] return (retValue_acc); [L473] tmp = isMethaneLevelCritical() [L475] COND FALSE !(\read(tmp)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...