./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product43.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_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product43.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/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 437b76c0cd9dd6f0417f690a0c81e41159d0829e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:29:44,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:29:44,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:29:44,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:29:44,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:29:44,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:29:44,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:29:44,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:29:44,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:29:44,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:29:44,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:29:44,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:29:44,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:29:44,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:29:44,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:29:44,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:29:44,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:29:44,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:29:44,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:29:44,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:29:44,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:29:44,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:29:44,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:29:44,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:29:44,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:29:44,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:29:44,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:29:44,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:29:44,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:29:44,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:29:44,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:29:44,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:29:44,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:29:44,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:29:44,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:29:44,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:29:44,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:29:44,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:29:44,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:29:44,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:29:44,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:29:44,097 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:29:44,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:29:44,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:29:44,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:29:44,121 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:29:44,122 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:29:44,122 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:29:44,122 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:29:44,122 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:29:44,122 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:29:44,123 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:29:44,123 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:29:44,123 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:29:44,123 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:29:44,123 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:29:44,123 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:29:44,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:29:44,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:29:44,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:29:44,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:29:44,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:29:44,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:29:44,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:29:44,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:29:44,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:29:44,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:29:44,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:29:44,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:29:44,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:29:44,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:29:44,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:29:44,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:29:44,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:29:44,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:29:44,127 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:29:44,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:29:44,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:29:44,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:29:44,128 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_7f45f07a-cc89-4371-a7ea-333266d9a757/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 -> 437b76c0cd9dd6f0417f690a0c81e41159d0829e [2019-11-26 02:29:44,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:29:44,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:29:44,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:29:44,313 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:29:44,313 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:29:44,314 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec4_product43.cil.c [2019-11-26 02:29:44,366 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/data/463085192/c11039d1e14e4b32b04719d094630145/FLAG6da2bd95f [2019-11-26 02:29:44,828 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:29:44,831 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/sv-benchmarks/c/product-lines/minepump_spec4_product43.cil.c [2019-11-26 02:29:44,844 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/data/463085192/c11039d1e14e4b32b04719d094630145/FLAG6da2bd95f [2019-11-26 02:29:45,128 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/data/463085192/c11039d1e14e4b32b04719d094630145 [2019-11-26 02:29:45,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:29:45,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:29:45,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:29:45,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:29:45,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:29:45,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e3fa82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45, skipping insertion in model container [2019-11-26 02:29:45,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:29:45,196 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:29:45,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:29:45,599 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:29:45,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:29:45,727 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:29:45,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45 WrapperNode [2019-11-26 02:29:45,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:29:45,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:29:45,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:29:45,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:29:45,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:29:45,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:29:45,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:29:45,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:29:45,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... [2019-11-26 02:29:45,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:29:45,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:29:45,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:29:45,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:29:45,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/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 02:29:45,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:29:45,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:29:45,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:29:45,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:29:47,536 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:29:47,536 INFO L284 CfgBuilder]: Removed 118 assume(true) statements. [2019-11-26 02:29:47,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:47 BoogieIcfgContainer [2019-11-26 02:29:47,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:29:47,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:29:47,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:29:47,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:29:47,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:29:45" (1/3) ... [2019-11-26 02:29:47,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c502294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:29:47, skipping insertion in model container [2019-11-26 02:29:47,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:29:45" (2/3) ... [2019-11-26 02:29:47,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c502294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:29:47, skipping insertion in model container [2019-11-26 02:29:47,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:47" (3/3) ... [2019-11-26 02:29:47,551 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product43.cil.c [2019-11-26 02:29:47,561 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:29:47,567 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-26 02:29:47,577 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-26 02:29:47,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:29:47,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:29:47,602 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:29:47,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:29:47,602 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:29:47,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:29:47,603 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:29:47,603 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:29:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-26 02:29:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:29:47,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:47,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:47,626 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1326317157, now seen corresponding path program 1 times [2019-11-26 02:29:47,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:47,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095782003] [2019-11-26 02:29:47,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:48,074 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 02:29:48,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095782003] [2019-11-26 02:29:48,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:29:48,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:29:48,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142188758] [2019-11-26 02:29:48,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:29:48,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:29:48,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:29:48,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:29:48,095 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 6 states. [2019-11-26 02:29:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:29:48,299 INFO L93 Difference]: Finished difference Result 80 states and 116 transitions. [2019-11-26 02:29:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:29:48,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-11-26 02:29:48,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:29:48,310 INFO L225 Difference]: With dead ends: 80 [2019-11-26 02:29:48,310 INFO L226 Difference]: Without dead ends: 51 [2019-11-26 02:29:48,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:29:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-26 02:29:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-11-26 02:29:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-26 02:29:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-26 02:29:48,360 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 7 [2019-11-26 02:29:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:29:48,361 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-26 02:29:48,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:29:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-26 02:29:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:29:48,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:29:48,363 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-26 02:29:48,363 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:29:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:29:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 940582286, now seen corresponding path program 1 times [2019-11-26 02:29:48,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:29:48,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673182659] [2019-11-26 02:29:48,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:29:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:48,666 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 02:29:48,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673182659] [2019-11-26 02:29:48,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765096244] [2019-11-26 02:29:48,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/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 02:29:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:29:48,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-26 02:29:48,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:29:48,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:48,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,255 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-11-26 02:29:49,380 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-26 02:29:49,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,826 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 9 [2019-11-26 02:29:49,829 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 02:29:49,829 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:29:49,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:49,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,024 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 15 [2019-11-26 02:29:50,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:29:50,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:29:50,092 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 02:29:50,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1021465116] [2019-11-26 02:29:50,111 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-11-26 02:29:50,112 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:29:50,117 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:29:50,123 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:29:50,124 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:29:57,484 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 476 [2019-11-26 02:29:59,080 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-11-26 02:29:59,223 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 484 [2019-11-26 02:29:59,811 WARN L192 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 628 DAG size of output: 609 [2019-11-26 02:30:00,942 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:30:02,407 WARN L192 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 375 DAG size of output: 185 [2019-11-26 02:30:06,486 WARN L192 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 484 DAG size of output: 429 [2019-11-26 02:30:07,390 WARN L192 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 143 [2019-11-26 02:30:09,025 WARN L192 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 363 DAG size of output: 261 [2019-11-26 02:30:09,095 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:30:09,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:30:09,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2019-11-26 02:30:09,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383791729] [2019-11-26 02:30:09,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 02:30:09,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:30:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 02:30:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:30:09,098 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 16 states. [2019-11-26 02:30:09,290 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-26 02:30:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:30:09,738 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2019-11-26 02:30:09,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:30:09,739 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-11-26 02:30:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:30:09,740 INFO L225 Difference]: With dead ends: 90 [2019-11-26 02:30:09,740 INFO L226 Difference]: Without dead ends: 84 [2019-11-26 02:30:09,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-11-26 02:30:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-26 02:30:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 44. [2019-11-26 02:30:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-26 02:30:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-11-26 02:30:09,754 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 10 [2019-11-26 02:30:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:30:09,754 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-11-26 02:30:09,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 02:30:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-11-26 02:30:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:30:09,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:30:09,755 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2019-11-26 02:30:09,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:30:09,965 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:30:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:30:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1449442875, now seen corresponding path program 2 times [2019-11-26 02:30:09,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:30:09,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529259054] [2019-11-26 02:30:09,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:30:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:30:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:30:10,275 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:30:10,275 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:30:10,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:30:10 BoogieIcfgContainer [2019-11-26 02:30:10,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:30:10,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:30:10,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:30:10,401 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:30:10,401 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:29:47" (3/4) ... [2019-11-26 02:30:10,410 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:30:10,496 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7f45f07a-cc89-4371-a7ea-333266d9a757/bin/utaipan/witness.graphml [2019-11-26 02:30:10,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:30:10,497 INFO L168 Benchmark]: Toolchain (without parser) took 25366.12 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 535.8 MB). Free memory was 950.1 MB in the beginning and 866.6 MB in the end (delta: 83.5 MB). Peak memory consumption was 619.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:10,498 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:30:10,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:10,498 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.04 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:10,499 INFO L168 Benchmark]: Boogie Preprocessor took 36.08 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 02:30:10,499 INFO L168 Benchmark]: RCFGBuilder took 1707.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.4 MB in the end (delta: 175.3 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:10,499 INFO L168 Benchmark]: TraceAbstraction took 22861.76 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 412.1 MB). Free memory was 922.4 MB in the beginning and 885.0 MB in the end (delta: 37.4 MB). Peak memory consumption was 449.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:10,500 INFO L168 Benchmark]: Witness Printer took 96.11 ms. Allocated memory is still 1.6 GB. Free memory was 885.0 MB in the beginning and 866.6 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:30:10,501 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 594.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.04 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.08 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 1707.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.4 MB in the end (delta: 175.3 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22861.76 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 412.1 MB). Free memory was 922.4 MB in the beginning and 885.0 MB in the end (delta: 37.4 MB). Peak memory consumption was 449.5 MB. Max. memory is 11.5 GB. * Witness Printer took 96.11 ms. Allocated memory is still 1.6 GB. Free memory was 885.0 MB in the beginning and 866.6 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 310]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L120] int pumpRunning = 0; [L121] int systemActive = 1; [L315] int cleanupTimeShifts = 4; [L415] int waterLevel = 1; [L416] int methaneLevelCritical = 0; [L713] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L391] int retValue_acc ; [L392] int tmp ; [L535] int retValue_acc ; [L538] retValue_acc = 1 [L539] return (retValue_acc); [L398] tmp = valid_product() [L400] COND TRUE \read(tmp) [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 [L63] tmp = __VERIFIER_nondet_int() [L65] COND TRUE \read(tmp) [L433] COND TRUE waterLevel < 2 [L434] waterLevel = waterLevel + 1 [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___2)) [L89] tmp___1 = __VERIFIER_nondet_int() [L91] COND FALSE !(\read(tmp___1)) [L128] COND FALSE !(\read(pumpRunning)) [L135] COND TRUE \read(systemActive) [L157] int tmp ; [L160] COND TRUE ! pumpRunning [L272] int retValue_acc ; [L273] int tmp ; [L274] int tmp___0 ; [L495] int retValue_acc ; [L498] COND FALSE !(waterLevel < 2) [L502] retValue_acc = 0 [L503] return (retValue_acc); [L278] tmp = isHighWaterSensorDry() [L280] COND FALSE !(\read(tmp)) [L283] tmp___0 = 1 [L285] retValue_acc = tmp___0 [L286] return (retValue_acc); [L162] tmp = isHighWaterLevel() [L164] COND TRUE \read(tmp) [L191] int tmp ; [L216] int retValue_acc ; [L454] int retValue_acc ; [L457] retValue_acc = methaneLevelCritical [L458] return (retValue_acc); [L220] retValue_acc = isMethaneLevelCritical() [L222] return (retValue_acc); [L195] tmp = isMethaneAlarm() [L197] COND FALSE !(\read(tmp)) [L185] pumpRunning = 1 [L911] int tmp ; [L912] int tmp___0 ; [L486] int retValue_acc ; [L489] retValue_acc = waterLevel [L490] return (retValue_acc); [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L57] COND TRUE splverifierCounter < 4 [L63] tmp = __VERIFIER_nondet_int() [L65] COND TRUE \read(tmp) [L433] COND FALSE !(waterLevel < 2) [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp___0) [L445] COND FALSE !(\read(methaneLevelCritical)) [L448] methaneLevelCritical = 1 [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___2)) [L89] tmp___1 = __VERIFIER_nondet_int() [L91] COND FALSE !(\read(tmp___1)) [L128] COND TRUE \read(pumpRunning) [L421] COND TRUE waterLevel > 0 [L422] waterLevel = waterLevel - 1 [L135] COND TRUE \read(systemActive) [L157] int tmp ; [L160] COND FALSE !(! pumpRunning) [L911] int tmp ; [L912] int tmp___0 ; [L486] int retValue_acc ; [L489] retValue_acc = waterLevel [L490] return (retValue_acc); [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp___0) [L445] COND TRUE \read(methaneLevelCritical) [L446] methaneLevelCritical = 0 [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___2)) [L89] tmp___1 = __VERIFIER_nondet_int() [L91] COND FALSE !(\read(tmp___1)) [L128] COND TRUE \read(pumpRunning) [L421] COND TRUE waterLevel > 0 [L422] waterLevel = waterLevel - 1 [L135] COND TRUE \read(systemActive) [L157] int tmp ; [L160] COND FALSE !(! pumpRunning) [L911] int tmp ; [L912] int tmp___0 ; [L486] int retValue_acc ; [L489] retValue_acc = waterLevel [L490] return (retValue_acc); [L916] tmp = getWaterLevel() [L918] COND TRUE tmp == 0 [L227] int retValue_acc ; [L230] retValue_acc = pumpRunning [L231] return (retValue_acc); [L920] tmp___0 = isPumpRunning() [L922] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L310] __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: 22.7s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 179 SDslu, 257 SDs, 0 SdLazy, 264 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, 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, 2 MinimizatonAttempts, 57 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 5184 SizeOfPredicates, 77 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 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...