./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product25_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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_spec3_product25_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87372a1a98819a475f7685500d732b7a3f8e7449 ..................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-14 04:22:47,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:22:47,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:22:47,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:22:47,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:22:47,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:22:47,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:22:47,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:22:47,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:22:47,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:22:47,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:22:47,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:22:47,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:22:47,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:22:47,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:22:47,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:22:47,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:22:47,720 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:22:47,723 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:22:47,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:22:47,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:22:47,727 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:22:47,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:22:47,730 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:22:47,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:22:47,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:22:47,733 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:22:47,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:22:47,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:22:47,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:22:47,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:22:47,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:22:47,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:22:47,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:22:47,739 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:22:47,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:22:47,740 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:22:47,756 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:22:47,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:22:47,757 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:22:47,757 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:22:47,758 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:22:47,758 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:22:47,758 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:22:47,758 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:22:47,758 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:22:47,758 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:22:47,759 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:22:47,760 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:22:47,760 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:22:47,760 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:22:47,760 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:22:47,761 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:22:47,761 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:22:47,761 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:22:47,761 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:22:47,761 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:22:47,761 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:22:47,762 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:22:47,763 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:22:47,763 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:22:47,763 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:22:47,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:22:47,764 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:22:47,764 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:22:47,764 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:22:47,764 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:22:47,764 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:22:47,766 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:22:47,767 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 -> 87372a1a98819a475f7685500d732b7a3f8e7449 [2019-01-14 04:22:47,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:22:47,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:22:47,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:22:47,831 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:22:47,832 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:22:47,833 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product25_false-unreach-call_false-termination.cil.c [2019-01-14 04:22:47,891 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa8adbd3/49db79cea156471887ed4a98ad5cc392/FLAG4feaef16f [2019-01-14 04:22:48,391 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:22:48,396 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product25_false-unreach-call_false-termination.cil.c [2019-01-14 04:22:48,415 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa8adbd3/49db79cea156471887ed4a98ad5cc392/FLAG4feaef16f [2019-01-14 04:22:48,670 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa8adbd3/49db79cea156471887ed4a98ad5cc392 [2019-01-14 04:22:48,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:22:48,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:22:48,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:22:48,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:22:48,680 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:22:48,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:22:48" (1/1) ... [2019-01-14 04:22:48,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:48, skipping insertion in model container [2019-01-14 04:22:48,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:22:48" (1/1) ... [2019-01-14 04:22:48,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:22:48,747 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:22:49,139 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:22:49,160 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:22:49,308 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:22:49,353 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:22:49,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49 WrapperNode [2019-01-14 04:22:49,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:22:49,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:22:49,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:22:49,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:22:49,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (1/1) ... [2019-01-14 04:22:49,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (1/1) ... [2019-01-14 04:22:49,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:22:49,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:22:49,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:22:49,453 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:22:49,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (1/1) ... [2019-01-14 04:22:49,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (1/1) ... [2019-01-14 04:22:49,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (1/1) ... [2019-01-14 04:22:49,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (1/1) ... [2019-01-14 04:22:49,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (1/1) ... [2019-01-14 04:22:49,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (1/1) ... [2019-01-14 04:22:49,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (1/1) ... [2019-01-14 04:22:49,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:22:49,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:22:49,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:22:49,497 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:22:49,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (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-14 04:22:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:22:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:22:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:22:49,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:22:50,733 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:22:50,733 INFO L286 CfgBuilder]: Removed 102 assue(true) statements. [2019-01-14 04:22:50,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:22:50 BoogieIcfgContainer [2019-01-14 04:22:50,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:22:50,735 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:22:50,735 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:22:50,739 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:22:50,740 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:22:50,740 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:22:48" (1/3) ... [2019-01-14 04:22:50,741 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3276b07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:22:50, skipping insertion in model container [2019-01-14 04:22:50,741 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:22:50,741 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:22:49" (2/3) ... [2019-01-14 04:22:50,742 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3276b07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:22:50, skipping insertion in model container [2019-01-14 04:22:50,742 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:22:50,742 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:22:50" (3/3) ... [2019-01-14 04:22:50,744 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product25_false-unreach-call_false-termination.cil.c [2019-01-14 04:22:50,799 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:22:50,800 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:22:50,800 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:22:50,800 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:22:50,800 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:22:50,800 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:22:50,801 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:22:50,801 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:22:50,801 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:22:50,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states. [2019-01-14 04:22:50,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-14 04:22:50,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:50,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:50,851 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:50,851 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:50,851 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:22:50,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states. [2019-01-14 04:22:50,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-14 04:22:50,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:50,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:50,859 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:50,859 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:50,865 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(30);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(9);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(21);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(13);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string41.base, #t~string41.offset, 1);call write~init~int(77, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(101, #t~string41.base, 2 + #t~string41.offset, 1);call write~init~int(116, #t~string41.base, 3 + #t~string41.offset, 1);call write~init~int(104, #t~string41.base, 4 + #t~string41.offset, 1);call write~init~int(58, #t~string41.base, 5 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 6 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string43.base, #t~string43.offset, 1);call write~init~int(82, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(73, #t~string43.base, 2 + #t~string43.offset, 1);call write~init~int(84, #t~string43.base, 3 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 4 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(75, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string47.base, #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 1 + #t~string47.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1); 6#L-1true havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 58#L572true 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; 63#L580true main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 26#L670true assume 0 != main_~tmp~4; 77#L646true havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 15#L59-1true [2019-01-14 04:22:50,866 INFO L796 eck$LassoCheckResult]: Loop: 15#L59-1true assume !false; 16#L867true assume test_~splverifierCounter~0 < 4; 39#L868true test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 65#L876true assume !(0 != test_~tmp~8); 67#L876-1true test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 49#L886true assume !(0 != test_~tmp___0~2); 51#L886-1true test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 22#L896true assume 0 != test_~tmp___2~0; 64#L902-2true assume !(0 != ~pumpRunning~0); 68#L693true assume !(0 != ~systemActive~0); 59#L700true havoc __utac_acc__Specification3_spec__1_#t~ret0, __utac_acc__Specification3_spec__1_#t~ret1, __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 23#L501true __utac_acc__Specification3_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret0;havoc __utac_acc__Specification3_spec__1_#t~ret0; 70#L53true assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 15#L59-1true [2019-01-14 04:22:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:22:50,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:50,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:50,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:50,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:50,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:51,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:51,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1681683787, now seen corresponding path program 1 times [2019-01-14 04:22:51,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:51,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:51,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:51,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:51,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:51,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:51,739 INFO L82 PathProgramCache]: Analyzing trace with hash 32595151, now seen corresponding path program 1 times [2019-01-14 04:22:51,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:51,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:51,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:22:52,049 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-14 04:22:52,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:22:52,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:22:52,277 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:22:52,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:22:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:22:52,322 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 6 states. [2019-01-14 04:22:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:22:52,510 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2019-01-14 04:22:52,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:22:52,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 106 transitions. [2019-01-14 04:22:52,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-14 04:22:52,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 99 transitions. [2019-01-14 04:22:52,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-01-14 04:22:52,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-14 04:22:52,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2019-01-14 04:22:52,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:22:52,538 INFO L706 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-14 04:22:52,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2019-01-14 04:22:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-14 04:22:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 04:22:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-01-14 04:22:52,568 INFO L729 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-14 04:22:52,568 INFO L609 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-14 04:22:52,568 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:22:52,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2019-01-14 04:22:52,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-14 04:22:52,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:52,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:52,573 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:52,573 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:52,573 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(30);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(9);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(21);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(13);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string41.base, #t~string41.offset, 1);call write~init~int(77, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(101, #t~string41.base, 2 + #t~string41.offset, 1);call write~init~int(116, #t~string41.base, 3 + #t~string41.offset, 1);call write~init~int(104, #t~string41.base, 4 + #t~string41.offset, 1);call write~init~int(58, #t~string41.base, 5 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 6 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string43.base, #t~string43.offset, 1);call write~init~int(82, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(73, #t~string43.base, 2 + #t~string43.offset, 1);call write~init~int(84, #t~string43.base, 3 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 4 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(75, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string47.base, #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 1 + #t~string47.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1); 180#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 181#L572 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; 244#L580 main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 215#L670 assume 0 != main_~tmp~4; 216#L646 havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 193#L59-1 [2019-01-14 04:22:52,574 INFO L796 eck$LassoCheckResult]: Loop: 193#L59-1 assume !false; 194#L867 assume test_~splverifierCounter~0 < 4; 195#L868 test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 229#L876 assume !(0 != test_~tmp~8); 226#L876-1 test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 237#L886 assume !(0 != test_~tmp___0~2); 238#L886-1 test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 205#L896 assume 0 != test_~tmp___2~0; 206#L902-2 assume !(0 != ~pumpRunning~0); 191#L693 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 241#L725 assume !(0 != ~pumpRunning~0); 233#L700 havoc __utac_acc__Specification3_spec__1_#t~ret0, __utac_acc__Specification3_spec__1_#t~ret1, __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 208#L501 __utac_acc__Specification3_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret0;havoc __utac_acc__Specification3_spec__1_#t~ret0; 209#L53 assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 193#L59-1 [2019-01-14 04:22:52,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:52,574 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:22:52,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:52,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:52,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:52,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:52,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash -619582386, now seen corresponding path program 1 times [2019-01-14 04:22:52,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:52,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:52,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:22:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:52,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:52,919 INFO L82 PathProgramCache]: Analyzing trace with hash 983457140, now seen corresponding path program 1 times [2019-01-14 04:22:52,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:52,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:52,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:22:53,171 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-14 04:22:53,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:22:53,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:22:53,347 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:22:53,474 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:22:53,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:22:53,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:22:53,488 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 30 Second operand 5 states. [2019-01-14 04:22:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:22:54,351 INFO L93 Difference]: Finished difference Result 241 states and 345 transitions. [2019-01-14 04:22:54,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:22:54,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 345 transitions. [2019-01-14 04:22:54,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-01-14 04:22:54,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 241 states and 345 transitions. [2019-01-14 04:22:54,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2019-01-14 04:22:54,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2019-01-14 04:22:54,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 345 transitions. [2019-01-14 04:22:54,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:22:54,370 INFO L706 BuchiCegarLoop]: Abstraction has 241 states and 345 transitions. [2019-01-14 04:22:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 345 transitions. [2019-01-14 04:22:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 136. [2019-01-14 04:22:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-14 04:22:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2019-01-14 04:22:54,386 INFO L729 BuchiCegarLoop]: Abstraction has 136 states and 188 transitions. [2019-01-14 04:22:54,386 INFO L609 BuchiCegarLoop]: Abstraction has 136 states and 188 transitions. [2019-01-14 04:22:54,386 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:22:54,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 188 transitions. [2019-01-14 04:22:54,389 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 94 [2019-01-14 04:22:54,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:22:54,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:22:54,390 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:22:54,390 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:22:54,390 INFO L794 eck$LassoCheckResult]: Stem: 548#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(30);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(9);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(21);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(13);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string41.base, #t~string41.offset, 1);call write~init~int(77, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(101, #t~string41.base, 2 + #t~string41.offset, 1);call write~init~int(116, #t~string41.base, 3 + #t~string41.offset, 1);call write~init~int(104, #t~string41.base, 4 + #t~string41.offset, 1);call write~init~int(58, #t~string41.base, 5 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 6 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string43.base, #t~string43.offset, 1);call write~init~int(82, #t~string43.base, 1 + #t~string43.offset, 1);call write~init~int(73, #t~string43.base, 2 + #t~string43.offset, 1);call write~init~int(84, #t~string43.base, 3 + #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 4 + #t~string43.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(75, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string47.base, #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 1 + #t~string47.offset, 1);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1); 510#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 511#L572 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; 578#L580 main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 545#L670 assume 0 != main_~tmp~4; 546#L646 havoc test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 523#L59-1 [2019-01-14 04:22:54,392 INFO L796 eck$LassoCheckResult]: Loop: 523#L59-1 assume !false; 524#L867 assume test_~splverifierCounter~0 < 4; 525#L868 test_~tmp~8 := test_#t~nondet70;havoc test_#t~nondet70; 560#L876 assume !(0 != test_~tmp~8); 619#L876-1 test_~tmp___0~2 := test_#t~nondet71;havoc test_#t~nondet71; 618#L886 assume !(0 != test_~tmp___0~2); 617#L886-1 test_~tmp___2~0 := test_#t~nondet72;havoc test_#t~nondet72; 616#L896 assume 0 != test_~tmp___2~0; 613#L902-2 assume !(0 != ~pumpRunning~0); 584#L693 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret50, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 574#L725 assume !(0 != ~pumpRunning~0); 564#L700 havoc __utac_acc__Specification3_spec__1_#t~ret0, __utac_acc__Specification3_spec__1_#t~ret1, __utac_acc__Specification3_spec__1_#t~ret2, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 579#L501 __utac_acc__Specification3_spec__1_#t~ret0 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret0;havoc __utac_acc__Specification3_spec__1_#t~ret0; 586#L53 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~4;havoc getWaterLevel_~retValue_acc~4;getWaterLevel_~retValue_acc~4 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~4; 587#L533 __utac_acc__Specification3_spec__1_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret1;havoc __utac_acc__Specification3_spec__1_#t~ret1; 527#L59 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 523#L59-1 [2019-01-14 04:22:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:22:54,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:54,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:54,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1581787104, now seen corresponding path program 1 times [2019-01-14 04:22:54,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:54,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:54,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:22:54,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:54,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:22:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash 209512326, now seen corresponding path program 1 times [2019-01-14 04:22:54,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:22:54,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:22:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:54,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:22:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:22:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:22:55,692 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:22:56,105 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:23:23,605 WARN L181 SmtUtils]: Spent 27.49 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:23:36,849 WARN L181 SmtUtils]: Spent 13.24 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:23:36,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:23:36 BoogieIcfgContainer [2019-01-14 04:23:36,937 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:23:36,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:23:36,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:23:36,938 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:23:36,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:22:50" (3/4) ... [2019-01-14 04:23:36,945 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:23:37,048 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:23:37,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:23:37,052 INFO L168 Benchmark]: Toolchain (without parser) took 48377.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 243.3 MB). Free memory was 951.3 MB in the beginning and 873.1 MB in the end (delta: 78.2 MB). Peak memory consumption was 321.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:37,053 INFO L168 Benchmark]: CDTParser took 0.14 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-14 04:23:37,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:37,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:37,058 INFO L168 Benchmark]: Boogie Preprocessor took 45.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:23:37,058 INFO L168 Benchmark]: RCFGBuilder took 1237.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.7 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:37,060 INFO L168 Benchmark]: BuchiAutomizer took 46201.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 995.7 MB in the beginning and 876.3 MB in the end (delta: 119.4 MB). Peak memory consumption was 419.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:37,065 INFO L168 Benchmark]: Witness Printer took 113.27 ms. Allocated memory is still 1.3 GB. Free memory was 876.3 MB in the beginning and 873.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:23:37,071 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.14 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 677.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1237.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.7 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46201.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 995.7 MB in the beginning and 876.3 MB in the end (delta: 119.4 MB). Peak memory consumption was 419.9 MB. Max. memory is 11.5 GB. * Witness Printer took 113.27 ms. Allocated memory is still 1.3 GB. Free memory was 876.3 MB in the beginning and 873.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 136 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 44.8s. Construction of modules took 0.6s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 105 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 136 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 236 SDtfs, 672 SDslu, 402 SDs, 0 SdLazy, 51 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s 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: 866]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a43a513=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f65650d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cbc29df=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@704cc510=0, NULL=0, NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, NULL=-11, NULL=-22, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61caa8fc=0, NULL=-14, NULL=0, NULL=-12, NULL=0, NULL=-25, tmp___1=0, tmp=0, NULL=-5, tmp___0=1, NULL=-17, tmp=0, cleanupTimeShifts=4, NULL=-20, NULL=-3, NULL=-8, NULL=-4, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, NULL=-19, retValue_acc=0, NULL=-23, NULL=0, NULL=-7, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, \result=0, NULL=-6, tmp=1, NULL=-24, NULL=0, NULL=0, NULL=0, NULL=-13, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7507eea6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6df40300=71, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a51fc0c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c910441=0, retValue_acc=1, NULL=-10, tmp___2=71, tmp___0=0, retValue_acc=1, NULL=-2, NULL=-21, splverifierCounter=0, \result=0, tmp___1=0, head=0, NULL=0, tmp=0, NULL=-18, NULL=0, NULL=-1, NULL=0, NULL=0, NULL=0, NULL=-16, NULL=-15, NULL=-9} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L256] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L458] int waterLevel = 1; [L459] int methaneLevelCritical = 0; [L585] int cleanupTimeShifts = 4; [L686] int pumpRunning = 0; [L687] int systemActive = 1; [L661] int retValue_acc ; [L662] int tmp ; [L576] int retValue_acc ; [L579] retValue_acc = 1 [L580] return (retValue_acc); [L668] tmp = valid_product() [L670] COND TRUE \read(tmp) [L857] int splverifierCounter ; [L858] int tmp ; [L859] int tmp___0 ; [L860] int tmp___1 ; [L861] int tmp___2 ; [L864] splverifierCounter = 0 Loop: [L866] COND TRUE 1 [L868] COND TRUE splverifierCounter < 4 [L874] tmp = __VERIFIER_nondet_int() [L876] COND FALSE !(\read(tmp)) [L884] tmp___0 = __VERIFIER_nondet_int() [L886] COND FALSE !(\read(tmp___0)) [L894] tmp___2 = __VERIFIER_nondet_int() [L896] COND TRUE \read(tmp___2) [L693] COND FALSE !(\read(pumpRunning)) [L700] COND TRUE \read(systemActive) [L722] int tmp ; [L725] COND FALSE !(\read(pumpRunning)) [L45] int tmp ; [L46] int tmp___0 ; [L47] int tmp___1 ; [L497] int retValue_acc ; [L500] retValue_acc = methaneLevelCritical [L501] return (retValue_acc); [L51] tmp = isMethaneLevelCritical() [L53] COND FALSE !(\read(tmp)) [L529] int retValue_acc ; [L532] retValue_acc = waterLevel [L533] return (retValue_acc); [L57] tmp___0 = getWaterLevel() [L59] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...