./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product12_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec3_product12_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 a45474bbddd00a02338fe4b16e46d3dadff1b340 ........................................................................................................................................................................................................................................................................................................................................................................................................................... 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:41:47,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:41:47,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:41:47,699 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:41:47,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:41:47,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:41:47,704 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:41:47,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:41:47,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:41:47,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:41:47,717 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:41:47,718 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:41:47,718 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:41:47,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:41:47,721 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:41:47,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:41:47,725 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:41:47,728 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:41:47,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:41:47,740 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:41:47,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:41:47,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:41:47,747 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:41:47,748 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:41:47,748 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:41:47,749 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:41:47,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:41:47,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:41:47,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:41:47,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:41:47,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:41:47,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:41:47,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:41:47,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:41:47,761 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:41:47,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:41:47,764 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:41:47,786 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:41:47,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:41:47,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:41:47,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:41:47,789 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:41:47,791 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:41:47,791 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:41:47,791 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:41:47,792 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:41:47,792 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:41:47,792 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:41:47,792 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:41:47,792 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:41:47,793 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:41:47,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:41:47,793 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:41:47,793 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:41:47,793 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:41:47,793 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:41:47,794 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:41:47,794 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:41:47,794 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:41:47,794 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:41:47,794 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:41:47,794 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:41:47,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:41:47,795 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:41:47,795 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:41:47,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:41:47,795 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:41:47,796 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:41:47,796 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:41:47,797 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 -> a45474bbddd00a02338fe4b16e46d3dadff1b340 [2019-01-01 23:41:47,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:41:47,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:41:47,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:41:47,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:41:47,882 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:41:47,883 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product12_false-unreach-call_false-termination.cil.c [2019-01-01 23:41:47,941 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c768ce5f0/14684cde45c3441e9cdd9b45dbcee5bc/FLAG1ecb27e03 [2019-01-01 23:41:48,482 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:41:48,483 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product12_false-unreach-call_false-termination.cil.c [2019-01-01 23:41:48,508 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c768ce5f0/14684cde45c3441e9cdd9b45dbcee5bc/FLAG1ecb27e03 [2019-01-01 23:41:48,774 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c768ce5f0/14684cde45c3441e9cdd9b45dbcee5bc [2019-01-01 23:41:48,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:41:48,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:41:48,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:41:48,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:41:48,787 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:41:48,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:41:48" (1/1) ... [2019-01-01 23:41:48,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5801be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:48, skipping insertion in model container [2019-01-01 23:41:48,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:41:48" (1/1) ... [2019-01-01 23:41:48,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:41:48,865 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:41:49,209 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:41:49,238 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:41:49,344 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:41:49,396 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:41:49,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:49 WrapperNode [2019-01-01 23:41:49,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:41:49,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:41:49,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:41:49,398 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:41:49,478 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:41:49" (1/1) ... [2019-01-01 23:41:49,504 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:41:49" (1/1) ... [2019-01-01 23:41:49,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:41:49,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:41:49,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:41:49,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:41:49,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:49" (1/1) ... [2019-01-01 23:41:49,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:49" (1/1) ... [2019-01-01 23:41:49,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:49" (1/1) ... [2019-01-01 23:41:49,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:49" (1/1) ... [2019-01-01 23:41:49,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:49" (1/1) ... [2019-01-01 23:41:49,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:49" (1/1) ... [2019-01-01 23:41:49,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:49" (1/1) ... [2019-01-01 23:41:49,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:41:49,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:41:49,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:41:49,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:41:49,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41: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-01 23:41:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:41:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:41:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:41:49,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:41:50,652 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:41:50,653 INFO L280 CfgBuilder]: Removed 78 assue(true) statements. [2019-01-01 23:41:50,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:41:50 BoogieIcfgContainer [2019-01-01 23:41:50,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:41:50,654 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:41:50,654 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:41:50,659 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:41:50,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:41:50,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:41:48" (1/3) ... [2019-01-01 23:41:50,661 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fcb50d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:41:50, skipping insertion in model container [2019-01-01 23:41:50,661 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:41:50,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:41:49" (2/3) ... [2019-01-01 23:41:50,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fcb50d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:41:50, skipping insertion in model container [2019-01-01 23:41:50,663 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:41:50,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:41:50" (3/3) ... [2019-01-01 23:41:50,670 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product12_false-unreach-call_false-termination.cil.c [2019-01-01 23:41:50,739 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:41:50,739 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:41:50,739 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:41:50,740 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:41:50,740 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:41:50,740 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:41:50,740 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:41:50,740 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:41:50,740 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:41:50,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2019-01-01 23:41:50,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-01-01 23:41:50,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:41:50,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:41:50,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:41:50,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:41:50,799 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:41:50,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2019-01-01 23:41:50,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-01-01 23:41:50,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:41:50,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:41:50,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:41:50,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:41:50,811 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(13);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string16.base, #t~string16.offset, 1);call write~init~int(80, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(117, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(109, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(112, #t~string16.base, 4 + #t~string16.offset, 1);call write~init~int(58, #t~string16.base, 5 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 6 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string22.base, #t~string22.offset, 1);call write~init~int(32, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string24.base, #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 1 + #t~string24.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(77, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(101, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(116, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(104, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string30.base, #t~string30.offset, 1);call write~init~int(82, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(73, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(84, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 4 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(75, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 2 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 4#L-1true havoc main_#res;havoc main_#t~ret71, main_~retValue_acc~9, main_~tmp~6;havoc main_~retValue_acc~9;havoc main_~tmp~6; 59#L411true havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 63#L419true main_#t~ret71 := valid_product_#res;main_~tmp~6 := main_#t~ret71;havoc main_#t~ret71; 55#L872true assume 0 != main_~tmp~6; 33#L849true havoc test_#t~nondet3, test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 10#L59-1true [2019-01-01 23:41:50,812 INFO L796 eck$LassoCheckResult]: Loop: 10#L59-1true assume !false; 23#L95true assume test_~splverifierCounter~0 < 4; 54#L96true test_~tmp~1 := test_#t~nondet3;havoc test_#t~nondet3; 50#L104true assume !(0 != test_~tmp~1); 49#L104-1true test_~tmp___0~1 := test_#t~nondet4;havoc test_#t~nondet4; 17#L114true assume !(0 != test_~tmp___0~1); 15#L114-1true test_~tmp___2~0 := test_#t~nondet5;havoc test_#t~nondet5; 3#L124true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 38#L132-1true assume !(0 != ~pumpRunning~0); 11#L165true assume !(0 != ~systemActive~0); 30#L172true 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~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 56#L349true __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; 64#L53true assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 10#L59-1true [2019-01-01 23:41:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:41:50,818 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:41:50,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:41:50,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:41:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:50,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:41:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:41:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1672941121, now seen corresponding path program 1 times [2019-01-01 23:41:51,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:41:51,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:41:51,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:51,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:41:51,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:41:51,773 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:41:51,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:41:51,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:41:51,779 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:41:51,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:41:51,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:41:51,800 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2019-01-01 23:41:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:41:51,911 INFO L93 Difference]: Finished difference Result 118 states and 162 transitions. [2019-01-01 23:41:51,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:41:51,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 162 transitions. [2019-01-01 23:41:51,930 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 74 [2019-01-01 23:41:51,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 104 states and 147 transitions. [2019-01-01 23:41:51,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2019-01-01 23:41:51,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2019-01-01 23:41:51,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 147 transitions. [2019-01-01 23:41:51,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:41:51,944 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 23:41:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 147 transitions. [2019-01-01 23:41:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-01-01 23:41:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 23:41:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2019-01-01 23:41:51,982 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 144 transitions. [2019-01-01 23:41:51,982 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 144 transitions. [2019-01-01 23:41:51,982 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:41:51,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 144 transitions. [2019-01-01 23:41:51,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 72 [2019-01-01 23:41:51,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:41:51,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:41:51,986 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:41:51,986 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:41:51,986 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(13);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string16.base, #t~string16.offset, 1);call write~init~int(80, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(117, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(109, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(112, #t~string16.base, 4 + #t~string16.offset, 1);call write~init~int(58, #t~string16.base, 5 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 6 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string22.base, #t~string22.offset, 1);call write~init~int(32, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string24.base, #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 1 + #t~string24.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(77, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(101, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(116, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(104, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string30.base, #t~string30.offset, 1);call write~init~int(82, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(73, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(84, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 4 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(75, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 2 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 192#L-1 havoc main_#res;havoc main_#t~ret71, main_~retValue_acc~9, main_~tmp~6;havoc main_~retValue_acc~9;havoc main_~tmp~6; 193#L411 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 260#L419 main_#t~ret71 := valid_product_#res;main_~tmp~6 := main_#t~ret71;havoc main_#t~ret71; 257#L872 assume 0 != main_~tmp~6; 233#L849 havoc test_#t~nondet3, test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 206#L59-1 [2019-01-01 23:41:51,987 INFO L796 eck$LassoCheckResult]: Loop: 206#L59-1 assume !false; 262#L95 assume test_~splverifierCounter~0 < 4; 255#L96 test_~tmp~1 := test_#t~nondet3;havoc test_#t~nondet3; 256#L104 assume !(0 != test_~tmp~1); 248#L104-1 test_~tmp___0~1 := test_#t~nondet4;havoc test_#t~nondet4; 249#L114 assume !(0 != test_~tmp___0~1); 269#L114-1 test_~tmp___2~0 := test_#t~nondet5;havoc test_#t~nondet5; 189#L124 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 190#L132-1 assume !(0 != ~pumpRunning~0); 240#L165 assume 0 != ~systemActive~0; 266#L172 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~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 258#L349 __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; 259#L53 assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 206#L59-1 [2019-01-01 23:41:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:41:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:41:51,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:41:51,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:41:51,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:51,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:41:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:41:52,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1673030494, now seen corresponding path program 1 times [2019-01-01 23:41:52,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:41:52,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:41:52,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:52,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:41:52,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:41:52,403 INFO L82 PathProgramCache]: Analyzing trace with hash 41248444, now seen corresponding path program 1 times [2019-01-01 23:41:52,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:41:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:41:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:52,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:41:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:41:52,619 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:41:52,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:41:52,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:41:52,782 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-01 23:41:52,928 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 23:41:52,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:41:52,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:41:52,940 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. cyclomatic complexity: 45 Second operand 5 states. [2019-01-01 23:41:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:41:53,471 INFO L93 Difference]: Finished difference Result 319 states and 461 transitions. [2019-01-01 23:41:53,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:41:53,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 461 transitions. [2019-01-01 23:41:53,484 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 240 [2019-01-01 23:41:53,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 461 transitions. [2019-01-01 23:41:53,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2019-01-01 23:41:53,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 319 [2019-01-01 23:41:53,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 461 transitions. [2019-01-01 23:41:53,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:41:53,503 INFO L705 BuchiCegarLoop]: Abstraction has 319 states and 461 transitions. [2019-01-01 23:41:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 461 transitions. [2019-01-01 23:41:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 198. [2019-01-01 23:41:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-01 23:41:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 274 transitions. [2019-01-01 23:41:53,539 INFO L728 BuchiCegarLoop]: Abstraction has 198 states and 274 transitions. [2019-01-01 23:41:53,539 INFO L608 BuchiCegarLoop]: Abstraction has 198 states and 274 transitions. [2019-01-01 23:41:53,539 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:41:53,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 274 transitions. [2019-01-01 23:41:53,543 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 144 [2019-01-01 23:41:53,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:41:53,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:41:53,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:41:53,544 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:41:53,547 INFO L794 eck$LassoCheckResult]: Stem: 666#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(13);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string12.base, #t~string12.offset, 1);call write~init~int(110, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 2 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(102, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 3 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string16.base, #t~string16.offset, 1);call write~init~int(80, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(117, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(109, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(112, #t~string16.base, 4 + #t~string16.offset, 1);call write~init~int(58, #t~string16.base, 5 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 6 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string22.base, #t~string22.offset, 1);call write~init~int(32, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string24.base, #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 1 + #t~string24.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(77, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(101, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(116, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(104, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string30.base, #t~string30.offset, 1);call write~init~int(82, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(73, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(84, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 4 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(75, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 2 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 1 + #t~string34.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 631#L-1 havoc main_#res;havoc main_#t~ret71, main_~retValue_acc~9, main_~tmp~6;havoc main_~retValue_acc~9;havoc main_~tmp~6; 632#L411 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 701#L419 main_#t~ret71 := valid_product_#res;main_~tmp~6 := main_#t~ret71;havoc main_#t~ret71; 697#L872 assume 0 != main_~tmp~6; 677#L849 havoc test_#t~nondet3, test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 638#L59-1 [2019-01-01 23:41:53,547 INFO L796 eck$LassoCheckResult]: Loop: 638#L59-1 assume !false; 639#L95 assume test_~splverifierCounter~0 < 4; 662#L96 test_~tmp~1 := test_#t~nondet3;havoc test_#t~nondet3; 816#L104 assume !(0 != test_~tmp~1); 813#L104-1 test_~tmp___0~1 := test_#t~nondet4;havoc test_#t~nondet4; 811#L114 assume !(0 != test_~tmp___0~1); 809#L114-1 test_~tmp___2~0 := test_#t~nondet5;havoc test_#t~nondet5; 808#L124 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 805#L132-1 assume !(0 != ~pumpRunning~0); 800#L165 assume 0 != ~systemActive~0; 797#L172 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~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 796#L349 __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; 702#L53 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~3;havoc getWaterLevel_~retValue_acc~3;getWaterLevel_~retValue_acc~3 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~3; 703#L381 __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; 645#L59 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 638#L59-1 [2019-01-01 23:41:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:41:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:41:53,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:41:53,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:41:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:53,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:41:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:53,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:41:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1464530636, now seen corresponding path program 1 times [2019-01-01 23:41:53,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:41:53,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:41:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:53,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:41:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:41:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 985054414, now seen corresponding path program 1 times [2019-01-01 23:41:53,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:41:53,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:41:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:53,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:41:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:41:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:41:54,699 WARN L181 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-01-01 23:41:55,007 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:42:25,179 WARN L181 SmtUtils]: Spent 30.15 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:42:40,275 WARN L181 SmtUtils]: Spent 15.10 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:42:40,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:42:40 BoogieIcfgContainer [2019-01-01 23:42:40,362 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:42:40,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:42:40,362 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:42:40,363 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:42:40,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:41:50" (3/4) ... [2019-01-01 23:42:40,369 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:42:40,480 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:42:40,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:42:40,482 INFO L168 Benchmark]: Toolchain (without parser) took 51702.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.1 MB). Free memory was 948.7 MB in the beginning and 902.7 MB in the end (delta: 46.0 MB). Peak memory consumption was 361.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:42:40,484 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:42:40,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.92 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 921.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:42:40,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -205.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:42:40,485 INFO L168 Benchmark]: Boogie Preprocessor took 51.11 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:42:40,486 INFO L168 Benchmark]: RCFGBuilder took 1060.73 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:42:40,486 INFO L168 Benchmark]: BuchiAutomizer took 49707.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 904.7 MB in the end (delta: 171.3 MB). Peak memory consumption was 417.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:42:40,488 INFO L168 Benchmark]: Witness Printer took 118.41 ms. Allocated memory is still 1.3 GB. Free memory was 904.7 MB in the beginning and 902.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:42:40,493 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 613.92 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 921.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 143.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -205.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.11 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 1060.73 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 49707.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 904.7 MB in the end (delta: 171.3 MB). Peak memory consumption was 417.9 MB. Max. memory is 11.5 GB. * Witness Printer took 118.41 ms. Allocated memory is still 1.3 GB. Free memory was 904.7 MB in the beginning and 902.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.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 5 locations. The remainder module has 198 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 49.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 48.7s. Construction of modules took 0.4s. 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, 123 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 198 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 186 SDtfs, 347 SDslu, 361 SDs, 0 SdLazy, 53 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 94]: 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@6da1f0dd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5822f793=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5170448d=0, NULL=0, NULL=-25, NULL=-23, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@609dcefd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@103af66=70, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a1c75ae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18c8aad0=0, NULL=-6, retValue_acc=0, NULL=-8, NULL=-12, methaneLevelCritical=0, NULL=0, NULL=0, NULL=0, NULL=-24, NULL=0, tmp___1=0, tmp___0=1, NULL=-7, NULL=-11, tmp=0, cleanupTimeShifts=4, NULL=-22, tmp=0, NULL=-15, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, NULL=0, NULL=-10, NULL=0, NULL=-9, retValue_acc=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, retValue_acc=1, \result=1, NULL=-2, head=0, pumpRunning=0, NULL=-3, \result=0, NULL=-19, NULL=0, NULL=0, NULL=0, tmp=1, retValue_acc=1, NULL=-20, NULL=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@124e738=0, tmp___2=70, NULL=-14, tmp___0=0, NULL=-13, splverifierCounter=0, NULL=0, \result=0, NULL=-16, tmp___1=0, head=0, NULL=0, NULL=0, NULL=-21, NULL=0, NULL=0, NULL=-17, NULL=-4, NULL=0, NULL=-1, NULL=-18} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L158] int pumpRunning = 0; [L159] int systemActive = 1; [L306] int waterLevel = 1; [L307] int methaneLevelCritical = 0; [L593] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L790] int cleanupTimeShifts = 4; [L863] int retValue_acc ; [L864] int tmp ; [L415] int retValue_acc ; [L418] retValue_acc = 1 [L419] return (retValue_acc); [L870] tmp = valid_product() [L872] COND TRUE \read(tmp) [L85] int splverifierCounter ; [L86] int tmp ; [L87] int tmp___0 ; [L88] int tmp___1 ; [L89] int tmp___2 ; [L92] splverifierCounter = 0 Loop: [L94] COND TRUE 1 [L96] COND TRUE splverifierCounter < 4 [L102] tmp = __VERIFIER_nondet_int() [L104] COND FALSE !(\read(tmp)) [L112] tmp___0 = __VERIFIER_nondet_int() [L114] COND FALSE !(\read(tmp___0)) [L122] tmp___2 = __VERIFIER_nondet_int() [L124] COND TRUE \read(tmp___2) [L301] systemActive = 1 [L165] COND FALSE !(\read(pumpRunning)) [L172] COND TRUE \read(systemActive) [L45] int tmp ; [L46] int tmp___0 ; [L47] int tmp___1 ; [L345] int retValue_acc ; [L348] retValue_acc = methaneLevelCritical [L349] return (retValue_acc); [L51] tmp = isMethaneLevelCritical() [L53] COND FALSE !(\read(tmp)) [L377] int retValue_acc ; [L380] retValue_acc = waterLevel [L381] 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...