./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product15_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_product15_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 a79e268ddb88b862b3e99a66782eee3a2de30d36 ......................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:50:02,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:50:02,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:50:02,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:50:02,571 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:50:02,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:50:02,574 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:50:02,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:50:02,577 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:50:02,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:50:02,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:50:02,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:50:02,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:50:02,582 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:50:02,583 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:50:02,583 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:50:02,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:50:02,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:50:02,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:50:02,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:50:02,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:50:02,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:50:02,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:50:02,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:50:02,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:50:02,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:50:02,601 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:50:02,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:50:02,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:50:02,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:50:02,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:50:02,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:50:02,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:50:02,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:50:02,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:50:02,608 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:02,625 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:50:02,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:50:02,626 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:50:02,626 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:50:02,627 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:50:02,627 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:50:02,627 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:50:02,627 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:50:02,627 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:50:02,628 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:50:02,628 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:50:02,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:50:02,628 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:50:02,628 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:50:02,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:50:02,629 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:50:02,629 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:50:02,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:50:02,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:50:02,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:50:02,630 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:50:02,630 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:50:02,630 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:50:02,630 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:50:02,630 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:50:02,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:50:02,631 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:50:02,631 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:50:02,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:50:02,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:50:02,631 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:50:02,632 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:50:02,632 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 -> a79e268ddb88b862b3e99a66782eee3a2de30d36 [2019-01-01 23:50:02,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:50:02,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:50:02,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:50:02,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:50:02,694 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:50:02,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product15_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:02,761 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1607da05f/b338cc1afaf742a792e87db93d15b75d/FLAGa141f6f77 [2019-01-01 23:50:03,312 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:50:03,313 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product15_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:03,326 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1607da05f/b338cc1afaf742a792e87db93d15b75d/FLAGa141f6f77 [2019-01-01 23:50:03,594 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1607da05f/b338cc1afaf742a792e87db93d15b75d [2019-01-01 23:50:03,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:50:03,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:50:03,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:03,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:50:03,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:50:03,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:03" (1/1) ... [2019-01-01 23:50:03,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cb658d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:03, skipping insertion in model container [2019-01-01 23:50:03,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:50:03" (1/1) ... [2019-01-01 23:50:03,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:50:03,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:50:04,043 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:04,060 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:50:04,213 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:50:04,330 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:50:04,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:04 WrapperNode [2019-01-01 23:50:04,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:50:04,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:04,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:50:04,332 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:50:04,340 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:04" (1/1) ... [2019-01-01 23:50:04,362 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:04" (1/1) ... [2019-01-01 23:50:04,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:50:04,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:50:04,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:50:04,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:50:04,420 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:04" (1/1) ... [2019-01-01 23:50:04,420 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:04" (1/1) ... [2019-01-01 23:50:04,426 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:04" (1/1) ... [2019-01-01 23:50:04,426 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:04" (1/1) ... [2019-01-01 23:50:04,435 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:04" (1/1) ... [2019-01-01 23:50:04,443 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:04" (1/1) ... [2019-01-01 23:50:04,446 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:04" (1/1) ... [2019-01-01 23:50:04,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:50:04,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:50:04,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:50:04,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:50:04,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:04" (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:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:50:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:50:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:50:04,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:50:05,621 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:50:05,621 INFO L280 CfgBuilder]: Removed 114 assue(true) statements. [2019-01-01 23:50:05,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:05 BoogieIcfgContainer [2019-01-01 23:50:05,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:50:05,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:50:05,623 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:50:05,626 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:50:05,627 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:05,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:50:03" (1/3) ... [2019-01-01 23:50:05,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ebcbdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:05, skipping insertion in model container [2019-01-01 23:50:05,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:05,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:50:04" (2/3) ... [2019-01-01 23:50:05,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ebcbdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:50:05, skipping insertion in model container [2019-01-01 23:50:05,630 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:50:05,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:50:05" (3/3) ... [2019-01-01 23:50:05,632 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product15_true-unreach-call_false-termination.cil.c [2019-01-01 23:50:05,693 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:50:05,693 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:50:05,694 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:50:05,694 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:50:05,694 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:50:05,694 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:50:05,694 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:50:05,694 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:50:05,694 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:50:05,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-01 23:50:05,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:50:05,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:05,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:05,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:05,751 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:05,751 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:50:05,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-01 23:50:05,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:50:05,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:05,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:05,762 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:05,763 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:05,768 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(110, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string44.base, #t~string44.offset, 1);call write~init~int(102, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(102, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 3 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string46.base, #t~string46.offset, 1);call write~init~int(80, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(117, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(109, #t~string46.base, 3 + #t~string46.offset, 1);call write~init~int(112, #t~string46.base, 4 + #t~string46.offset, 1);call write~init~int(58, #t~string46.base, 5 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 6 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string52.base, #t~string52.offset, 1);call write~init~int(32, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string54.base, #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 1 + #t~string54.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1);~switchedOnBeforeTS~0 := 0; 6#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; 5#L778true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 10#L786true main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 46#L132true assume 0 != main_~tmp~0; 26#L103true ~switchedOnBeforeTS~0 := 0; 67#L887true havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 55#L908-1true [2019-01-01 23:50:05,769 INFO L796 eck$LassoCheckResult]: Loop: 55#L908-1true assume !false; 60#L700true assume test_~splverifierCounter~0 < 4; 73#L701true test_~tmp~6 := test_#t~nondet55;havoc test_#t~nondet55; 15#L709true assume !(0 != test_~tmp~6); 3#L709-1true test_~tmp___0~0 := test_#t~nondet56;havoc test_#t~nondet56; 77#L719true assume !(0 != test_~tmp___0~0); 64#L719-1true test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 47#L729true assume 0 != test_~tmp___2~0; 8#L735-1true havoc __utac_acc__Specification5_spec__2_#t~ret70;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 18#L633true __utac_acc__Specification5_spec__2_#t~ret70 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret70;havoc __utac_acc__Specification5_spec__2_#t~ret70; 53#L897true assume !(0 != ~pumpRunning~0); 37#L531true assume !(0 != ~systemActive~0); 45#L538true havoc __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 19#L867true __utac_acc__Specification5_spec__3_#t~ret71 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret71;havoc __utac_acc__Specification5_spec__3_#t~ret71; 51#L908true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 55#L908-1true [2019-01-01 23:50:05,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:50:05,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:05,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:05,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:05,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:05,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash -242168939, now seen corresponding path program 1 times [2019-01-01 23:50:06,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:06,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:06,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:06,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:06,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:06,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:06,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1691856271, now seen corresponding path program 1 times [2019-01-01 23:50:06,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:06,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:06,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:06,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:06,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:06,893 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:06,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:06,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:50:07,155 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:50:07,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:50:07,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:50:07,282 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 6 states. [2019-01-01 23:50:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:07,890 INFO L93 Difference]: Finished difference Result 205 states and 280 transitions. [2019-01-01 23:50:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:50:07,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 280 transitions. [2019-01-01 23:50:07,913 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 131 [2019-01-01 23:50:07,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 184 states and 259 transitions. [2019-01-01 23:50:07,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2019-01-01 23:50:07,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2019-01-01 23:50:07,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 259 transitions. [2019-01-01 23:50:07,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:07,937 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 259 transitions. [2019-01-01 23:50:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 259 transitions. [2019-01-01 23:50:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 119. [2019-01-01 23:50:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 23:50:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2019-01-01 23:50:07,988 INFO L728 BuchiCegarLoop]: Abstraction has 119 states and 167 transitions. [2019-01-01 23:50:07,988 INFO L608 BuchiCegarLoop]: Abstraction has 119 states and 167 transitions. [2019-01-01 23:50:07,989 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:50:07,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 167 transitions. [2019-01-01 23:50:07,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 84 [2019-01-01 23:50:07,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:07,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:07,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:07,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:07,993 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(110, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string44.base, #t~string44.offset, 1);call write~init~int(102, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(102, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 3 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string46.base, #t~string46.offset, 1);call write~init~int(80, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(117, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(109, #t~string46.base, 3 + #t~string46.offset, 1);call write~init~int(112, #t~string46.base, 4 + #t~string46.offset, 1);call write~init~int(58, #t~string46.base, 5 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 6 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string52.base, #t~string52.offset, 1);call write~init~int(32, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string54.base, #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 1 + #t~string54.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1);~switchedOnBeforeTS~0 := 0; 308#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; 304#L778 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 305#L786 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 314#L132 assume 0 != main_~tmp~0; 338#L103 ~switchedOnBeforeTS~0 := 0; 339#L887 havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 363#L908-1 [2019-01-01 23:50:07,993 INFO L796 eck$LassoCheckResult]: Loop: 363#L908-1 assume !false; 365#L700 assume test_~splverifierCounter~0 < 4; 368#L701 test_~tmp~6 := test_#t~nondet55;havoc test_#t~nondet55; 321#L709 assume !(0 != test_~tmp~6); 300#L709-1 test_~tmp___0~0 := test_#t~nondet56;havoc test_#t~nondet56; 301#L719 assume !(0 != test_~tmp___0~0); 303#L719-1 test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 358#L729 assume 0 != test_~tmp___2~0; 309#L735-1 havoc __utac_acc__Specification5_spec__2_#t~ret70;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 310#L633 __utac_acc__Specification5_spec__2_#t~ret70 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret70;havoc __utac_acc__Specification5_spec__2_#t~ret70; 326#L897 assume !(0 != ~pumpRunning~0); 353#L531 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret36, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 311#L563 assume !(0 != ~pumpRunning~0); 312#L538 havoc __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 327#L867 __utac_acc__Specification5_spec__3_#t~ret71 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret71;havoc __utac_acc__Specification5_spec__3_#t~ret71; 328#L908 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 363#L908-1 [2019-01-01 23:50:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:50:07,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:07,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:07,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:07,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:07,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1062169027, now seen corresponding path program 1 times [2019-01-01 23:50:08,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:08,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:08,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:08,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:08,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash 887408393, now seen corresponding path program 1 times [2019-01-01 23:50:08,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:08,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:08,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:50:08,444 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:08,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:50:08,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:50:08,739 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:50:08,927 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:50:08,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:50:08,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:50:08,949 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-01-01 23:50:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:50:09,465 INFO L93 Difference]: Finished difference Result 316 states and 435 transitions. [2019-01-01 23:50:09,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:50:09,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 435 transitions. [2019-01-01 23:50:09,478 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 162 [2019-01-01 23:50:09,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 435 transitions. [2019-01-01 23:50:09,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2019-01-01 23:50:09,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2019-01-01 23:50:09,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 435 transitions. [2019-01-01 23:50:09,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:50:09,487 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 435 transitions. [2019-01-01 23:50:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 435 transitions. [2019-01-01 23:50:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 231. [2019-01-01 23:50:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-01 23:50:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 313 transitions. [2019-01-01 23:50:09,507 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 313 transitions. [2019-01-01 23:50:09,508 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 313 transitions. [2019-01-01 23:50:09,508 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:50:09,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 313 transitions. [2019-01-01 23:50:09,511 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 162 [2019-01-01 23:50:09,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:50:09,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:50:09,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:09,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:50:09,512 INFO L794 eck$LassoCheckResult]: Stem: 809#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(30);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(21);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(25);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(110, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string44.base, #t~string44.offset, 1);call write~init~int(102, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(102, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 3 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string46.base, #t~string46.offset, 1);call write~init~int(80, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(117, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(109, #t~string46.base, 3 + #t~string46.offset, 1);call write~init~int(112, #t~string46.base, 4 + #t~string46.offset, 1);call write~init~int(58, #t~string46.base, 5 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 6 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string52.base, #t~string52.offset, 1);call write~init~int(32, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string54.base, #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 1 + #t~string54.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(77, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(101, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(116, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(104, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string65.base, #t~string65.offset, 1);call write~init~int(82, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(73, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(84, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(75, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1);~switchedOnBeforeTS~0 := 0; 759#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; 755#L778 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 756#L786 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 768#L132 assume 0 != main_~tmp~0; 791#L103 ~switchedOnBeforeTS~0 := 0; 792#L887 havoc test_#t~nondet55, test_#t~nondet56, test_#t~nondet57, test_#t~nondet58, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 847#L908-1 [2019-01-01 23:50:09,516 INFO L796 eck$LassoCheckResult]: Loop: 847#L908-1 assume !false; 939#L700 assume test_~splverifierCounter~0 < 4; 940#L701 test_~tmp~6 := test_#t~nondet55;havoc test_#t~nondet55; 957#L709 assume !(0 != test_~tmp~6); 956#L709-1 test_~tmp___0~0 := test_#t~nondet56;havoc test_#t~nondet56; 943#L719 assume !(0 != test_~tmp___0~0); 941#L719-1 test_~tmp___2~0 := test_#t~nondet57;havoc test_#t~nondet57; 936#L729 assume 0 != test_~tmp___2~0; 932#L735-1 havoc __utac_acc__Specification5_spec__2_#t~ret70;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 955#L633 __utac_acc__Specification5_spec__2_#t~ret70 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret70;havoc __utac_acc__Specification5_spec__2_#t~ret70; 954#L897 assume !(0 != ~pumpRunning~0); 952#L531 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret36, processEnvironment_~tmp~4;havoc processEnvironment_~tmp~4; 917#L563 assume !(0 != ~pumpRunning~0); 949#L538 havoc __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 948#L867 __utac_acc__Specification5_spec__3_#t~ret71 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret71;havoc __utac_acc__Specification5_spec__3_#t~ret71; 947#L908 assume 2 != __utac_acc__Specification5_spec__3_~tmp~7;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 946#L633-1 __utac_acc__Specification5_spec__3_#t~ret72 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~1 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 944#L912 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~1); 847#L908-1 [2019-01-01 23:50:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:50:09,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:09,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:09,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:09,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:09,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:09,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1457795586, now seen corresponding path program 1 times [2019-01-01 23:50:09,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:09,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:09,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:09,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:50:09,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:50:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1899040316, now seen corresponding path program 1 times [2019-01-01 23:50:09,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:50:09,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:50:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:09,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:50:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:50:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:50:10,264 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-01 23:50:37,170 WARN L181 SmtUtils]: Spent 26.82 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:50:53,617 WARN L181 SmtUtils]: Spent 16.43 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:50:53,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:50:53 BoogieIcfgContainer [2019-01-01 23:50:53,702 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:50:53,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:50:53,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:50:53,703 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:50:53,704 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:05" (3/4) ... [2019-01-01 23:50:53,708 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:50:53,817 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:50:53,817 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:50:53,818 INFO L168 Benchmark]: Toolchain (without parser) took 50220.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 943.3 MB in the beginning and 939.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 320.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:53,820 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:50:53,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:53,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.30 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:50:53,823 INFO L168 Benchmark]: Boogie Preprocessor took 40.66 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:50:53,823 INFO L168 Benchmark]: RCFGBuilder took 1172.57 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:53,824 INFO L168 Benchmark]: BuchiAutomizer took 48078.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 942.2 MB in the end (delta: 138.1 MB). Peak memory consumption was 403.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:53,826 INFO L168 Benchmark]: Witness Printer took 114.89 ms. Allocated memory is still 1.3 GB. Free memory was 942.2 MB in the beginning and 939.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:53,831 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.55 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 726.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.30 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. * Boogie Preprocessor took 40.66 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 1172.57 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 48078.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 942.2 MB in the end (delta: 138.1 MB). Peak memory consumption was 403.2 MB. Max. memory is 11.5 GB. * Witness Printer took 114.89 ms. Allocated memory is still 1.3 GB. Free memory was 942.2 MB in the beginning and 939.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 231 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 46.6s. Construction of modules took 0.8s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 150 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 231 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 256 SDtfs, 685 SDslu, 870 SDs, 0 SdLazy, 109 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 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: 699]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, NULL=0, retValue_acc=0, NULL=0, NULL=0, NULL=-20, NULL=0, NULL=0, NULL=0, NULL=-22, NULL=0, methaneLevelCritical=0, tmp=1, NULL=0, NULL=0, NULL=-12, tmp=0, NULL=0, tmp___1=0, NULL=-15, NULL=-18, NULL=-9, NULL=-11, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-6, NULL=-2, NULL=-14, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36a556f4=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-5, \result=1, NULL=0, NULL=0, NULL=-19, NULL=0, tmp___0=0, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, tmp=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4427bcfa=0, tmp___0=0, NULL=-24, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4660a3c8=0, NULL=-17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ffef755=0, NULL=0, NULL=0, NULL=-16, NULL=-25, NULL=-8, retValue_acc=1, NULL=-10, retValue_acc=1, tmp___2=71, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8aed4ee=0, NULL=-13, splverifierCounter=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31813fea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16b03e89=71, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cfc5dc4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@145a873d=0, head=0, tmp=0, NULL=0, NULL=-3, NULL=0, NULL=-4, NULL=0, NULL=-23, NULL=0, NULL=0, NULL=-7, NULL=-21, NULL=0, NULL=-1, retValue_acc=0} - 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; [L315] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L519] int pumpRunning = 0; [L520] int systemActive = 1; [L792] int waterLevel = 1; [L793] int methaneLevelCritical = 0; [L881] int switchedOnBeforeTS ; [L123] int retValue_acc ; [L124] int tmp ; [L782] int retValue_acc ; [L785] retValue_acc = 1 [L786] return (retValue_acc); [L130] tmp = valid_product() [L132] COND TRUE \read(tmp) [L886] switchedOnBeforeTS = 0 [L690] int splverifierCounter ; [L691] int tmp ; [L692] int tmp___0 ; [L693] int tmp___1 ; [L694] int tmp___2 ; [L697] splverifierCounter = 0 Loop: [L699] COND TRUE 1 [L701] COND TRUE splverifierCounter < 4 [L707] tmp = __VERIFIER_nondet_int() [L709] COND FALSE !(\read(tmp)) [L717] tmp___0 = __VERIFIER_nondet_int() [L719] COND FALSE !(\read(tmp___0)) [L727] tmp___2 = __VERIFIER_nondet_int() [L729] COND TRUE \read(tmp___2) [L629] int retValue_acc ; [L632] retValue_acc = pumpRunning [L633] return (retValue_acc); [L895] switchedOnBeforeTS = isPumpRunning() [L531] COND FALSE !(\read(pumpRunning)) [L538] COND TRUE \read(systemActive) [L560] int tmp ; [L563] COND FALSE !(\read(pumpRunning)) [L901] int tmp ; [L902] int tmp___0 ; [L863] int retValue_acc ; [L866] retValue_acc = waterLevel [L867] return (retValue_acc); [L906] tmp = getWaterLevel() [L908] COND TRUE tmp != 2 [L629] int retValue_acc ; [L632] retValue_acc = pumpRunning [L633] return (retValue_acc); [L910] tmp___0 = isPumpRunning() [L912] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...