./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 764a558f84753bff2f3381f04a56ebf221297041 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 03:02:07,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 03:02:07,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 03:02:07,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 03:02:07,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 03:02:07,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 03:02:07,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 03:02:07,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 03:02:07,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 03:02:07,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 03:02:07,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 03:02:07,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 03:02:07,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 03:02:07,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 03:02:07,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 03:02:07,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 03:02:07,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 03:02:07,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 03:02:07,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 03:02:07,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 03:02:07,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 03:02:07,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 03:02:07,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 03:02:07,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 03:02:07,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 03:02:07,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 03:02:07,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 03:02:07,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 03:02:07,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 03:02:07,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 03:02:07,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 03:02:07,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 03:02:07,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 03:02:07,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 03:02:07,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 03:02:07,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 03:02:07,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 03:02:07,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 03:02:07,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 03:02:07,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 03:02:07,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 03:02:07,306 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 03:02:07,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 03:02:07,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 03:02:07,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 03:02:07,325 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 03:02:07,325 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 03:02:07,325 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 03:02:07,325 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 03:02:07,326 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 03:02:07,326 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 03:02:07,326 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 03:02:07,326 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 03:02:07,326 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 03:02:07,327 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 03:02:07,327 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 03:02:07,327 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 03:02:07,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 03:02:07,328 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 03:02:07,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 03:02:07,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 03:02:07,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 03:02:07,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 03:02:07,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 03:02:07,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 03:02:07,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 03:02:07,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 03:02:07,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 03:02:07,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 03:02:07,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 03:02:07,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 03:02:07,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 03:02:07,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 03:02:07,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 03:02:07,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 03:02:07,332 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 03:02:07,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 03:02:07,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 03:02:07,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 03:02:07,333 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 764a558f84753bff2f3381f04a56ebf221297041 [2019-11-26 03:02:07,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 03:02:07,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 03:02:07,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 03:02:07,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 03:02:07,529 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 03:02:07,530 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2019-11-26 03:02:07,602 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/data/59ce73bbb/38d297fd5b904727a43ebf55b3244fde/FLAG5428d8f19 [2019-11-26 03:02:08,028 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 03:02:08,033 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2019-11-26 03:02:08,049 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/data/59ce73bbb/38d297fd5b904727a43ebf55b3244fde/FLAG5428d8f19 [2019-11-26 03:02:08,309 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/data/59ce73bbb/38d297fd5b904727a43ebf55b3244fde [2019-11-26 03:02:08,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 03:02:08,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 03:02:08,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 03:02:08,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 03:02:08,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 03:02:08,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:08,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282c9ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08, skipping insertion in model container [2019-11-26 03:02:08,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:08,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 03:02:08,391 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 03:02:08,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:02:08,814 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 03:02:08,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:02:08,927 INFO L205 MainTranslator]: Completed translation [2019-11-26 03:02:08,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08 WrapperNode [2019-11-26 03:02:08,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 03:02:08,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 03:02:08,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 03:02:08,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 03:02:08,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:08,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:09,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 03:02:09,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 03:02:09,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 03:02:09,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 03:02:09,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:09,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:09,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:09,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:09,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:09,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:09,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... [2019-11-26 03:02:09,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 03:02:09,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 03:02:09,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 03:02:09,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 03:02:09,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 03:02:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 03:02:09,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 03:02:09,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 03:02:09,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 03:02:11,153 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 03:02:11,154 INFO L284 CfgBuilder]: Removed 158 assume(true) statements. [2019-11-26 03:02:11,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:02:11 BoogieIcfgContainer [2019-11-26 03:02:11,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 03:02:11,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 03:02:11,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 03:02:11,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 03:02:11,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 03:02:08" (1/3) ... [2019-11-26 03:02:11,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a26181d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:02:11, skipping insertion in model container [2019-11-26 03:02:11,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:08" (2/3) ... [2019-11-26 03:02:11,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a26181d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:02:11, skipping insertion in model container [2019-11-26 03:02:11,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:02:11" (3/3) ... [2019-11-26 03:02:11,165 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product38.cil.c [2019-11-26 03:02:11,175 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 03:02:11,182 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-26 03:02:11,193 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-26 03:02:11,217 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 03:02:11,217 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 03:02:11,218 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 03:02:11,218 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 03:02:11,218 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 03:02:11,218 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 03:02:11,218 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 03:02:11,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 03:02:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-26 03:02:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 03:02:11,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:11,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:11,243 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1774493873, now seen corresponding path program 1 times [2019-11-26 03:02:11,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:11,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711588837] [2019-11-26 03:02:11,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:11,557 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-26 03:02:11,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711588837] [2019-11-26 03:02:11,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:11,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:02:11,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520258470] [2019-11-26 03:02:11,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 03:02:11,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:11,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 03:02:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 03:02:11,577 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-11-26 03:02:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:11,593 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2019-11-26 03:02:11,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 03:02:11,595 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-11-26 03:02:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:11,603 INFO L225 Difference]: With dead ends: 44 [2019-11-26 03:02:11,603 INFO L226 Difference]: Without dead ends: 21 [2019-11-26 03:02:11,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 03:02:11,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-26 03:02:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-26 03:02:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-26 03:02:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-26 03:02:11,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 7 [2019-11-26 03:02:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:11,635 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-26 03:02:11,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 03:02:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-26 03:02:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 03:02:11,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:11,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:11,636 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:11,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:11,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1289368328, now seen corresponding path program 1 times [2019-11-26 03:02:11,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:11,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081563212] [2019-11-26 03:02:11,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:11,823 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-26 03:02:11,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081563212] [2019-11-26 03:02:11,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:11,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:11,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624528382] [2019-11-26 03:02:11,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:02:11,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:11,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:02:11,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:02:11,826 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2019-11-26 03:02:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:11,941 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2019-11-26 03:02:11,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 03:02:11,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 03:02:11,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:11,943 INFO L225 Difference]: With dead ends: 53 [2019-11-26 03:02:11,943 INFO L226 Difference]: Without dead ends: 27 [2019-11-26 03:02:11,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 03:02:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-26 03:02:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-11-26 03:02:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-26 03:02:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-26 03:02:11,949 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2019-11-26 03:02:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:11,949 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-26 03:02:11,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:02:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-26 03:02:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 03:02:11,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:11,950 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:11,951 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1431233396, now seen corresponding path program 1 times [2019-11-26 03:02:11,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:11,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418887362] [2019-11-26 03:02:11,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:02:12,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418887362] [2019-11-26 03:02:12,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304746734] [2019-11-26 03:02:12,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 03:02:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:12,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 03:02:12,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 03:02:12,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,628 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-11-26 03:02:12,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:02:12,798 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 03:02:12,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:12,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:02:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:02:13,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1623248540] [2019-11-26 03:02:13,313 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-11-26 03:02:13,314 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 03:02:13,323 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 03:02:13,328 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 03:02:13,329 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 03:02:21,677 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 476 [2019-11-26 03:02:23,660 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-11-26 03:02:23,805 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 484 [2019-11-26 03:02:24,428 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 578 DAG size of output: 578 [2019-11-26 03:02:25,319 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 03:02:27,112 WARN L192 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 351 DAG size of output: 198 [2019-11-26 03:02:31,581 WARN L192 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 484 DAG size of output: 429 [2019-11-26 03:02:32,631 WARN L192 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 148 [2019-11-26 03:02:34,674 WARN L192 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 339 DAG size of output: 247 [2019-11-26 03:02:36,582 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 349 DAG size of output: 209 [2019-11-26 03:02:36,586 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 03:02:36,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 03:02:36,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2019-11-26 03:02:36,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100810946] [2019-11-26 03:02:36,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 03:02:36,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:36,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 03:02:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-11-26 03:02:36,588 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 14 states. [2019-11-26 03:02:36,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:36,939 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-11-26 03:02:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 03:02:36,940 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-11-26 03:02:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:36,941 INFO L225 Difference]: With dead ends: 61 [2019-11-26 03:02:36,941 INFO L226 Difference]: Without dead ends: 42 [2019-11-26 03:02:36,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-11-26 03:02:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-26 03:02:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2019-11-26 03:02:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-26 03:02:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-11-26 03:02:36,948 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2019-11-26 03:02:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:36,949 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-26 03:02:36,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 03:02:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-11-26 03:02:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 03:02:36,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:36,949 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2019-11-26 03:02:37,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 03:02:37,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1485654920, now seen corresponding path program 2 times [2019-11-26 03:02:37,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:37,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262179852] [2019-11-26 03:02:37,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 03:02:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 03:02:37,506 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 03:02:37,506 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 03:02:37,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 03:02:37 BoogieIcfgContainer [2019-11-26 03:02:37,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 03:02:37,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 03:02:37,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 03:02:37,636 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 03:02:37,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:02:11" (3/4) ... [2019-11-26 03:02:37,645 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 03:02:37,753 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0d737bb8-c5ab-4c6e-9cb0-7edc7dd85f1b/bin/utaipan/witness.graphml [2019-11-26 03:02:37,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 03:02:37,755 INFO L168 Benchmark]: Toolchain (without parser) took 29442.09 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 482.9 MB). Free memory was 939.4 MB in the beginning and 1.3 GB in the end (delta: -317.9 MB). Peak memory consumption was 165.0 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:37,755 INFO L168 Benchmark]: CDTParser took 2.65 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:02:37,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:37,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.55 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:37,756 INFO L168 Benchmark]: Boogie Preprocessor took 40.81 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-11-26 03:02:37,757 INFO L168 Benchmark]: RCFGBuilder took 2104.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.6 MB in the end (delta: 223.2 MB). Peak memory consumption was 223.2 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:37,757 INFO L168 Benchmark]: TraceAbstraction took 26478.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 349.2 MB). Free memory was 882.6 MB in the beginning and 1.3 GB in the end (delta: -377.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:02:37,758 INFO L168 Benchmark]: Witness Printer took 118.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:37,760 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.65 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 614.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.55 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.81 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 2104.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.6 MB in the end (delta: 223.2 MB). Peak memory consumption was 223.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26478.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 349.2 MB). Free memory was 882.6 MB in the beginning and 1.3 GB in the end (delta: -377.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 118.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 247]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L149] int waterLevel = 1; [L150] int methaneLevelCritical = 0; [L349] int pumpRunning = 0; [L350] int systemActive = 1; [L704] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L121] int retValue_acc ; [L122] int tmp ; [L927] int retValue_acc ; [L930] retValue_acc = 1 [L931] return (retValue_acc); [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) [L281] int splverifierCounter ; [L282] int tmp ; [L283] int tmp___0 ; [L284] int tmp___1 ; [L285] int tmp___2 ; [L288] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L292] COND TRUE splverifierCounter < 4 [L298] tmp = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp) [L167] COND TRUE waterLevel < 2 [L168] waterLevel = waterLevel + 1 [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 [L356] COND FALSE !(\read(pumpRunning)) [L363] COND TRUE \read(systemActive) [L411] int tmp ; [L414] COND FALSE !(\read(pumpRunning)) [L385] int tmp ; [L388] COND TRUE ! pumpRunning [L508] int retValue_acc ; [L509] int tmp ; [L510] int tmp___0 ; [L229] int retValue_acc ; [L232] COND FALSE !(waterLevel < 2) [L236] retValue_acc = 0 [L237] return (retValue_acc); [L514] tmp = isHighWaterSensorDry() [L516] COND FALSE !(\read(tmp)) [L519] tmp___0 = 1 [L521] retValue_acc = tmp___0 [L522] return (retValue_acc); [L390] tmp = isHighWaterLevel() [L392] COND TRUE \read(tmp) [L439] pumpRunning = 1 [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); [L259] tmp = getWaterLevel() [L261] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L292] COND TRUE splverifierCounter < 4 [L298] tmp = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp) [L167] COND FALSE !(waterLevel < 2) [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND FALSE !(\read(tmp___2)) [L326] tmp___1 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___1) [L356] COND TRUE \read(pumpRunning) [L155] COND TRUE waterLevel > 0 [L156] waterLevel = waterLevel - 1 [L363] COND TRUE \read(systemActive) [L411] int tmp ; [L414] COND TRUE \read(pumpRunning) [L452] int retValue_acc ; [L188] int retValue_acc ; [L191] retValue_acc = methaneLevelCritical [L192] return (retValue_acc); [L456] retValue_acc = isMethaneLevelCritical() [L458] return (retValue_acc); [L416] tmp = isMethaneAlarm() [L418] COND FALSE !(\read(tmp)) [L385] int tmp ; [L388] COND FALSE !(! pumpRunning) [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); [L259] tmp = getWaterLevel() [L261] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L292] COND TRUE splverifierCounter < 4 [L298] tmp = __VERIFIER_nondet_int() [L300] COND FALSE !(\read(tmp)) [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 [L356] COND TRUE \read(pumpRunning) [L155] COND TRUE waterLevel > 0 [L156] waterLevel = waterLevel - 1 [L363] COND TRUE \read(systemActive) [L411] int tmp ; [L414] COND TRUE \read(pumpRunning) [L452] int retValue_acc ; [L188] int retValue_acc ; [L191] retValue_acc = methaneLevelCritical [L192] return (retValue_acc); [L456] retValue_acc = isMethaneLevelCritical() [L458] return (retValue_acc); [L416] tmp = isMethaneAlarm() [L418] COND FALSE !(\read(tmp)) [L385] int tmp ; [L388] COND FALSE !(! pumpRunning) [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); [L259] tmp = getWaterLevel() [L261] COND TRUE tmp == 0 [L463] int retValue_acc ; [L466] retValue_acc = pumpRunning [L467] return (retValue_acc); [L263] tmp___0 = isPumpRunning() [L265] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L247] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 3 error locations. Result: UNSAFE, OverallTime: 26.4s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 79 SDtfs, 48 SDslu, 159 SDs, 0 SdLazy, 119 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 3306 SizeOfPredicates, 66 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...