./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product41_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_spec2_product41_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 fa3516ef35b9a868c2359cecbd34fc3153ca14ae ....................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:39:25,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:39:25,121 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:39:25,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:39:25,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:39:25,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:39:25,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:39:25,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:39:25,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:39:25,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:39:25,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:39:25,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:39:25,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:39:25,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:39:25,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:39:25,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:39:25,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:39:25,155 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:39:25,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:39:25,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:39:25,165 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:39:25,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:39:25,174 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:39:25,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:39:25,179 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:39:25,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:39:25,183 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:39:25,184 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:39:25,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:39:25,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:39:25,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:39:25,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:39:25,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:39:25,191 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:39:25,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:39:25,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:39:25,193 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:39:25,222 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:39:25,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:39:25,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:39:25,229 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:39:25,229 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:39:25,229 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:39:25,229 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:39:25,229 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:39:25,230 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:39:25,231 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:39:25,231 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:39:25,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:39:25,231 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:39:25,231 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:39:25,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:39:25,232 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:39:25,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:39:25,232 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:39:25,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:39:25,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:39:25,232 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:39:25,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:39:25,236 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:39:25,236 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:39:25,236 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:39:25,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:39:25,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:39:25,237 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:39:25,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:39:25,237 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:39:25,237 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:39:25,239 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:39:25,240 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 -> fa3516ef35b9a868c2359cecbd34fc3153ca14ae [2019-01-01 23:39:25,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:39:25,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:39:25,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:39:25,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:39:25,311 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:39:25,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product41_false-unreach-call_false-termination.cil.c [2019-01-01 23:39:25,378 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78f88d464/91e926032abd424bbdbd383ae2869e2d/FLAG426d26eaa [2019-01-01 23:39:25,854 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:39:25,856 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product41_false-unreach-call_false-termination.cil.c [2019-01-01 23:39:25,870 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78f88d464/91e926032abd424bbdbd383ae2869e2d/FLAG426d26eaa [2019-01-01 23:39:26,178 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78f88d464/91e926032abd424bbdbd383ae2869e2d [2019-01-01 23:39:26,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:39:26,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:39:26,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:39:26,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:39:26,190 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:39:26,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:39:26" (1/1) ... [2019-01-01 23:39:26,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e38ab91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26, skipping insertion in model container [2019-01-01 23:39:26,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:39:26" (1/1) ... [2019-01-01 23:39:26,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:39:26,254 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:39:26,597 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:39:26,627 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:39:26,712 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:39:26,749 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:39:26,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26 WrapperNode [2019-01-01 23:39:26,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:39:26,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:39:26,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:39:26,751 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:39:26,832 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:39:26" (1/1) ... [2019-01-01 23:39:26,860 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:39:26" (1/1) ... [2019-01-01 23:39:26,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:39:26,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:39:26,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:39:26,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:39:26,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26" (1/1) ... [2019-01-01 23:39:26,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26" (1/1) ... [2019-01-01 23:39:26,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26" (1/1) ... [2019-01-01 23:39:26,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26" (1/1) ... [2019-01-01 23:39:26,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26" (1/1) ... [2019-01-01 23:39:26,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26" (1/1) ... [2019-01-01 23:39:26,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26" (1/1) ... [2019-01-01 23:39:26,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:39:26,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:39:26,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:39:26,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:39:26,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26" (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:39:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:39:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:39:27,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:39:27,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:39:28,173 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:39:28,173 INFO L280 CfgBuilder]: Removed 116 assue(true) statements. [2019-01-01 23:39:28,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:39:28 BoogieIcfgContainer [2019-01-01 23:39:28,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:39:28,175 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:39:28,175 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:39:28,179 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:39:28,180 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:39:28,180 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:39:26" (1/3) ... [2019-01-01 23:39:28,181 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@392000ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:39:28, skipping insertion in model container [2019-01-01 23:39:28,181 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:39:28,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:39:26" (2/3) ... [2019-01-01 23:39:28,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@392000ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:39:28, skipping insertion in model container [2019-01-01 23:39:28,182 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:39:28,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:39:28" (3/3) ... [2019-01-01 23:39:28,184 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec2_product41_false-unreach-call_false-termination.cil.c [2019-01-01 23:39:28,244 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:39:28,245 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:39:28,245 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:39:28,246 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:39:28,246 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:39:28,246 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:39:28,246 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:39:28,247 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:39:28,247 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:39:28,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states. [2019-01-01 23:39:28,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2019-01-01 23:39:28,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:39:28,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:39:28,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:39:28,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:39:28,309 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:39:28,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states. [2019-01-01 23:39:28,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2019-01-01 23:39:28,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:39:28,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:39:28,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:39:28,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:39:28,323 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~methAndRunningLastTime~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(13);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(110, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 2 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(102, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(102, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 3 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string47.base, #t~string47.offset, 1);call write~init~int(80, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(117, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(109, #t~string47.base, 3 + #t~string47.offset, 1);call write~init~int(112, #t~string47.base, 4 + #t~string47.offset, 1);call write~init~int(58, #t~string47.base, 5 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 6 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(110, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 2 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(102, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(102, #t~string51.base, 2 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 3 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string53.base, #t~string53.offset, 1);call write~init~int(32, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string55.base, #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 1 + #t~string55.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(13);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(77, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(101, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(116, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(104, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string62.base, #t~string62.offset, 1);call write~init~int(82, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(73, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(84, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 4 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(75, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 1 + #t~string66.offset, 1);~cleanupTimeShifts~0 := 4; 10#L-1true havoc main_#res;havoc main_#t~ret72, main_~retValue_acc~11, main_~tmp~8;havoc main_~retValue_acc~11;havoc main_~tmp~8; 47#L813true havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 80#L821true main_#t~ret72 := valid_product_#res;main_~tmp~8 := main_#t~ret72;havoc main_#t~ret72; 26#L918true assume 0 != main_~tmp~8; 61#L894true ~methAndRunningLastTime~0 := 0; 49#L49true havoc test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 46#L60-1true [2019-01-01 23:39:28,323 INFO L796 eck$LassoCheckResult]: Loop: 46#L60-1true assume !false; 85#L734true assume test_~splverifierCounter~0 < 4; 31#L735true test_~tmp~7 := test_#t~nondet67;havoc test_#t~nondet67; 38#L743true assume !(0 != test_~tmp~7); 41#L743-1true test_~tmp___0~2 := test_#t~nondet68;havoc test_#t~nondet68; 18#L753true assume !(0 != test_~tmp___0~2); 21#L753-1true test_~tmp___2~0 := test_#t~nondet69;havoc test_#t~nondet69; 89#L763true assume 0 != test_~tmp___2~0; 59#L769-2true assume !(0 != ~pumpRunning~0); 45#L462true assume !(0 != ~systemActive~0); 58#L469true havoc __utac_acc__Specification2_spec__2_#t~ret0, __utac_acc__Specification2_spec__2_#t~ret1, __utac_acc__Specification2_spec__2_~tmp~0, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~0;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;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; 62#L671-1true __utac_acc__Specification2_spec__2_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~0 := __utac_acc__Specification2_spec__2_#t~ret0;havoc __utac_acc__Specification2_spec__2_#t~ret0; 51#L60true assume !(0 != __utac_acc__Specification2_spec__2_~tmp~0);~methAndRunningLastTime~0 := 0; 46#L60-1true [2019-01-01 23:39:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:39:28,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:39:28,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:39:28,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:39:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:39:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:29,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:39:29,302 INFO L82 PathProgramCache]: Analyzing trace with hash 3091786, now seen corresponding path program 1 times [2019-01-01 23:39:29,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:39:29,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:39:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:29,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:39:29,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:29,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:39:29,321 INFO L82 PathProgramCache]: Analyzing trace with hash 836388292, now seen corresponding path program 1 times [2019-01-01 23:39:29,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:39:29,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:39:29,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:29,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:39:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:39:29,746 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:39:29,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:39:29,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:39:29,898 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 23:39:29,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:39:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:39:29,979 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 6 states. [2019-01-01 23:39:30,219 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:39:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:39:30,348 INFO L93 Difference]: Finished difference Result 88 states and 122 transitions. [2019-01-01 23:39:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:39:30,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 122 transitions. [2019-01-01 23:39:30,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:39:30,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 81 states and 115 transitions. [2019-01-01 23:39:30,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2019-01-01 23:39:30,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2019-01-01 23:39:30,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 115 transitions. [2019-01-01 23:39:30,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:39:30,381 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 115 transitions. [2019-01-01 23:39:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 115 transitions. [2019-01-01 23:39:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-01 23:39:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-01 23:39:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2019-01-01 23:39:30,431 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 115 transitions. [2019-01-01 23:39:30,432 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 115 transitions. [2019-01-01 23:39:30,432 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:39:30,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 115 transitions. [2019-01-01 23:39:30,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:39:30,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:39:30,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:39:30,438 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:39:30,438 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:39:30,438 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~methAndRunningLastTime~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(13);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(110, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 2 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(102, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(102, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 3 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string47.base, #t~string47.offset, 1);call write~init~int(80, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(117, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(109, #t~string47.base, 3 + #t~string47.offset, 1);call write~init~int(112, #t~string47.base, 4 + #t~string47.offset, 1);call write~init~int(58, #t~string47.base, 5 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 6 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(110, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 2 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(102, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(102, #t~string51.base, 2 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 3 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string53.base, #t~string53.offset, 1);call write~init~int(32, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string55.base, #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 1 + #t~string55.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(13);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(77, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(101, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(116, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(104, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string62.base, #t~string62.offset, 1);call write~init~int(82, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(73, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(84, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 4 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(75, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 1 + #t~string66.offset, 1);~cleanupTimeShifts~0 := 4; 207#L-1 havoc main_#res;havoc main_#t~ret72, main_~retValue_acc~11, main_~tmp~8;havoc main_~retValue_acc~11;havoc main_~tmp~8; 208#L813 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 253#L821 main_#t~ret72 := valid_product_#res;main_~tmp~8 := main_#t~ret72;havoc main_#t~ret72; 226#L918 assume 0 != main_~tmp~8; 227#L894 ~methAndRunningLastTime~0 := 0; 256#L49 havoc test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 210#L60-1 [2019-01-01 23:39:30,439 INFO L796 eck$LassoCheckResult]: Loop: 210#L60-1 assume !false; 252#L734 assume test_~splverifierCounter~0 < 4; 234#L735 test_~tmp~7 := test_#t~nondet67;havoc test_#t~nondet67; 235#L743 assume !(0 != test_~tmp~7); 244#L743-1 test_~tmp___0~2 := test_#t~nondet68;havoc test_#t~nondet68; 213#L753 assume !(0 != test_~tmp___0~2); 212#L753-1 test_~tmp___2~0 := test_#t~nondet69;havoc test_#t~nondet69; 214#L763 assume 0 != test_~tmp___2~0; 265#L769-2 assume !(0 != ~pumpRunning~0); 251#L462 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret37, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 215#L494 assume !(0 == ~pumpRunning~0); 217#L469 havoc __utac_acc__Specification2_spec__2_#t~ret0, __utac_acc__Specification2_spec__2_#t~ret1, __utac_acc__Specification2_spec__2_~tmp~0, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~0;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;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; 267#L671-1 __utac_acc__Specification2_spec__2_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~0 := __utac_acc__Specification2_spec__2_#t~ret0;havoc __utac_acc__Specification2_spec__2_#t~ret0; 257#L60 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~0);~methAndRunningLastTime~0 := 0; 210#L60-1 [2019-01-01 23:39:30,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:39:30,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:39:30,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:39:30,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:39:30,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:30,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:39:30,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:39:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash 54075937, now seen corresponding path program 1 times [2019-01-01 23:39:30,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:39:30,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:39:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:30,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:39:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:39:30,896 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:39:30,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:39:30,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:39:30,897 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:39:30,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:39:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:39:30,897 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-01-01 23:39:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:39:31,038 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2019-01-01 23:39:31,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:39:31,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 172 transitions. [2019-01-01 23:39:31,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 86 [2019-01-01 23:39:31,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 172 transitions. [2019-01-01 23:39:31,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2019-01-01 23:39:31,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2019-01-01 23:39:31,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 172 transitions. [2019-01-01 23:39:31,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:39:31,050 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 172 transitions. [2019-01-01 23:39:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 172 transitions. [2019-01-01 23:39:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-01 23:39:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-01 23:39:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2019-01-01 23:39:31,071 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 172 transitions. [2019-01-01 23:39:31,071 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 172 transitions. [2019-01-01 23:39:31,071 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:39:31,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 172 transitions. [2019-01-01 23:39:31,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 86 [2019-01-01 23:39:31,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:39:31,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:39:31,078 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:39:31,078 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] [2019-01-01 23:39:31,078 INFO L794 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~methAndRunningLastTime~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(13);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string43.base, #t~string43.offset, 1);call write~init~int(110, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 2 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(102, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(102, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 3 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string47.base, #t~string47.offset, 1);call write~init~int(80, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(117, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(109, #t~string47.base, 3 + #t~string47.offset, 1);call write~init~int(112, #t~string47.base, 4 + #t~string47.offset, 1);call write~init~int(58, #t~string47.base, 5 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 6 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(110, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 2 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(102, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(102, #t~string51.base, 2 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 3 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string53.base, #t~string53.offset, 1);call write~init~int(32, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string55.base, #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 1 + #t~string55.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(13);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(77, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(101, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(116, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(104, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string62.base, #t~string62.offset, 1);call write~init~int(82, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(73, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(84, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 4 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(75, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 1 + #t~string66.offset, 1);~cleanupTimeShifts~0 := 4; 417#L-1 havoc main_#res;havoc main_#t~ret72, main_~retValue_acc~11, main_~tmp~8;havoc main_~retValue_acc~11;havoc main_~tmp~8; 418#L813 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 468#L821 main_#t~ret72 := valid_product_#res;main_~tmp~8 := main_#t~ret72;havoc main_#t~ret72; 435#L918 assume 0 != main_~tmp~8; 436#L894 ~methAndRunningLastTime~0 := 0; 470#L49 havoc test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 424#L60-1 [2019-01-01 23:39:31,079 INFO L796 eck$LassoCheckResult]: Loop: 424#L60-1 assume !false; 467#L734 assume test_~splverifierCounter~0 < 4; 443#L735 test_~tmp~7 := test_#t~nondet67;havoc test_#t~nondet67; 444#L743 assume !(0 != test_~tmp~7); 457#L743-1 test_~tmp___0~2 := test_#t~nondet68;havoc test_#t~nondet68; 425#L753 assume !(0 != test_~tmp___0~2); 422#L753-1 test_~tmp___2~0 := test_#t~nondet69;havoc test_#t~nondet69; 426#L763 assume 0 != test_~tmp___2~0; 481#L769-2 assume !(0 != ~pumpRunning~0); 466#L462 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret37, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 427#L494 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret56, isHighWaterLevel_~retValue_acc~5, isHighWaterLevel_~tmp~6, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~5;havoc isHighWaterLevel_~tmp~6;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~8;havoc isHighWaterSensorDry_~retValue_acc~8; 428#L711 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~8 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~8; 410#L716 isHighWaterLevel_#t~ret56 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~6 := isHighWaterLevel_#t~ret56;havoc isHighWaterLevel_#t~ret56; 411#L614 assume 0 != isHighWaterLevel_~tmp~6;isHighWaterLevel_~tmp___0~1 := 0; 406#L614-2 isHighWaterLevel_~retValue_acc~5 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~5; 407#L620 processEnvironment_#t~ret37 := isHighWaterLevel_#res;processEnvironment_~tmp~4 := processEnvironment_#t~ret37;havoc processEnvironment_#t~ret37; 454#L498 assume !(0 != processEnvironment_~tmp~4); 450#L469 havoc __utac_acc__Specification2_spec__2_#t~ret0, __utac_acc__Specification2_spec__2_#t~ret1, __utac_acc__Specification2_spec__2_~tmp~0, __utac_acc__Specification2_spec__2_~tmp___0~0;havoc __utac_acc__Specification2_spec__2_~tmp~0;havoc __utac_acc__Specification2_spec__2_~tmp___0~0;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; 484#L671-1 __utac_acc__Specification2_spec__2_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification2_spec__2_~tmp~0 := __utac_acc__Specification2_spec__2_#t~ret0;havoc __utac_acc__Specification2_spec__2_#t~ret0; 471#L60 assume !(0 != __utac_acc__Specification2_spec__2_~tmp~0);~methAndRunningLastTime~0 := 0; 424#L60-1 [2019-01-01 23:39:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:39:31,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:39:31,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:39:31,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:39:31,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:31,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:39:31,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:39:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash 851388269, now seen corresponding path program 1 times [2019-01-01 23:39:31,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:39:31,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:39:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:31,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:39:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:39:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2016965043, now seen corresponding path program 1 times [2019-01-01 23:39:31,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:39:31,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:39:31,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:31,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:39:31,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:39:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:39:32,324 WARN L181 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-01 23:39:32,801 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 23:40:00,907 WARN L181 SmtUtils]: Spent 28.10 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:40:13,786 WARN L181 SmtUtils]: Spent 12.86 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:40:13,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:40:13 BoogieIcfgContainer [2019-01-01 23:40:13,871 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:40:13,871 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:40:13,871 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:40:13,871 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:40:13,872 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:39:28" (3/4) ... [2019-01-01 23:40:13,880 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:40:13,979 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:40:13,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:40:13,981 INFO L168 Benchmark]: Toolchain (without parser) took 47797.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 951.4 MB in the beginning and 832.5 MB in the end (delta: 118.9 MB). Peak memory consumption was 436.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:40:13,982 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:40:13,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.19 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:40:13,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:40:13,984 INFO L168 Benchmark]: Boogie Preprocessor took 42.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:40:13,984 INFO L168 Benchmark]: RCFGBuilder took 1228.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:40:13,985 INFO L168 Benchmark]: BuchiAutomizer took 45696.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 834.5 MB in the end (delta: 222.0 MB). Peak memory consumption was 422.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:40:13,985 INFO L168 Benchmark]: Witness Printer took 108.68 ms. Allocated memory is still 1.3 GB. Free memory was 834.5 MB in the beginning and 832.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:40:13,989 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 564.19 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 151.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1228.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 45696.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 834.5 MB in the end (delta: 222.0 MB). Peak memory consumption was 422.9 MB. Max. memory is 11.5 GB. * Witness Printer took 108.68 ms. Allocated memory is still 1.3 GB. Free memory was 834.5 MB in the beginning and 832.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 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 6 locations. The remainder module has 125 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 44.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. 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 125 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 232 SDtfs, 455 SDslu, 56 SDs, 0 SdLazy, 29 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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: 733]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=10210} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=0, NULL=-12, NULL=10210, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-21, methaneLevelCritical=0, retValue_acc=1, tmp___0=0, retValue_acc=0, NULL=-10, NULL=-16, NULL=0, tmp=0, tmp___1=0, NULL=-11, NULL=-13, NULL=10209, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5479cf81=0, cleanupTimeShifts=4, NULL=-22, NULL=-1, NULL=-3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53c8c562=0, NULL=9079, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e496c3=0, NULL=9078, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=0, NULL=0, NULL=-18, retValue_acc=0, NULL=0, \result=0, NULL=-6, NULL=-17, NULL=0, NULL=0, retValue_acc=0, NULL=0, \result=1, head=0, pumpRunning=0, retValue_acc=1, NULL=-4, \result=0, NULL=-15, NULL=-20, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@357cae0a=60, NULL=0, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e70550c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3de6c00c=0, NULL=0, NULL=0, \result=1, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1db29484=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62f392f4=0, tmp___2=60, tmp___0=0, NULL=-7, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37d7f79=0, splverifierCounter=0, methAndRunningLastTime=0, \result=0, head=0, tmp=0, NULL=-5, NULL=0, NULL=0, NULL=-14, tmp=0, NULL=0, NULL=0, NULL=-8, NULL=-19, NULL=-9} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L43] int methAndRunningLastTime ; [L251] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L455] int pumpRunning = 0; [L456] int systemActive = 1; [L628] int waterLevel = 1; [L629] int methaneLevelCritical = 0; [L835] int cleanupTimeShifts = 4; [L909] int retValue_acc ; [L910] int tmp ; [L817] int retValue_acc ; [L820] retValue_acc = 1 [L821] return (retValue_acc); [L916] tmp = valid_product() [L918] COND TRUE \read(tmp) [L48] methAndRunningLastTime = 0 [L724] int splverifierCounter ; [L725] int tmp ; [L726] int tmp___0 ; [L727] int tmp___1 ; [L728] int tmp___2 ; [L731] splverifierCounter = 0 Loop: [L733] COND TRUE 1 [L735] COND TRUE splverifierCounter < 4 [L741] tmp = __VERIFIER_nondet_int() [L743] COND FALSE !(\read(tmp)) [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND FALSE !(\read(tmp___0)) [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) [L462] COND FALSE !(\read(pumpRunning)) [L469] COND TRUE \read(systemActive) [L491] int tmp ; [L494] COND TRUE ! pumpRunning [L606] int retValue_acc ; [L607] int tmp ; [L608] int tmp___0 ; [L708] int retValue_acc ; [L711] COND TRUE waterLevel < 2 [L712] retValue_acc = 1 [L713] return (retValue_acc); [L612] tmp = isHighWaterSensorDry() [L614] COND TRUE \read(tmp) [L615] tmp___0 = 0 [L619] retValue_acc = tmp___0 [L620] return (retValue_acc); [L496] tmp = isHighWaterLevel() [L498] COND FALSE !(\read(tmp)) [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); [L58] tmp = isMethaneLevelCritical() [L60] COND FALSE !(\read(tmp)) [L76] methAndRunningLastTime = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...