./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product24_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_product24_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 7c153dfe33f87015b278f995b6c1e5c6fbcf815b .................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:50:36,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:50:36,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:50:36,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:50:36,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:50:36,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:50:36,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:50:36,176 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:50:36,177 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:50:36,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:50:36,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:50:36,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:50:36,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:50:36,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:50:36,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:50:36,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:50:36,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:50:36,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:50:36,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:50:36,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:50:36,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:50:36,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:50:36,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:50:36,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:50:36,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:50:36,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:50:36,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:50:36,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:50:36,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:50:36,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:50:36,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:50:36,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:50:36,207 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:50:36,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:50:36,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:50:36,211 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:36,246 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:50:36,248 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:50:36,249 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:50:36,250 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:50:36,250 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:50:36,250 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:50:36,250 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:50:36,250 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:50:36,250 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:50:36,252 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:50:36,252 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:50:36,252 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:50:36,253 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:50:36,253 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:50:36,253 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:50:36,253 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:50:36,253 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:50:36,253 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:50:36,254 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:50:36,254 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:50:36,254 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:50:36,254 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:50:36,254 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:50:36,254 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:50:36,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:50:36,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:50:36,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:50:36,255 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:50:36,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:50:36,256 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:50:36,258 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:50:36,259 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:50:36,259 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 -> 7c153dfe33f87015b278f995b6c1e5c6fbcf815b [2019-01-01 23:50:36,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:50:36,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:50:36,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:50:36,346 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:50:36,346 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:50:36,347 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product24_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:36,426 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e7cc1c2/66690c1b4c7e466292563dfb9d2c6a82/FLAG232010ea2 [2019-01-01 23:50:36,969 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:50:36,970 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product24_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:36,983 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e7cc1c2/66690c1b4c7e466292563dfb9d2c6a82/FLAG232010ea2 [2019-01-01 23:50:37,275 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e7cc1c2/66690c1b4c7e466292563dfb9d2c6a82 [2019-01-01 23:50:37,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:50:37,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:50:37,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:37,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:50:37,290 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:50:37,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:37" (1/1) ... [2019-01-01 23:50:37,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:37, skipping insertion in model container [2019-01-01 23:50:37,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:37" (1/1) ... [2019-01-01 23:50:37,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:50:37,364 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:50:37,795 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:37,811 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:50:37,927 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:38,067 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:50:38,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:38 WrapperNode [2019-01-01 23:50:38,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:38,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:38,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:50:38,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:50:38,077 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:38" (1/1) ... [2019-01-01 23:50:38,097 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:38" (1/1) ... [2019-01-01 23:50:38,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:38,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:50:38,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:50:38,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:50:38,156 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:38" (1/1) ... [2019-01-01 23:50:38,156 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:38" (1/1) ... [2019-01-01 23:50:38,161 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:38" (1/1) ... [2019-01-01 23:50:38,161 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:38" (1/1) ... [2019-01-01 23:50:38,174 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:38" (1/1) ... [2019-01-01 23:50:38,187 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:38" (1/1) ... [2019-01-01 23:50:38,190 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:38" (1/1) ... [2019-01-01 23:50:38,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:50:38,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:50:38,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:50:38,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:50:38,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:38" (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:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:50:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:50:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:50:38,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:50:39,566 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:50:39,566 INFO L280 CfgBuilder]: Removed 176 assue(true) statements. [2019-01-01 23:50:39,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:39 BoogieIcfgContainer [2019-01-01 23:50:39,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:50:39,568 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:50:39,568 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:50:39,571 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:50:39,572 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:39,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:50:37" (1/3) ... [2019-01-01 23:50:39,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@784e5339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:39, skipping insertion in model container [2019-01-01 23:50:39,577 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:39,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:38" (2/3) ... [2019-01-01 23:50:39,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@784e5339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:39, skipping insertion in model container [2019-01-01 23:50:39,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:39,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:39" (3/3) ... [2019-01-01 23:50:39,582 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product24_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:39,642 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:50:39,643 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:50:39,643 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:50:39,643 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:50:39,643 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:50:39,643 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:50:39,644 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:50:39,644 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:50:39,644 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:50:39,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states. [2019-01-01 23:50:39,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2019-01-01 23:50:39,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:39,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:39,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:39,703 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:39,703 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:50:39,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states. [2019-01-01 23:50:39,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2019-01-01 23:50:39,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:39,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:39,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:39,713 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:39,719 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(13);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string22.base, #t~string22.offset, 1);call write~init~int(80, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(117, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(109, #t~string22.base, 3 + #t~string22.offset, 1);call write~init~int(112, #t~string22.base, 4 + #t~string22.offset, 1);call write~init~int(58, #t~string22.base, 5 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 6 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string28.base, #t~string28.offset, 1);call write~init~int(32, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string30.base, #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 1 + #t~string30.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0; 8#L-1true havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 56#L262true havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 88#L270true main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 96#L132true assume 0 != main_~tmp~0; 17#L103true ~switchedOnBeforeTS~0 := 0; 78#L928true havoc test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 98#L949-1true [2019-01-01 23:50:39,720 INFO L796 eck$LassoCheckResult]: Loop: 98#L949-1true assume !false; 11#L497true assume test_~splverifierCounter~0 < 4; 94#L498true test_~tmp~4 := test_#t~nondet32;havoc test_#t~nondet32; 105#L506true assume !(0 != test_~tmp~4); 97#L506-1true test_~tmp___0~1 := test_#t~nondet33;havoc test_#t~nondet33; 13#L516true assume !(0 != test_~tmp___0~1); 15#L516-1true test_~tmp___2~0 := test_#t~nondet34;havoc test_#t~nondet34; 76#L526true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 92#L534-1true havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 23#L403true __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 112#L938true assume !(0 != ~pumpRunning~0); 89#L292true assume !(0 != ~systemActive~0); 10#L299true havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~2;havoc getWaterLevel_~retValue_acc~2;getWaterLevel_~retValue_acc~2 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~2; 84#L226true __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 111#L949true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 98#L949-1true [2019-01-01 23:50:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:39,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:50:39,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:39,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:39,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 676518966, now seen corresponding path program 1 times [2019-01-01 23:50:40,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:40,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:40,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:40,714 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:40,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:40,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:50:40,723 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:50:40,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:50:40,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:50:40,743 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 3 states. [2019-01-01 23:50:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:40,893 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2019-01-01 23:50:40,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:50:40,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 311 transitions. [2019-01-01 23:50:40,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2019-01-01 23:50:40,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 205 states and 296 transitions. [2019-01-01 23:50:40,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2019-01-01 23:50:40,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2019-01-01 23:50:40,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 296 transitions. [2019-01-01 23:50:40,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:40,931 INFO L705 BuchiCegarLoop]: Abstraction has 205 states and 296 transitions. [2019-01-01 23:50:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 296 transitions. [2019-01-01 23:50:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2019-01-01 23:50:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-01 23:50:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 293 transitions. [2019-01-01 23:50:40,977 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 293 transitions. [2019-01-01 23:50:40,977 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 293 transitions. [2019-01-01 23:50:40,978 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:50:40,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 293 transitions. [2019-01-01 23:50:40,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 140 [2019-01-01 23:50:40,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:40,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:40,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:40,983 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:40,984 INFO L794 eck$LassoCheckResult]: Stem: 461#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(13);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string22.base, #t~string22.offset, 1);call write~init~int(80, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(117, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(109, #t~string22.base, 3 + #t~string22.offset, 1);call write~init~int(112, #t~string22.base, 4 + #t~string22.offset, 1);call write~init~int(58, #t~string22.base, 5 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 6 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string28.base, #t~string28.offset, 1);call write~init~int(32, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string30.base, #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 1 + #t~string30.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0; 354#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 355#L262 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 428#L270 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 458#L132 assume 0 != main_~tmp~0; 371#L103 ~switchedOnBeforeTS~0 := 0; 372#L928 havoc test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 362#L949-1 [2019-01-01 23:50:40,984 INFO L796 eck$LassoCheckResult]: Loop: 362#L949-1 assume !false; 358#L497 assume test_~splverifierCounter~0 < 4; 359#L498 test_~tmp~4 := test_#t~nondet32;havoc test_#t~nondet32; 462#L506 assume !(0 != test_~tmp~4); 499#L506-1 test_~tmp___0~1 := test_#t~nondet33;havoc test_#t~nondet33; 363#L516 assume !(0 != test_~tmp___0~1); 365#L516-1 test_~tmp___2~0 := test_#t~nondet34;havoc test_#t~nondet34; 368#L526 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 444#L534-1 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 383#L403 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 384#L938 assume !(0 != ~pumpRunning~0); 446#L292 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret13, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 432#L350 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret12, processEnvironment__wrappee__lowWaterSensor_~tmp~1;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~1; 434#L324-1 assume !(0 != ~pumpRunning~0); 480#L299 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~2;havoc getWaterLevel_~retValue_acc~2;getWaterLevel_~retValue_acc~2 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~2; 452#L226 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 453#L949 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 362#L949-1 [2019-01-01 23:50:40,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:40,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:50:40,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:40,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:40,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:40,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:40,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:41,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:41,352 INFO L82 PathProgramCache]: Analyzing trace with hash -554713784, now seen corresponding path program 1 times [2019-01-01 23:50:41,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:41,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:41,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:41,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:41,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:41,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1677326142, now seen corresponding path program 1 times [2019-01-01 23:50:41,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:41,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:41,544 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:41,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:41,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:50:41,900 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 23:50:42,256 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:50:42,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:50:42,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:50:42,288 INFO L87 Difference]: Start difference. First operand 203 states and 293 transitions. cyclomatic complexity: 93 Second operand 5 states. [2019-01-01 23:50:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:43,267 INFO L93 Difference]: Finished difference Result 608 states and 873 transitions. [2019-01-01 23:50:43,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:50:43,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 873 transitions. [2019-01-01 23:50:43,282 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 274 [2019-01-01 23:50:43,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 608 states and 873 transitions. [2019-01-01 23:50:43,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 608 [2019-01-01 23:50:43,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 608 [2019-01-01 23:50:43,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 608 states and 873 transitions. [2019-01-01 23:50:43,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:43,304 INFO L705 BuchiCegarLoop]: Abstraction has 608 states and 873 transitions. [2019-01-01 23:50:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states and 873 transitions. [2019-01-01 23:50:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 399. [2019-01-01 23:50:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-01 23:50:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 565 transitions. [2019-01-01 23:50:43,346 INFO L728 BuchiCegarLoop]: Abstraction has 399 states and 565 transitions. [2019-01-01 23:50:43,346 INFO L608 BuchiCegarLoop]: Abstraction has 399 states and 565 transitions. [2019-01-01 23:50:43,346 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:50:43,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 565 transitions. [2019-01-01 23:50:43,352 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 274 [2019-01-01 23:50:43,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:43,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:43,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:43,355 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:43,355 INFO L794 eck$LassoCheckResult]: Stem: 1289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(13);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string22.base, #t~string22.offset, 1);call write~init~int(80, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(117, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(109, #t~string22.base, 3 + #t~string22.offset, 1);call write~init~int(112, #t~string22.base, 4 + #t~string22.offset, 1);call write~init~int(58, #t~string22.base, 5 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 6 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string28.base, #t~string28.offset, 1);call write~init~int(32, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string30.base, #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 1 + #t~string30.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0; 1181#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 1182#L262 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 1255#L270 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 1285#L132 assume 0 != main_~tmp~0; 1201#L103 ~switchedOnBeforeTS~0 := 0; 1202#L928 havoc test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1276#L949-1 [2019-01-01 23:50:43,355 INFO L796 eck$LassoCheckResult]: Loop: 1276#L949-1 assume !false; 1489#L497 assume test_~splverifierCounter~0 < 4; 1486#L498 test_~tmp~4 := test_#t~nondet32;havoc test_#t~nondet32; 1484#L506 assume !(0 != test_~tmp~4); 1482#L506-1 test_~tmp___0~1 := test_#t~nondet33;havoc test_#t~nondet33; 1480#L516 assume !(0 != test_~tmp___0~1); 1478#L516-1 test_~tmp___2~0 := test_#t~nondet34;havoc test_#t~nondet34; 1476#L526 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1475#L534-1 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 1542#L403 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 1540#L938 assume !(0 != ~pumpRunning~0); 1538#L292 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret13, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 1537#L350 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret12, processEnvironment__wrappee__lowWaterSensor_~tmp~1;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~1; 1530#L324-1 assume !(0 != ~pumpRunning~0); 1522#L299 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~2;havoc getWaterLevel_~retValue_acc~2;getWaterLevel_~retValue_acc~2 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~2; 1283#L226 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 1284#L949 assume 2 != __utac_acc__Specification5_spec__3_~tmp~8;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~7;havoc isPumpRunning_~retValue_acc~7;isPumpRunning_~retValue_acc~7 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~7; 1496#L403-1 __utac_acc__Specification5_spec__3_#t~ret73 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 1495#L953 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 1276#L949-1 [2019-01-01 23:50:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:50:43,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:43,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:43,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:43,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:43,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash -504014109, now seen corresponding path program 1 times [2019-01-01 23:50:43,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:43,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:43,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:43,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1297698851, now seen corresponding path program 1 times [2019-01-01 23:50:43,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:43,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:43,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:44,910 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-01 23:50:45,353 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:51:12,706 WARN L181 SmtUtils]: Spent 27.34 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:51:25,862 WARN L181 SmtUtils]: Spent 13.15 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:51:25,947 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,948 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:51:25,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:51:25,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:51:25,950 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:51:25,950 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:39" (3/4) ... [2019-01-01 23:51:25,955 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:51:26,067 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:51:26,067 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:51:26,068 INFO L168 Benchmark]: Toolchain (without parser) took 48788.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 948.7 MB in the beginning and 888.9 MB in the end (delta: 59.8 MB). Peak memory consumption was 372.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:26,069 INFO L168 Benchmark]: CDTParser took 0.18 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:26,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:26,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.24 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:26,071 INFO L168 Benchmark]: Boogie Preprocessor took 49.06 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:26,077 INFO L168 Benchmark]: RCFGBuilder took 1372.79 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: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:26,078 INFO L168 Benchmark]: BuchiAutomizer took 46379.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 901.3 MB in the end (delta: 162.6 MB). Peak memory consumption was 403.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:26,082 INFO L168 Benchmark]: Witness Printer took 119.06 ms. Allocated memory is still 1.3 GB. Free memory was 901.3 MB in the beginning and 888.9 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:51:26,086 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.18 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 786.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.24 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 49.06 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. * RCFGBuilder took 1372.79 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: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46379.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 901.3 MB in the end (delta: 162.6 MB). Peak memory consumption was 403.3 MB. Max. memory is 11.5 GB. * Witness Printer took 119.06 ms. Allocated memory is still 1.3 GB. Free memory was 901.3 MB in the beginning and 888.9 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 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 399 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 44.8s. Construction of modules took 0.8s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 211 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 399 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 411 SDtfs, 727 SDslu, 637 SDs, 0 SdLazy, 107 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: 496]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=6047} State at position 1 is {NULL=0, NULL=0, NULL=-9, NULL=-17, NULL=0, retValue_acc=0, NULL=6047, NULL=-20, NULL=-11, NULL=-6, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ecf9379=0, NULL=-3, tmp=0, tmp=1, NULL=0, tmp=0, NULL=0, NULL=0, NULL=6046, NULL=0, NULL=-8, tmp___1=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-4, NULL=-14, cleanupTimeShifts=4, switchedOnBeforeTS=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@472d2b82=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21a3ec28=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@384b5dd1=60, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f00b278=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=-18, NULL=0, NULL=0, retValue_acc=1, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-2, \result=1, NULL=-12, head=0, pumpRunning=0, tmp___0=0, tmp=1, NULL=-15, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e3b0a7b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e7100e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64e4fbd4=0, NULL=-24, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d951b85=0, retValue_acc=1, NULL=-25, NULL=-13, tmp___2=60, NULL=-1, tmp___0=0, NULL=-10, splverifierCounter=0, NULL=0, NULL=-26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@776c7b34=0, NULL=-19, tmp=0, head=0, NULL=0, NULL=0, NULL=-16, NULL=0, NULL=0, NULL=-7, NULL=0, NULL=-5, retValue_acc=0, NULL=-23} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L40] int cleanupTimeShifts = 4; [L151] int waterLevel = 1; [L152] int methaneLevelCritical = 0; [L280] int pumpRunning = 0; [L281] int systemActive = 1; [L724] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L922] int switchedOnBeforeTS ; [L123] int retValue_acc ; [L124] int tmp ; [L266] int retValue_acc ; [L269] retValue_acc = 1 [L270] return (retValue_acc); [L130] tmp = valid_product() [L132] COND TRUE \read(tmp) [L927] switchedOnBeforeTS = 0 [L487] int splverifierCounter ; [L488] int tmp ; [L489] int tmp___0 ; [L490] int tmp___1 ; [L491] int tmp___2 ; [L494] splverifierCounter = 0 Loop: [L496] COND TRUE 1 [L498] COND TRUE splverifierCounter < 4 [L504] tmp = __VERIFIER_nondet_int() [L506] COND FALSE !(\read(tmp)) [L514] tmp___0 = __VERIFIER_nondet_int() [L516] COND FALSE !(\read(tmp___0)) [L524] tmp___2 = __VERIFIER_nondet_int() [L526] COND TRUE \read(tmp___2) [L481] systemActive = 1 [L399] int retValue_acc ; [L402] retValue_acc = pumpRunning [L403] return (retValue_acc); [L936] switchedOnBeforeTS = isPumpRunning() [L292] COND FALSE !(\read(pumpRunning)) [L299] COND TRUE \read(systemActive) [L347] int tmp ; [L350] COND FALSE !(\read(pumpRunning)) [L321] int tmp ; [L324] COND FALSE !(\read(pumpRunning)) [L942] int tmp ; [L943] int tmp___0 ; [L222] int retValue_acc ; [L225] retValue_acc = waterLevel [L226] return (retValue_acc); [L947] tmp = getWaterLevel() [L949] COND TRUE tmp != 2 [L399] int retValue_acc ; [L402] retValue_acc = pumpRunning [L403] return (retValue_acc); [L951] tmp___0 = isPumpRunning() [L953] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...