./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product59.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/minepump_spec5_product59.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 3e1b0443329a7a45dbd5811d3e88a5ff99628068 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-678e011 [2019-11-19 22:30:29,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:30:29,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:30:29,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:30:29,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:30:29,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:30:29,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:30:29,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:30:29,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:30:29,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:30:29,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:30:29,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:30:29,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:30:29,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:30:29,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:30:29,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:30:29,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:30:29,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:30:29,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:30:29,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:30:29,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:30:29,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:30:29,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:30:29,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:30:29,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:30:29,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:30:29,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:30:29,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:30:29,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:30:29,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:30:29,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:30:29,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:30:29,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:30:29,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:30:29,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:30:29,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:30:29,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:30:29,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:30:29,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:30:29,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:30:29,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:30:29,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 22:30:29,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:30:29,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:30:29,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:30:29,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:30:29,131 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:30:29,131 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:30:29,132 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:30:29,132 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:30:29,132 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:30:29,132 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:30:29,134 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:30:29,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:30:29,134 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:30:29,135 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:30:29,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:30:29,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:30:29,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:30:29,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:30:29,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:30:29,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:30:29,137 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:30:29,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:30:29,137 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:30:29,138 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:30:29,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:30:29,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:30:29,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:30:29,139 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:30:29,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:30:29,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:30:29,140 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:30:29,142 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:30:29,142 INFO L138 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 -> 3e1b0443329a7a45dbd5811d3e88a5ff99628068 [2019-11-19 22:30:29,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:30:29,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:30:29,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:30:29,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:30:29,480 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:30:29,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product59.cil.c [2019-11-19 22:30:29,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12359f0fd/a1d5b995201143dab8bbfbd27b286de3/FLAG01dc9db05 [2019-11-19 22:30:30,007 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:30:30,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product59.cil.c [2019-11-19 22:30:30,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12359f0fd/a1d5b995201143dab8bbfbd27b286de3/FLAG01dc9db05 [2019-11-19 22:30:30,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12359f0fd/a1d5b995201143dab8bbfbd27b286de3 [2019-11-19 22:30:30,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:30:30,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:30:30,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:30:30,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:30:30,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:30:30,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:30:30" (1/1) ... [2019-11-19 22:30:30,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5834b72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:30, skipping insertion in model container [2019-11-19 22:30:30,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:30:30" (1/1) ... [2019-11-19 22:30:30,416 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:30:30,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:30:30,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:30:30,907 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:30:31,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:30:31,068 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:30:31,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31 WrapperNode [2019-11-19 22:30:31,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:30:31,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:30:31,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:30:31,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:30:31,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (1/1) ... [2019-11-19 22:30:31,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (1/1) ... [2019-11-19 22:30:31,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:30:31,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:30:31,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:30:31,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:30:31,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (1/1) ... [2019-11-19 22:30:31,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (1/1) ... [2019-11-19 22:30:31,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (1/1) ... [2019-11-19 22:30:31,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (1/1) ... [2019-11-19 22:30:31,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (1/1) ... [2019-11-19 22:30:31,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (1/1) ... [2019-11-19 22:30:31,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (1/1) ... [2019-11-19 22:30:31,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:30:31,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:30:31,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:30:31,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:30:31,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (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-11-19 22:30:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:30:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 22:30:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:30:31,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:30:32,401 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:30:32,402 INFO L285 CfgBuilder]: Removed 210 assume(true) statements. [2019-11-19 22:30:32,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:30:32 BoogieIcfgContainer [2019-11-19 22:30:32,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:30:32,405 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:30:32,405 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:30:32,409 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:30:32,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:30:32,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:30:30" (1/3) ... [2019-11-19 22:30:32,412 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@509a8401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:30:32, skipping insertion in model container [2019-11-19 22:30:32,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:30:32,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:30:31" (2/3) ... [2019-11-19 22:30:32,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@509a8401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:30:32, skipping insertion in model container [2019-11-19 22:30:32,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:30:32,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:30:32" (3/3) ... [2019-11-19 22:30:32,416 INFO L371 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product59.cil.c [2019-11-19 22:30:32,487 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:30:32,488 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:30:32,488 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:30:32,488 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:30:32,489 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:30:32,489 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:30:32,489 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:30:32,489 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:30:32,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states. [2019-11-19 22:30:32,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-11-19 22:30:32,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:30:32,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:30:32,587 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:32,587 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:32,588 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:30:32,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states. [2019-11-19 22:30:32,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-11-19 22:30:32,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:30:32,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:30:32,610 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:32,610 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:32,623 INFO L794 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4; 9#L-1true havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~11, main_~tmp~10;havoc main_~retValue_acc~11;havoc main_~tmp~10; 23#L1006true havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 34#L1014true main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 35#L970true assume 0 != main_~tmp~10; 22#L943true ~switchedOnBeforeTS~0 := 0; 11#L841true havoc test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 46#L862-1true [2019-11-19 22:30:32,624 INFO L796 eck$LassoCheckResult]: Loop: 46#L862-1true assume !false; 75#L165true assume test_~splverifierCounter~0 < 4; 33#L166true test_~tmp~0 := test_#t~nondet10;havoc test_#t~nondet10; 55#L174true assume !(0 != test_~tmp~0); 52#L174-1true test_~tmp___0~0 := test_#t~nondet11;havoc test_#t~nondet11; 107#L184true assume !(0 != test_~tmp___0~0); 105#L184-1true test_~tmp___2~0 := test_#t~nondet12;havoc test_#t~nondet12; 30#L194true assume 0 != test_~tmp___2~0; 118#L200-1true havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 76#L366true __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 45#L851true assume !(0 != ~pumpRunning~0); 70#L237true assume !(0 != ~systemActive~0); 131#L244true havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __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~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 114#L123true __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 44#L862true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 46#L862-1true [2019-11-19 22:30:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-11-19 22:30:32,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:32,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012774977] [2019-11-19 22:30:32,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:33,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:30:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash -239367595, now seen corresponding path program 1 times [2019-11-19 22:30:33,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:33,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965143424] [2019-11-19 22:30:33,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:33,179 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:30:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1694657615, now seen corresponding path program 1 times [2019-11-19 22:30:33,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:33,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561691832] [2019-11-19 22:30:33,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:30:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:30:33,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561691832] [2019-11-19 22:30:33,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:30:33,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:30:33,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944235426] [2019-11-19 22:30:33,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:30:33,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:30:33,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:30:33,435 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 6 states. [2019-11-19 22:30:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:30:33,705 INFO L93 Difference]: Finished difference Result 337 states and 478 transitions. [2019-11-19 22:30:33,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:30:33,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 478 transitions. [2019-11-19 22:30:33,714 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 219 [2019-11-19 22:30:33,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 316 states and 457 transitions. [2019-11-19 22:30:33,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2019-11-19 22:30:33,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2019-11-19 22:30:33,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 457 transitions. [2019-11-19 22:30:33,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:30:33,747 INFO L688 BuchiCegarLoop]: Abstraction has 316 states and 457 transitions. [2019-11-19 22:30:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 457 transitions. [2019-11-19 22:30:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 185. [2019-11-19 22:30:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-19 22:30:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 266 transitions. [2019-11-19 22:30:33,798 INFO L711 BuchiCegarLoop]: Abstraction has 185 states and 266 transitions. [2019-11-19 22:30:33,798 INFO L591 BuchiCegarLoop]: Abstraction has 185 states and 266 transitions. [2019-11-19 22:30:33,798 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:30:33,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 266 transitions. [2019-11-19 22:30:33,800 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2019-11-19 22:30:33,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:30:33,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:30:33,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:33,801 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:33,802 INFO L794 eck$LassoCheckResult]: Stem: 610#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4; 510#L-1 havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~11, main_~tmp~10;havoc main_~retValue_acc~11;havoc main_~tmp~10; 511#L1006 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 531#L1014 main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 545#L970 assume 0 != main_~tmp~10; 530#L943 ~switchedOnBeforeTS~0 := 0; 514#L841 havoc test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 503#L862-1 [2019-11-19 22:30:33,802 INFO L796 eck$LassoCheckResult]: Loop: 503#L862-1 assume !false; 568#L165 assume test_~splverifierCounter~0 < 4; 543#L166 test_~tmp~0 := test_#t~nondet10;havoc test_#t~nondet10; 544#L174 assume !(0 != test_~tmp~0); 580#L174-1 test_~tmp___0~0 := test_#t~nondet11;havoc test_#t~nondet11; 581#L184 assume !(0 != test_~tmp___0~0); 547#L184-1 test_~tmp___2~0 := test_#t~nondet12;havoc test_#t~nondet12; 537#L194 assume 0 != test_~tmp___2~0; 539#L200-1 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 602#L366 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 567#L851 assume !(0 != ~pumpRunning~0); 523#L237 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 562#L295 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 563#L269-1 assume !(0 == ~pumpRunning~0); 505#L244 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __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~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 625#L123 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 565#L862 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 503#L862-1 [2019-11-19 22:30:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-11-19 22:30:33,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:33,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713031070] [2019-11-19 22:30:33,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:33,884 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:30:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1384715234, now seen corresponding path program 1 times [2019-11-19 22:30:33,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:33,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469080987] [2019-11-19 22:30:33,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:30:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:30:33,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469080987] [2019-11-19 22:30:33,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:30:33,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:30:33,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331599709] [2019-11-19 22:30:33,907 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:30:33,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:30:33,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:30:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:30:33,908 INFO L87 Difference]: Start difference. First operand 185 states and 266 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-11-19 22:30:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:30:34,035 INFO L93 Difference]: Finished difference Result 232 states and 317 transitions. [2019-11-19 22:30:34,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:30:34,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 317 transitions. [2019-11-19 22:30:34,040 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 164 [2019-11-19 22:30:34,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 232 states and 317 transitions. [2019-11-19 22:30:34,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2019-11-19 22:30:34,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2019-11-19 22:30:34,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 232 states and 317 transitions. [2019-11-19 22:30:34,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:30:34,045 INFO L688 BuchiCegarLoop]: Abstraction has 232 states and 317 transitions. [2019-11-19 22:30:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states and 317 transitions. [2019-11-19 22:30:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-11-19 22:30:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 22:30:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 317 transitions. [2019-11-19 22:30:34,057 INFO L711 BuchiCegarLoop]: Abstraction has 232 states and 317 transitions. [2019-11-19 22:30:34,057 INFO L591 BuchiCegarLoop]: Abstraction has 232 states and 317 transitions. [2019-11-19 22:30:34,058 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:30:34,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 317 transitions. [2019-11-19 22:30:34,060 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 164 [2019-11-19 22:30:34,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:30:34,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:30:34,061 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:34,062 INFO L850 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-11-19 22:30:34,062 INFO L794 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4; 934#L-1 havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~11, main_~tmp~10;havoc main_~retValue_acc~11;havoc main_~tmp~10; 935#L1006 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 956#L1014 main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 970#L970 assume 0 != main_~tmp~10; 955#L943 ~switchedOnBeforeTS~0 := 0; 938#L841 havoc test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 939#L862-1 [2019-11-19 22:30:34,063 INFO L796 eck$LassoCheckResult]: Loop: 939#L862-1 assume !false; 1144#L165 assume test_~splverifierCounter~0 < 4; 1123#L166 test_~tmp~0 := test_#t~nondet10;havoc test_#t~nondet10; 1122#L174 assume !(0 != test_~tmp~0); 1001#L174-1 test_~tmp___0~0 := test_#t~nondet11;havoc test_#t~nondet11; 1002#L184 assume !(0 != test_~tmp___0~0); 1055#L184-1 test_~tmp___2~0 := test_#t~nondet12;havoc test_#t~nondet12; 962#L194 assume 0 != test_~tmp___2~0; 964#L200-1 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 1066#L366 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 989#L851 assume !(0 != ~pumpRunning~0); 990#L237 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 985#L295 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 986#L269-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret34, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 951#L131-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 952#L136-1 isHighWaterLevel_#t~ret34 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret34;havoc isHighWaterLevel_#t~ret34; 959#L415-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 1056#L415-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 1028#L421-1 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~1 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 979#L273-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~1); 928#L244 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __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~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 1149#L123 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 1147#L862 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 939#L862-1 [2019-11-19 22:30:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-11-19 22:30:34,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:34,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436333543] [2019-11-19 22:30:34,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:34,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:30:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1333768502, now seen corresponding path program 1 times [2019-11-19 22:30:34,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:34,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821501888] [2019-11-19 22:30:34,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:30:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:30:34,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821501888] [2019-11-19 22:30:34,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:30:34,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:30:34,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375987760] [2019-11-19 22:30:34,266 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:30:34,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:30:34,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:30:34,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:30:34,266 INFO L87 Difference]: Start difference. First operand 232 states and 317 transitions. cyclomatic complexity: 88 Second operand 5 states. [2019-11-19 22:30:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:30:34,585 INFO L93 Difference]: Finished difference Result 961 states and 1321 transitions. [2019-11-19 22:30:34,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:30:34,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 961 states and 1321 transitions. [2019-11-19 22:30:34,595 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 671 [2019-11-19 22:30:34,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 961 states to 961 states and 1321 transitions. [2019-11-19 22:30:34,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 961 [2019-11-19 22:30:34,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 961 [2019-11-19 22:30:34,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 961 states and 1321 transitions. [2019-11-19 22:30:34,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:30:34,607 INFO L688 BuchiCegarLoop]: Abstraction has 961 states and 1321 transitions. [2019-11-19 22:30:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states and 1321 transitions. [2019-11-19 22:30:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 454. [2019-11-19 22:30:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-11-19 22:30:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 612 transitions. [2019-11-19 22:30:34,625 INFO L711 BuchiCegarLoop]: Abstraction has 454 states and 612 transitions. [2019-11-19 22:30:34,625 INFO L591 BuchiCegarLoop]: Abstraction has 454 states and 612 transitions. [2019-11-19 22:30:34,625 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:30:34,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 454 states and 612 transitions. [2019-11-19 22:30:34,628 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 326 [2019-11-19 22:30:34,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:30:34,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:30:34,629 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:34,629 INFO L850 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-11-19 22:30:34,629 INFO L794 eck$LassoCheckResult]: Stem: 2276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(110, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(102, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string25.base, #t~string25.offset, 1);call write~init~int(80, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(117, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(109, #t~string25.base, 3 + #t~string25.offset, 1);call write~init~int(112, #t~string25.base, 4 + #t~string25.offset, 1);call write~init~int(58, #t~string25.base, 5 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 6 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string31.base, #t~string31.offset, 1);call write~init~int(32, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 2 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string33.base, #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 1 + #t~string33.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4; 2150#L-1 havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~11, main_~tmp~10;havoc main_~retValue_acc~11;havoc main_~tmp~10; 2151#L1006 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 2172#L1014 main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 2187#L970 assume 0 != main_~tmp~10; 2171#L943 ~switchedOnBeforeTS~0 := 0; 2152#L841 havoc test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2153#L862-1 [2019-11-19 22:30:34,630 INFO L796 eck$LassoCheckResult]: Loop: 2153#L862-1 assume !false; 2445#L165 assume test_~splverifierCounter~0 < 4; 2446#L166 test_~tmp~0 := test_#t~nondet10;havoc test_#t~nondet10; 2566#L174 assume !(0 != test_~tmp~0); 2563#L174-1 test_~tmp___0~0 := test_#t~nondet11;havoc test_#t~nondet11; 2562#L184 assume !(0 != test_~tmp___0~0); 2560#L184-1 test_~tmp___2~0 := test_#t~nondet12;havoc test_#t~nondet12; 2559#L194 assume 0 != test_~tmp___2~0; 2558#L200-1 havoc __utac_acc__Specification5_spec__2_#t~ret71;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 2570#L366 __utac_acc__Specification5_spec__2_#t~ret71 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret71;havoc __utac_acc__Specification5_spec__2_#t~ret71; 2567#L851 assume !(0 != ~pumpRunning~0); 2252#L237 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 2203#L295 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret14, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 2204#L269-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret34, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 2167#L131-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 2168#L136-1 isHighWaterLevel_#t~ret34 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret34;havoc isHighWaterLevel_#t~ret34; 2175#L415-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 2290#L415-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 2255#L421-1 processEnvironment__wrappee__highWaterSensor_#t~ret14 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~1 := processEnvironment__wrappee__highWaterSensor_#t~ret14;havoc processEnvironment__wrappee__highWaterSensor_#t~ret14; 2197#L273-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~1); 2141#L244 havoc __utac_acc__Specification5_spec__3_#t~ret72, __utac_acc__Specification5_spec__3_#t~ret73, __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~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 2453#L123 __utac_acc__Specification5_spec__3_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret72;havoc __utac_acc__Specification5_spec__3_#t~ret72; 2451#L862 assume 2 != __utac_acc__Specification5_spec__3_~tmp~9;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 2452#L366-1 __utac_acc__Specification5_spec__3_#t~ret73 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~3 := __utac_acc__Specification5_spec__3_#t~ret73;havoc __utac_acc__Specification5_spec__3_#t~ret73; 2448#L866 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~3); 2153#L862-1 [2019-11-19 22:30:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:34,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2019-11-19 22:30:34,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:34,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403608101] [2019-11-19 22:30:34,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:34,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:30:34,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1851287387, now seen corresponding path program 1 times [2019-11-19 22:30:34,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:34,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638535732] [2019-11-19 22:30:34,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:34,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:30:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:34,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1914713569, now seen corresponding path program 1 times [2019-11-19 22:30:34,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:34,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717854136] [2019-11-19 22:30:34,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:30:34,825 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:30:35,076 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-19 22:30:57,686 WARN L191 SmtUtils]: Spent 22.49 s on a formula simplification. DAG size of input: 456 DAG size of output: 404 [2019-11-19 22:31:11,879 WARN L191 SmtUtils]: Spent 14.18 s on a formula simplification that was a NOOP. DAG size: 402 [2019-11-19 22:31:11,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:31:11 BoogieIcfgContainer [2019-11-19 22:31:11,957 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:31:11,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:31:11,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:31:11,958 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:31:11,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:30:32" (3/4) ... [2019-11-19 22:31:11,962 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-19 22:31:12,025 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 22:31:12,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:31:12,027 INFO L168 Benchmark]: Toolchain (without parser) took 41632.91 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -138.4 MB). Peak memory consumption was 182.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:31:12,028 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:31:12,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:31:12,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.53 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-11-19 22:31:12,030 INFO L168 Benchmark]: Boogie Preprocessor took 79.46 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-11-19 22:31:12,031 INFO L168 Benchmark]: RCFGBuilder took 1159.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:31:12,031 INFO L168 Benchmark]: BuchiAutomizer took 39552.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.9 MB). Peak memory consumption was 385.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:31:12,032 INFO L168 Benchmark]: Witness Printer took 67.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:31:12,035 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 675.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.53 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 79.46 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. * RCFGBuilder took 1159.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 39552.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.9 MB). Peak memory consumption was 385.7 MB. Max. memory is 11.5 GB. * Witness Printer took 67.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 454 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 39.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 38.4s. Construction of modules took 0.4s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 638 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 454 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 682 SDtfs, 1914 SDslu, 1832 SDs, 0 SdLazy, 230 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s 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: 164]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=2142} State at position 1 is {NULL=0, NULL=0, NULL=9470, NULL=9472, NULL=0, NULL=2142, NULL=9476, NULL=4426, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@445b70c8=0, NULL=9478, retValue_acc=1, NULL=9469, methaneLevelCritical=0, tmp=1, tmp___0=0, NULL=0, NULL=0, NULL=9480, NULL=0, NULL=4425, NULL=0, tmp___1=0, NULL=9482, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63366247=0, NULL=9475, cleanupTimeShifts=4, tmp=0, tmp=0, switchedOnBeforeTS=0, NULL=2145, NULL=9479, tmp=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@122643b4=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=9474, \result=0, NULL=0, tmp___0=0, NULL=0, NULL=0, NULL=0, NULL=0, retValue_acc=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, NULL=9477, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11ca8341=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@767d3089=0, NULL=9471, NULL=0, NULL=4431, retValue_acc=1, NULL=0, \result=1, NULL=4430, tmp=1, NULL=4429, tmp___2=53, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d57425d=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=2143, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a4b7ea1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@322f1ed7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@156baa88=0, NULL=4427, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fb487e9=53, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a48a9b6=0, head=0, NULL=4424, NULL=9481, NULL=2144, NULL=0, NULL=9473, NULL=4428, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L225] int pumpRunning = 0; [L226] int systemActive = 1; [L629] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L835] int switchedOnBeforeTS ; [L884] int cleanupTimeShifts = 4; [L961] int retValue_acc ; [L962] int tmp ; [L1010] int retValue_acc ; [L1013] retValue_acc = 1 [L1014] return (retValue_acc); [L968] tmp = valid_product() [L970] COND TRUE \read(tmp) [L840] switchedOnBeforeTS = 0 [L155] int splverifierCounter ; [L156] int tmp ; [L157] int tmp___0 ; [L158] int tmp___1 ; [L159] int tmp___2 ; [L162] splverifierCounter = 0 Loop: [L164] COND TRUE 1 [L166] COND TRUE splverifierCounter < 4 [L172] tmp = __VERIFIER_nondet_int() [L174] COND FALSE !(\read(tmp)) [L182] tmp___0 = __VERIFIER_nondet_int() [L184] COND FALSE !(\read(tmp___0)) [L192] tmp___2 = __VERIFIER_nondet_int() [L194] COND TRUE \read(tmp___2) [L362] int retValue_acc ; [L365] retValue_acc = pumpRunning [L366] return (retValue_acc); [L849] switchedOnBeforeTS = isPumpRunning() [L237] COND FALSE !(\read(pumpRunning)) [L244] COND TRUE \read(systemActive) [L292] int tmp ; [L295] COND FALSE !(\read(pumpRunning)) [L266] int tmp ; [L269] COND TRUE ! pumpRunning [L407] int retValue_acc ; [L408] int tmp ; [L409] int tmp___0 ; [L128] int retValue_acc ; [L131] COND TRUE waterLevel < 2 [L132] retValue_acc = 1 [L133] return (retValue_acc); [L413] tmp = isHighWaterSensorDry() [L415] COND TRUE \read(tmp) [L416] tmp___0 = 0 [L420] retValue_acc = tmp___0 [L421] return (retValue_acc); [L271] tmp = isHighWaterLevel() [L273] COND FALSE !(\read(tmp)) [L855] int tmp ; [L856] int tmp___0 ; [L119] int retValue_acc ; [L122] retValue_acc = waterLevel [L123] return (retValue_acc); [L860] tmp = getWaterLevel() [L862] COND TRUE tmp != 2 [L362] int retValue_acc ; [L365] retValue_acc = pumpRunning [L366] return (retValue_acc); [L864] tmp___0 = isPumpRunning() [L866] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...