./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product51_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product51_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0140910feaef212f3eb8993aa9e49d2064d898fa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:52:26,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:52:26,012 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:52:26,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:52:26,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:52:26,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:52:26,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:52:26,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:52:26,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:52:26,044 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:52:26,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:52:26,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:52:26,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:52:26,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:52:26,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:52:26,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:52:26,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:52:26,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:52:26,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:52:26,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:52:26,073 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:52:26,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:52:26,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:52:26,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:52:26,082 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:52:26,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:52:26,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:52:26,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:52:26,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:52:26,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:52:26,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:52:26,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:52:26,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:52:26,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:52:26,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:52:26,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:52:26,099 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:52:26,121 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:52:26,121 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:52:26,125 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:52:26,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:52:26,125 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:52:26,125 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:52:26,126 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:52:26,126 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:52:26,126 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:52:26,126 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:52:26,126 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:52:26,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:52:26,127 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:52:26,127 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:52:26,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:52:26,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:52:26,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:52:26,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:52:26,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:52:26,129 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:52:26,129 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:52:26,129 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:52:26,129 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:52:26,129 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:52:26,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:52:26,130 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:52:26,130 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:52:26,130 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:52:26,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:52:26,130 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:52:26,130 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:52:26,132 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:52:26,132 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 -> 0140910feaef212f3eb8993aa9e49d2064d898fa [2019-01-01 23:52:26,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:52:26,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:52:26,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:52:26,205 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:52:26,206 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:52:26,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product51_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:26,269 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a448126/3ab6ae01d64442aca6cb4a9546006c9d/FLAG80c4c115f [2019-01-01 23:52:26,799 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:52:26,803 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product51_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:26,818 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a448126/3ab6ae01d64442aca6cb4a9546006c9d/FLAG80c4c115f [2019-01-01 23:52:27,106 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a448126/3ab6ae01d64442aca6cb4a9546006c9d [2019-01-01 23:52:27,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:52:27,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:52:27,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:52:27,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:52:27,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:52:27,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:52:27" (1/1) ... [2019-01-01 23:52:27,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22099427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27, skipping insertion in model container [2019-01-01 23:52:27,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:52:27" (1/1) ... [2019-01-01 23:52:27,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:52:27,185 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:52:27,579 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:52:27,609 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:52:27,787 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:52:27,834 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:52:27,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27 WrapperNode [2019-01-01 23:52:27,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:52:27,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:52:27,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:52:27,836 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:52:27,843 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:52:27" (1/1) ... [2019-01-01 23:52:27,865 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:52:27" (1/1) ... [2019-01-01 23:52:27,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:52:27,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:52:27,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:52:27,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:52:27,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27" (1/1) ... [2019-01-01 23:52:27,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27" (1/1) ... [2019-01-01 23:52:27,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27" (1/1) ... [2019-01-01 23:52:27,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27" (1/1) ... [2019-01-01 23:52:27,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27" (1/1) ... [2019-01-01 23:52:27,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27" (1/1) ... [2019-01-01 23:52:27,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27" (1/1) ... [2019-01-01 23:52:27,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:52:27,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:52:27,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:52:27,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:52:27,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27" (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:52:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:52:28,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:52:28,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:52:28,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:52:29,543 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:52:29,544 INFO L280 CfgBuilder]: Removed 174 assue(true) statements. [2019-01-01 23:52:29,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:29 BoogieIcfgContainer [2019-01-01 23:52:29,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:52:29,545 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:52:29,545 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:52:29,550 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:52:29,551 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:29,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:52:27" (1/3) ... [2019-01-01 23:52:29,553 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aeb30bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:52:29, skipping insertion in model container [2019-01-01 23:52:29,553 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:29,553 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:52:27" (2/3) ... [2019-01-01 23:52:29,553 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aeb30bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:52:29, skipping insertion in model container [2019-01-01 23:52:29,554 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:52:29,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:29" (3/3) ... [2019-01-01 23:52:29,557 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product51_true-unreach-call_false-termination.cil.c [2019-01-01 23:52:29,620 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:52:29,621 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:52:29,621 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:52:29,622 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:52:29,622 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:52:29,622 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:52:29,622 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:52:29,623 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:52:29,623 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:52:29,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-01-01 23:52:29,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-01 23:52:29,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:29,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:29,689 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:29,690 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:52:29,690 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:52:29,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2019-01-01 23:52:29,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-01 23:52:29,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:29,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:29,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:29,704 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:52:29,711 INFO L794 eck$LassoCheckResult]: Stem: 95#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);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(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);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(25);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(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1);~switchedOnBeforeTS~0 := 0; 8#L-1true havoc main_#res;havoc main_#t~ret21, main_~retValue_acc~4, main_~tmp~4;havoc main_~retValue_acc~4;havoc main_~tmp~4; 17#L461true havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 34#L469true main_#t~ret21 := valid_product_#res;main_~tmp~4 := main_#t~ret21;havoc main_#t~ret21; 78#L358true assume 0 != main_~tmp~4; 10#L329true ~switchedOnBeforeTS~0 := 0; 36#L959true havoc test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_#t~nondet25, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 66#L980-1true [2019-01-01 23:52:29,718 INFO L796 eck$LassoCheckResult]: Loop: 66#L980-1true assume !false; 63#L383true assume test_~splverifierCounter~0 < 4; 23#L384true test_~tmp~5 := test_#t~nondet22;havoc test_#t~nondet22; 29#L392true assume !(0 != test_~tmp~5); 31#L392-1true test_~tmp___0~2 := test_#t~nondet23;havoc test_#t~nondet23; 70#L402true assume !(0 != test_~tmp___0~2); 76#L402-1true test_~tmp___2~0 := test_#t~nondet24;havoc test_#t~nondet24; 122#L412true assume 0 != test_~tmp___2~0; 111#L418-1true havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 54#L174true __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 65#L969true assume !(0 != ~pumpRunning~0); 113#L63true assume !(0 != ~systemActive~0); 18#L70true havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~11;havoc getWaterLevel_~retValue_acc~11;getWaterLevel_~retValue_acc~11 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~11; 114#L916true __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 64#L980true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 66#L980-1true [2019-01-01 23:52:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:52:29,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:29,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:29,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:29,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:30,641 INFO L82 PathProgramCache]: Analyzing trace with hash -240044843, now seen corresponding path program 1 times [2019-01-01 23:52:30,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:30,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:30,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:30,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:30,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:30,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1693980367, now seen corresponding path program 1 times [2019-01-01 23:52:30,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:30,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:30,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:30,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:31,013 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:52:31,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:31,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:52:31,206 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:52:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:52:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:52:31,298 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 6 states. [2019-01-01 23:52:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:32,068 INFO L93 Difference]: Finished difference Result 301 states and 430 transitions. [2019-01-01 23:52:32,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:52:32,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 430 transitions. [2019-01-01 23:52:32,094 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 195 [2019-01-01 23:52:32,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 280 states and 409 transitions. [2019-01-01 23:52:32,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 280 [2019-01-01 23:52:32,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 280 [2019-01-01 23:52:32,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 280 states and 409 transitions. [2019-01-01 23:52:32,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:32,127 INFO L705 BuchiCegarLoop]: Abstraction has 280 states and 409 transitions. [2019-01-01 23:52:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states and 409 transitions. [2019-01-01 23:52:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 167. [2019-01-01 23:52:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-01 23:52:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2019-01-01 23:52:32,198 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 242 transitions. [2019-01-01 23:52:32,198 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 242 transitions. [2019-01-01 23:52:32,198 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:52:32,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 242 transitions. [2019-01-01 23:52:32,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 116 [2019-01-01 23:52:32,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:32,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:32,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:32,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:32,205 INFO L794 eck$LassoCheckResult]: Stem: 556#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);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(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);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(25);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(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1);~switchedOnBeforeTS~0 := 0; 457#L-1 havoc main_#res;havoc main_#t~ret21, main_~retValue_acc~4, main_~tmp~4;havoc main_~retValue_acc~4;havoc main_~tmp~4; 458#L461 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 475#L469 main_#t~ret21 := valid_product_#res;main_~tmp~4 := main_#t~ret21;havoc main_#t~ret21; 498#L358 assume 0 != main_~tmp~4; 462#L329 ~switchedOnBeforeTS~0 := 0; 463#L959 havoc test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_#t~nondet25, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 472#L980-1 [2019-01-01 23:52:32,205 INFO L796 eck$LassoCheckResult]: Loop: 472#L980-1 assume !false; 534#L383 assume test_~splverifierCounter~0 < 4; 485#L384 test_~tmp~5 := test_#t~nondet22;havoc test_#t~nondet22; 486#L392 assume !(0 != test_~tmp~5); 493#L392-1 test_~tmp___0~2 := test_#t~nondet23;havoc test_#t~nondet23; 494#L402 assume !(0 != test_~tmp___0~2); 496#L402-1 test_~tmp___2~0 := test_#t~nondet24;havoc test_#t~nondet24; 546#L412 assume 0 != test_~tmp___2~0; 562#L418-1 havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 524#L174 __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 525#L969 assume !(0 != ~pumpRunning~0); 537#L63 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 558#L121 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 454#L95-1 assume !(0 == ~pumpRunning~0); 455#L70 havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~11;havoc getWaterLevel_~retValue_acc~11;getWaterLevel_~retValue_acc~11 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~11; 476#L916 __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 535#L980 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 472#L980-1 [2019-01-01 23:52:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:52:32,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:32,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:32,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:32,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1395551213, now seen corresponding path program 1 times [2019-01-01 23:52:32,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:32,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:32,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:32,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:32,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:32,646 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:52:32,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:32,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:52:32,647 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:32,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:52:32,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:52:32,649 INFO L87 Difference]: Start difference. First operand 167 states and 242 transitions. cyclomatic complexity: 78 Second operand 3 states. [2019-01-01 23:52:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:33,455 INFO L93 Difference]: Finished difference Result 214 states and 293 transitions. [2019-01-01 23:52:33,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:52:33,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 293 transitions. [2019-01-01 23:52:33,460 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 152 [2019-01-01 23:52:33,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 293 transitions. [2019-01-01 23:52:33,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-01-01 23:52:33,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2019-01-01 23:52:33,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 293 transitions. [2019-01-01 23:52:33,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:33,472 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 293 transitions. [2019-01-01 23:52:33,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 293 transitions. [2019-01-01 23:52:33,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-01-01 23:52:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-01 23:52:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 293 transitions. [2019-01-01 23:52:33,498 INFO L728 BuchiCegarLoop]: Abstraction has 214 states and 293 transitions. [2019-01-01 23:52:33,498 INFO L608 BuchiCegarLoop]: Abstraction has 214 states and 293 transitions. [2019-01-01 23:52:33,498 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:52:33,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 293 transitions. [2019-01-01 23:52:33,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 152 [2019-01-01 23:52:33,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:33,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:33,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:33,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:33,506 INFO L794 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);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(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);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(25);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(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1);~switchedOnBeforeTS~0 := 0; 843#L-1 havoc main_#res;havoc main_#t~ret21, main_~retValue_acc~4, main_~tmp~4;havoc main_~retValue_acc~4;havoc main_~tmp~4; 844#L461 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 863#L469 main_#t~ret21 := valid_product_#res;main_~tmp~4 := main_#t~ret21;havoc main_#t~ret21; 891#L358 assume 0 != main_~tmp~4; 848#L329 ~switchedOnBeforeTS~0 := 0; 849#L959 havoc test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_#t~nondet25, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 894#L980-1 [2019-01-01 23:52:33,506 INFO L796 eck$LassoCheckResult]: Loop: 894#L980-1 assume !false; 1021#L383 assume test_~splverifierCounter~0 < 4; 1022#L384 test_~tmp~5 := test_#t~nondet22;havoc test_#t~nondet22; 1039#L392 assume !(0 != test_~tmp~5); 1037#L392-1 test_~tmp___0~2 := test_#t~nondet23;havoc test_#t~nondet23; 1036#L402 assume !(0 != test_~tmp___0~2); 1034#L402-1 test_~tmp___2~0 := test_#t~nondet24;havoc test_#t~nondet24; 966#L412 assume 0 != test_~tmp___2~0; 960#L418-1 havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 920#L174 __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 921#L969 assume !(0 != ~pumpRunning~0); 932#L63 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 955#L121 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 841#L95-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret19, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~12;havoc isHighWaterSensorDry_~retValue_acc~12; 842#L924-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~12 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~12; 878#L929-1 isHighWaterLevel_#t~ret19 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret19;havoc isHighWaterLevel_#t~ret19; 879#L223-3 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~0 := 0; 924#L223-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 922#L229-1 processEnvironment__wrappee__highWaterSensor_#t~ret0 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret0;havoc processEnvironment__wrappee__highWaterSensor_#t~ret0; 923#L99-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 874#L70 havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~11;havoc getWaterLevel_~retValue_acc~11;getWaterLevel_~retValue_acc~11 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~11; 1027#L916 __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 1025#L980 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 894#L980-1 [2019-01-01 23:52:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:52:33,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:33,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:33,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:33,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:33,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:33,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1667768609, now seen corresponding path program 1 times [2019-01-01 23:52:33,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:33,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:33,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:33,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:33,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:52:34,121 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:52:34,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:52:34,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:52:34,121 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:52:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:52:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:52:34,122 INFO L87 Difference]: Start difference. First operand 214 states and 293 transitions. cyclomatic complexity: 82 Second operand 5 states. [2019-01-01 23:52:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:52:35,286 INFO L93 Difference]: Finished difference Result 576 states and 773 transitions. [2019-01-01 23:52:35,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:52:35,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 576 states and 773 transitions. [2019-01-01 23:52:35,294 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 385 [2019-01-01 23:52:35,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 576 states to 576 states and 773 transitions. [2019-01-01 23:52:35,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 576 [2019-01-01 23:52:35,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 576 [2019-01-01 23:52:35,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 576 states and 773 transitions. [2019-01-01 23:52:35,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:52:35,302 INFO L705 BuchiCegarLoop]: Abstraction has 576 states and 773 transitions. [2019-01-01 23:52:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states and 773 transitions. [2019-01-01 23:52:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 421. [2019-01-01 23:52:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-01 23:52:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 561 transitions. [2019-01-01 23:52:35,319 INFO L728 BuchiCegarLoop]: Abstraction has 421 states and 561 transitions. [2019-01-01 23:52:35,319 INFO L608 BuchiCegarLoop]: Abstraction has 421 states and 561 transitions. [2019-01-01 23:52:35,319 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:52:35,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 421 states and 561 transitions. [2019-01-01 23:52:35,322 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 304 [2019-01-01 23:52:35,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:52:35,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:52:35,323 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:35,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:52:35,323 INFO L794 eck$LassoCheckResult]: Stem: 1760#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string6.base, #t~string6.offset, 1);call write~init~int(110, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 2 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(102, #t~string8.base, 2 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 3 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(80, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(117, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(109, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(112, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);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(3);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(32, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string18.base, #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 1 + #t~string18.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);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(25);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(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1);~switchedOnBeforeTS~0 := 0; 1649#L-1 havoc main_#res;havoc main_#t~ret21, main_~retValue_acc~4, main_~tmp~4;havoc main_~retValue_acc~4;havoc main_~tmp~4; 1650#L461 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 1669#L469 main_#t~ret21 := valid_product_#res;main_~tmp~4 := main_#t~ret21;havoc main_#t~ret21; 1697#L358 assume 0 != main_~tmp~4; 1654#L329 ~switchedOnBeforeTS~0 := 0; 1655#L959 havoc test_#t~nondet22, test_#t~nondet23, test_#t~nondet24, test_#t~nondet25, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1665#L980-1 [2019-01-01 23:52:35,327 INFO L796 eck$LassoCheckResult]: Loop: 1665#L980-1 assume !false; 1735#L383 assume test_~splverifierCounter~0 < 4; 1736#L384 test_~tmp~5 := test_#t~nondet22;havoc test_#t~nondet22; 1945#L392 assume !(0 != test_~tmp~5); 1946#L392-1 test_~tmp___0~2 := test_#t~nondet23;havoc test_#t~nondet23; 2040#L402 assume !(0 != test_~tmp___0~2); 2038#L402-1 test_~tmp___2~0 := test_#t~nondet24;havoc test_#t~nondet24; 2027#L412 assume 0 != test_~tmp___2~0; 2025#L418-1 havoc __utac_acc__Specification5_spec__2_#t~ret72;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 2041#L174 __utac_acc__Specification5_spec__2_#t~ret72 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret72;havoc __utac_acc__Specification5_spec__2_#t~ret72; 1738#L969 assume !(0 != ~pumpRunning~0); 1739#L63 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret1, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 1763#L121 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret0, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 1647#L95-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret19, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~12;havoc isHighWaterSensorDry_~retValue_acc~12; 1648#L924-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~12 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~12; 1683#L929-1 isHighWaterLevel_#t~ret19 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret19;havoc isHighWaterLevel_#t~ret19; 1684#L223-3 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~0 := 0; 1729#L223-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 1727#L229-1 processEnvironment__wrappee__highWaterSensor_#t~ret0 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret0;havoc processEnvironment__wrappee__highWaterSensor_#t~ret0; 1728#L99-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 1670#L70 havoc __utac_acc__Specification5_spec__3_#t~ret73, __utac_acc__Specification5_spec__3_#t~ret74, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~11;havoc getWaterLevel_~retValue_acc~11;getWaterLevel_~retValue_acc~11 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~11; 1671#L916 __utac_acc__Specification5_spec__3_#t~ret73 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 1737#L980 assume 2 != __utac_acc__Specification5_spec__3_~tmp~9;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 1722#L174-1 __utac_acc__Specification5_spec__3_#t~ret74 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~3 := __utac_acc__Specification5_spec__3_#t~ret74;havoc __utac_acc__Specification5_spec__3_#t~ret74; 1664#L984 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~3); 1665#L980-1 [2019-01-01 23:52:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-01-01 23:52:35,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:35,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:35,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:35,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash -702843718, now seen corresponding path program 1 times [2019-01-01 23:52:35,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:35,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:35,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:52:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:52:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash -766269900, now seen corresponding path program 1 times [2019-01-01 23:52:35,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:52:35,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:52:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:52:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:52:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:52:36,171 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-01 23:53:06,051 WARN L181 SmtUtils]: Spent 29.79 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:53:20,633 WARN L181 SmtUtils]: Spent 14.58 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:53:20,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:53:20 BoogieIcfgContainer [2019-01-01 23:53:20,726 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:53:20,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:53:20,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:53:20,727 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:53:20,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:52:29" (3/4) ... [2019-01-01 23:53:20,734 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:53:20,843 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:53:20,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:53:20,845 INFO L168 Benchmark]: Toolchain (without parser) took 53735.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.8 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -282.8 MB). Peak memory consumption was 70.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:20,852 INFO L168 Benchmark]: CDTParser took 0.15 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:53:20,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:20,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:20,853 INFO L168 Benchmark]: Boogie Preprocessor took 56.79 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:53:20,857 INFO L168 Benchmark]: RCFGBuilder took 1576.52 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: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:20,858 INFO L168 Benchmark]: BuchiAutomizer took 51180.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -167.9 MB). Peak memory consumption was 389.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:20,858 INFO L168 Benchmark]: Witness Printer took 117.46 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:53:20,868 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.15 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 724.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.79 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 1576.52 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: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 51180.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -167.9 MB). Peak memory consumption was 389.2 MB. Max. memory is 11.5 GB. * Witness Printer took 117.46 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. 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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 421 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 47.9s. Construction of modules took 2.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 268 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 421 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 588 SDtfs, 1366 SDslu, 1433 SDs, 0 SdLazy, 177 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 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: 382]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=8981} State at position 1 is {retValue_acc=1, NULL=0, NULL=0, NULL=-9, NULL=-12, NULL=0, NULL=0, NULL=8981, NULL=-14, retValue_acc=0, NULL=5870, NULL=0, NULL=-6, NULL=-17, methaneLevelCritical=0, NULL=-4, tmp=1, tmp___0=0, NULL=0, NULL=0, tmp=0, retValue_acc=0, NULL=0, tmp___1=0, NULL=0, NULL=0, NULL=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53ba0d95=0, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-3, NULL=5437, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28652646=0, \result=0, NULL=0, systemActive=1, waterLevel=1, NULL=8980, \result=1, NULL=0, NULL=-20, NULL=0, NULL=0, NULL=-13, \result=0, NULL=0, NULL=-18, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-5, \result=1, NULL=-10, head=0, pumpRunning=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a5ae5ee=0, NULL=-2, NULL=-7, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a030065=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20bfc4b1=0, tmp=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6682e001=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@851269b=53, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10c389a7=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2149c6c3=0, \result=1, NULL=6644, retValue_acc=1, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@406ee447=0, NULL=0, tmp=1, retValue_acc=1, tmp___2=53, tmp___0=0, splverifierCounter=0, NULL=0, NULL=-1, NULL=-19, tmp=0, head=0, retValue_acc=0, NULL=-8, NULL=5869, NULL=0, NULL=-15, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7011a2e5=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L51] int pumpRunning = 0; [L52] int systemActive = 1; [L268] int cleanupTimeShifts = 4; [L643] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L841] int waterLevel = 1; [L842] int methaneLevelCritical = 0; [L953] int switchedOnBeforeTS ; [L349] int retValue_acc ; [L350] int tmp ; [L465] int retValue_acc ; [L468] retValue_acc = 1 [L469] return (retValue_acc); [L356] tmp = valid_product() [L358] COND TRUE \read(tmp) [L958] switchedOnBeforeTS = 0 [L373] int splverifierCounter ; [L374] int tmp ; [L375] int tmp___0 ; [L376] int tmp___1 ; [L377] int tmp___2 ; [L380] splverifierCounter = 0 Loop: [L382] COND TRUE 1 [L384] COND TRUE splverifierCounter < 4 [L390] tmp = __VERIFIER_nondet_int() [L392] COND FALSE !(\read(tmp)) [L400] tmp___0 = __VERIFIER_nondet_int() [L402] COND FALSE !(\read(tmp___0)) [L410] tmp___2 = __VERIFIER_nondet_int() [L412] COND TRUE \read(tmp___2) [L170] int retValue_acc ; [L173] retValue_acc = pumpRunning [L174] return (retValue_acc); [L967] switchedOnBeforeTS = isPumpRunning() [L63] COND FALSE !(\read(pumpRunning)) [L70] COND TRUE \read(systemActive) [L118] int tmp ; [L121] COND FALSE !(\read(pumpRunning)) [L92] int tmp ; [L95] COND TRUE ! pumpRunning [L215] int retValue_acc ; [L216] int tmp ; [L217] int tmp___0 ; [L921] int retValue_acc ; [L924] COND TRUE waterLevel < 2 [L925] retValue_acc = 1 [L926] return (retValue_acc); [L221] tmp = isHighWaterSensorDry() [L223] COND TRUE \read(tmp) [L224] tmp___0 = 0 [L228] retValue_acc = tmp___0 [L229] return (retValue_acc); [L97] tmp = isHighWaterLevel() [L99] COND FALSE !(\read(tmp)) [L973] int tmp ; [L974] int tmp___0 ; [L912] int retValue_acc ; [L915] retValue_acc = waterLevel [L916] return (retValue_acc); [L978] tmp = getWaterLevel() [L980] COND TRUE tmp != 2 [L170] int retValue_acc ; [L173] retValue_acc = pumpRunning [L174] return (retValue_acc); [L982] tmp___0 = isPumpRunning() [L984] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...