./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product22_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_spec5_product22_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 9f020a8b33a45c119887964f9008d96e4dba4f1a ..................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:50:30,170 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:50:30,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:50:30,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:50:30,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:50:30,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:50:30,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:50:30,189 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:50:30,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:50:30,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:50:30,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:50:30,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:50:30,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:50:30,195 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:50:30,196 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:50:30,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:50:30,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:50:30,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:50:30,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:50:30,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:50:30,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:50:30,208 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:50:30,211 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:50:30,211 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:50:30,211 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:50:30,212 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:50:30,213 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:50:30,214 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:50:30,215 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:50:30,217 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:50:30,217 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:50:30,218 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:50:30,218 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:50:30,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:50:30,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:50:30,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:50:30,221 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:50:30,239 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:50:30,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:50:30,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:50:30,241 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:50:30,241 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:50:30,241 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:50:30,241 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:50:30,241 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:50:30,242 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:50:30,242 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:50:30,242 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:50:30,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:50:30,242 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:50:30,242 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:50:30,244 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:50:30,244 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:50:30,244 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:50:30,244 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:50:30,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:50:30,245 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:50:30,245 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:50:30,245 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:50:30,245 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:50:30,245 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:50:30,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:50:30,246 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:50:30,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:50:30,247 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:50:30,247 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:50:30,248 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:50:30,248 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:50:30,249 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:50:30,249 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 -> 9f020a8b33a45c119887964f9008d96e4dba4f1a [2019-01-01 23:50:30,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:50:30,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:50:30,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:50:30,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:50:30,325 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:50:30,326 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product22_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:30,391 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63cef4fe/ad862e3e46444a08a5cbab868720e5f9/FLAG5827fd7a7 [2019-01-01 23:50:30,947 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:50:30,950 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product22_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:30,966 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63cef4fe/ad862e3e46444a08a5cbab868720e5f9/FLAG5827fd7a7 [2019-01-01 23:50:31,203 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63cef4fe/ad862e3e46444a08a5cbab868720e5f9 [2019-01-01 23:50:31,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:50:31,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:50:31,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:31,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:50:31,213 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:50:31,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:31" (1/1) ... [2019-01-01 23:50:31,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593b70c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31, skipping insertion in model container [2019-01-01 23:50:31,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:31" (1/1) ... [2019-01-01 23:50:31,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:50:31,288 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:50:31,650 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:31,669 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:50:31,802 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:31,923 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:50:31,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31 WrapperNode [2019-01-01 23:50:31,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:31,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:31,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:50:31,925 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:50:31,935 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:50:31" (1/1) ... [2019-01-01 23:50:31,971 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:50:31" (1/1) ... [2019-01-01 23:50:32,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:32,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:50:32,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:50:32,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:50:32,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31" (1/1) ... [2019-01-01 23:50:32,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31" (1/1) ... [2019-01-01 23:50:32,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31" (1/1) ... [2019-01-01 23:50:32,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31" (1/1) ... [2019-01-01 23:50:32,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31" (1/1) ... [2019-01-01 23:50:32,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31" (1/1) ... [2019-01-01 23:50:32,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31" (1/1) ... [2019-01-01 23:50:32,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:50:32,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:50:32,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:50:32,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:50:32,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31" (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:50:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:50:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:50:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:50:32,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:50:33,731 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:50:33,731 INFO L280 CfgBuilder]: Removed 172 assue(true) statements. [2019-01-01 23:50:33,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:33 BoogieIcfgContainer [2019-01-01 23:50:33,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:50:33,733 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:50:33,733 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:50:33,736 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:50:33,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:33,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:50:31" (1/3) ... [2019-01-01 23:50:33,739 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30116943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:33, skipping insertion in model container [2019-01-01 23:50:33,739 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:33,739 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:31" (2/3) ... [2019-01-01 23:50:33,740 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30116943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:33, skipping insertion in model container [2019-01-01 23:50:33,740 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:33,740 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:33" (3/3) ... [2019-01-01 23:50:33,744 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product22_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:33,802 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:50:33,803 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:50:33,803 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:50:33,803 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:50:33,803 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:50:33,803 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:50:33,803 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:50:33,804 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:50:33,804 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:50:33,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states. [2019-01-01 23:50:33,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2019-01-01 23:50:33,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:33,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:33,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:33,864 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:50:33,864 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:50:33,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states. [2019-01-01 23:50:33,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2019-01-01 23:50:33,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:33,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:33,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:33,873 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:50:33,880 INFO L794 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(110, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(13);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(77, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(101, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(104, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string69.base, #t~string69.offset, 1);call write~init~int(82, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(84, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(75, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 7#L-1true havoc main_#res;havoc main_#t~ret28, main_~retValue_acc~5, main_~tmp~5;havoc main_~retValue_acc~5;havoc main_~tmp~5; 11#L65true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 6#L73true main_#t~ret28 := valid_product_#res;main_~tmp~5 := main_#t~ret28;havoc main_#t~ret28; 15#L483true assume 0 != main_~tmp~5; 102#L459true ~switchedOnBeforeTS~0 := 0; 49#L287true havoc test_#t~nondet24, test_#t~nondet25, test_#t~nondet26, test_#t~nondet27, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 71#L308-1true [2019-01-01 23:50:33,880 INFO L796 eck$LassoCheckResult]: Loop: 71#L308-1true assume !false; 63#L344true assume test_~splverifierCounter~0 < 4; 36#L345true test_~tmp~4 := test_#t~nondet24;havoc test_#t~nondet24; 47#L353true assume !(0 != test_~tmp~4); 48#L353-1true test_~tmp___0~2 := test_#t~nondet25;havoc test_#t~nondet25; 81#L363true assume !(0 != test_~tmp___0~2); 82#L363-1true test_~tmp___2~0 := test_#t~nondet26;havoc test_#t~nondet26; 23#L373true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 32#L381-2true havoc __utac_acc__Specification5_spec__2_#t~ret21;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 104#L211true __utac_acc__Specification5_spec__2_#t~ret21 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret21;havoc __utac_acc__Specification5_spec__2_#t~ret21; 66#L297true assume !(0 != ~pumpRunning~0); 46#L100true assume !(0 != ~systemActive~0); 87#L107true havoc __utac_acc__Specification5_spec__3_#t~ret22, __utac_acc__Specification5_spec__3_#t~ret23, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 107#L938true __utac_acc__Specification5_spec__3_#t~ret22 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret22;havoc __utac_acc__Specification5_spec__3_#t~ret22; 68#L308true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 71#L308-1true [2019-01-01 23:50:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:50:33,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:33,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:33,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:33,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:33,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1012669325, now seen corresponding path program 1 times [2019-01-01 23:50:34,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:34,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:34,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:34,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:34,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:34,948 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:50:34,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:34,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:50:34,959 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:50:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:50:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:50:34,983 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2019-01-01 23:50:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:35,136 INFO L93 Difference]: Finished difference Result 111 states and 155 transitions. [2019-01-01 23:50:35,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:50:35,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 155 transitions. [2019-01-01 23:50:35,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-01 23:50:35,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 104 states and 147 transitions. [2019-01-01 23:50:35,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2019-01-01 23:50:35,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2019-01-01 23:50:35,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 147 transitions. [2019-01-01 23:50:35,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:35,176 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 23:50:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 147 transitions. [2019-01-01 23:50:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-01 23:50:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 23:50:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2019-01-01 23:50:35,231 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 23:50:35,231 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 23:50:35,231 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:50:35,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 147 transitions. [2019-01-01 23:50:35,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2019-01-01 23:50:35,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:35,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:35,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:35,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:35,240 INFO L794 eck$LassoCheckResult]: Stem: 321#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(110, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(13);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(77, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(101, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(104, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string69.base, #t~string69.offset, 1);call write~init~int(82, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(84, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(75, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 238#L-1 havoc main_#res;havoc main_#t~ret28, main_~retValue_acc~5, main_~tmp~5;havoc main_~retValue_acc~5;havoc main_~tmp~5; 239#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 236#L73 main_#t~ret28 := valid_product_#res;main_~tmp~5 := main_#t~ret28;havoc main_#t~ret28; 237#L483 assume 0 != main_~tmp~5; 250#L459 ~switchedOnBeforeTS~0 := 0; 302#L287 havoc test_#t~nondet24, test_#t~nondet25, test_#t~nondet26, test_#t~nondet27, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 290#L308-1 [2019-01-01 23:50:35,242 INFO L796 eck$LassoCheckResult]: Loop: 290#L308-1 assume !false; 311#L344 assume test_~splverifierCounter~0 < 4; 284#L345 test_~tmp~4 := test_#t~nondet24;havoc test_#t~nondet24; 285#L353 assume !(0 != test_~tmp~4); 300#L353-1 test_~tmp___0~2 := test_#t~nondet25;havoc test_#t~nondet25; 301#L363 assume !(0 != test_~tmp___0~2); 276#L363-1 test_~tmp___2~0 := test_#t~nondet26;havoc test_#t~nondet26; 262#L373 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 264#L381-2 havoc __utac_acc__Specification5_spec__2_#t~ret21;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 279#L211 __utac_acc__Specification5_spec__2_#t~ret21 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret21;havoc __utac_acc__Specification5_spec__2_#t~ret21; 316#L297 assume !(0 != ~pumpRunning~0); 298#L100 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret2, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 265#L158 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret1, processEnvironment__wrappee__lowWaterSensor_~tmp~0;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~0; 266#L132-1 assume !(0 != ~pumpRunning~0); 256#L107 havoc __utac_acc__Specification5_spec__3_#t~ret22, __utac_acc__Specification5_spec__3_#t~ret23, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 332#L938 __utac_acc__Specification5_spec__3_#t~ret22 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret22;havoc __utac_acc__Specification5_spec__3_#t~ret22; 319#L308 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 290#L308-1 [2019-01-01 23:50:35,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:35,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:50:35,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:35,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:35,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:35,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:35,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 363233727, now seen corresponding path program 1 times [2019-01-01 23:50:35,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:35,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash -759378631, now seen corresponding path program 1 times [2019-01-01 23:50:35,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:35,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:35,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:35,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:35,834 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:50:35,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:35,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:50:35,995 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 23:50:36,097 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:50:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:50:36,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:50:36,122 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. cyclomatic complexity: 45 Second operand 5 states. [2019-01-01 23:50:36,654 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:50:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:37,281 INFO L93 Difference]: Finished difference Result 320 states and 453 transitions. [2019-01-01 23:50:37,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:50:37,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 453 transitions. [2019-01-01 23:50:37,289 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 135 [2019-01-01 23:50:37,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 320 states and 453 transitions. [2019-01-01 23:50:37,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2019-01-01 23:50:37,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2019-01-01 23:50:37,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 453 transitions. [2019-01-01 23:50:37,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:37,306 INFO L705 BuchiCegarLoop]: Abstraction has 320 states and 453 transitions. [2019-01-01 23:50:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 453 transitions. [2019-01-01 23:50:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 201. [2019-01-01 23:50:37,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-01 23:50:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 280 transitions. [2019-01-01 23:50:37,338 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 280 transitions. [2019-01-01 23:50:37,338 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 280 transitions. [2019-01-01 23:50:37,338 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:50:37,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 280 transitions. [2019-01-01 23:50:37,346 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 135 [2019-01-01 23:50:37,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:37,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:37,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:37,349 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] [2019-01-01 23:50:37,349 INFO L794 eck$LassoCheckResult]: Stem: 769#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(110, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(102, #t~string9.base, 2 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 3 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(80, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(117, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(109, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(112, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(13);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(77, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(101, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(104, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string69.base, #t~string69.offset, 1);call write~init~int(82, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(84, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 4 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(75, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 1 + #t~string73.offset, 1); 678#L-1 havoc main_#res;havoc main_#t~ret28, main_~retValue_acc~5, main_~tmp~5;havoc main_~retValue_acc~5;havoc main_~tmp~5; 679#L65 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 676#L73 main_#t~ret28 := valid_product_#res;main_~tmp~5 := main_#t~ret28;havoc main_#t~ret28; 677#L483 assume 0 != main_~tmp~5; 690#L459 ~switchedOnBeforeTS~0 := 0; 744#L287 havoc test_#t~nondet24, test_#t~nondet25, test_#t~nondet26, test_#t~nondet27, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 732#L308-1 [2019-01-01 23:50:37,349 INFO L796 eck$LassoCheckResult]: Loop: 732#L308-1 assume !false; 756#L344 assume test_~splverifierCounter~0 < 4; 726#L345 test_~tmp~4 := test_#t~nondet24;havoc test_#t~nondet24; 727#L353 assume !(0 != test_~tmp~4); 742#L353-1 test_~tmp___0~2 := test_#t~nondet25;havoc test_#t~nondet25; 743#L363 assume !(0 != test_~tmp___0~2); 717#L363-1 test_~tmp___2~0 := test_#t~nondet26;havoc test_#t~nondet26; 703#L373 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 705#L381-2 havoc __utac_acc__Specification5_spec__2_#t~ret21;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 721#L211 __utac_acc__Specification5_spec__2_#t~ret21 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret21;havoc __utac_acc__Specification5_spec__2_#t~ret21; 762#L297 assume !(0 != ~pumpRunning~0); 740#L100 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret2, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 706#L158 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret1, processEnvironment__wrappee__lowWaterSensor_~tmp~0;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~0; 707#L132-1 assume !(0 != ~pumpRunning~0); 836#L107 havoc __utac_acc__Specification5_spec__3_#t~ret22, __utac_acc__Specification5_spec__3_#t~ret23, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 797#L938 __utac_acc__Specification5_spec__3_#t~ret22 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret22;havoc __utac_acc__Specification5_spec__3_#t~ret22; 765#L308 assume 2 != __utac_acc__Specification5_spec__3_~tmp~3;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 766#L211-1 __utac_acc__Specification5_spec__3_#t~ret23 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~1 := __utac_acc__Specification5_spec__3_#t~ret23;havoc __utac_acc__Specification5_spec__3_#t~ret23; 730#L312 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~1); 732#L308-1 [2019-01-01 23:50:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:50:37,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:37,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:37,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:37,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:37,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:37,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:37,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1175247994, now seen corresponding path program 1 times [2019-01-01 23:50:37,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:37,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:37,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:37,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:37,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 381563252, now seen corresponding path program 1 times [2019-01-01 23:50:37,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:37,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:37,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:37,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:37,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:38,695 WARN L181 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-01 23:50:38,833 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:51:09,674 WARN L181 SmtUtils]: Spent 30.82 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:51:25,078 WARN L181 SmtUtils]: Spent 15.40 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:51:25,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:51:25 BoogieIcfgContainer [2019-01-01 23:51:25,177 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:51:25,178 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:51:25,178 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:51:25,178 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:51:25,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:33" (3/4) ... [2019-01-01 23:51:25,186 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:51:25,290 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:51:25,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:51:25,291 INFO L168 Benchmark]: Toolchain (without parser) took 54084.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.4 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -306.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:25,292 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:51:25,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:25,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.05 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:25,294 INFO L168 Benchmark]: Boogie Preprocessor took 69.55 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:51:25,295 INFO L168 Benchmark]: RCFGBuilder took 1641.43 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:25,297 INFO L168 Benchmark]: BuchiAutomizer took 51444.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -186.3 MB). Peak memory consumption was 406.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:25,298 INFO L168 Benchmark]: Witness Printer took 112.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:25,310 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 714.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.05 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.55 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 1641.43 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 51444.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -186.3 MB). Peak memory consumption was 406.1 MB. Max. memory is 11.5 GB. * Witness Printer took 112.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 201 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 49.7s. Construction of modules took 0.8s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 119 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 201 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 393 SDtfs, 695 SDslu, 468 SDs, 0 SdLazy, 100 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 343]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=15243} State at position 1 is {NULL=5479, NULL=0, NULL=0, retValue_acc=1, NULL=15243, NULL=-5, retValue_acc=0, NULL=-13, NULL=0, NULL=0, tmp=0, NULL=-9, NULL=-8, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7dc6693e=0, tmp=1, NULL=0, tmp=0, NULL=0, NULL=0, tmp___1=0, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-17, \result=0, NULL=-12, NULL=0, systemActive=1, waterLevel=1, NULL=-3, \result=1, NULL=-15, NULL=0, NULL=-2, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@272d0c1a=0, NULL=-21, NULL=0, NULL=0, NULL=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12804cd2=0, head=0, pumpRunning=0, NULL=-16, NULL=-19, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33beeb92=0, tmp___0=0, NULL=-18, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50dd4f1e=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e85fedb=70, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16480d7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52132ca9=0, NULL=0, tmp=1, NULL=0, NULL=15242, NULL=-24, NULL=-11, NULL=0, NULL=0, NULL=-4, retValue_acc=1, tmp___2=70, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-1, NULL=-10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66608162=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ba92722=0, NULL=-20, tmp=0, head=0, NULL=-7, NULL=0, NULL=0, NULL=-14, NULL=0, NULL=-23, NULL=-6, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L88] int pumpRunning = 0; [L89] int systemActive = 1; [L281] int switchedOnBeforeTS ; [L400] int cleanupTimeShifts = 4; [L666] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L863] int waterLevel = 1; [L864] int methaneLevelCritical = 0; [L474] int retValue_acc ; [L475] int tmp ; [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); [L481] tmp = valid_product() [L483] COND TRUE \read(tmp) [L286] switchedOnBeforeTS = 0 [L334] int splverifierCounter ; [L335] int tmp ; [L336] int tmp___0 ; [L337] int tmp___1 ; [L338] int tmp___2 ; [L341] splverifierCounter = 0 Loop: [L343] COND TRUE 1 [L345] COND TRUE splverifierCounter < 4 [L351] tmp = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp)) [L361] tmp___0 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___0)) [L371] tmp___2 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___2) [L274] systemActive = 1 [L207] int retValue_acc ; [L210] retValue_acc = pumpRunning [L211] return (retValue_acc); [L295] switchedOnBeforeTS = isPumpRunning() [L100] COND FALSE !(\read(pumpRunning)) [L107] COND TRUE \read(systemActive) [L155] int tmp ; [L158] COND FALSE !(\read(pumpRunning)) [L129] int tmp ; [L132] COND FALSE !(\read(pumpRunning)) [L301] int tmp ; [L302] int tmp___0 ; [L934] int retValue_acc ; [L937] retValue_acc = waterLevel [L938] return (retValue_acc); [L306] tmp = getWaterLevel() [L308] COND TRUE tmp != 2 [L207] int retValue_acc ; [L210] retValue_acc = pumpRunning [L211] return (retValue_acc); [L310] tmp___0 = isPumpRunning() [L312] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...