./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/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 c300c29b8d9fc061a97d8a30a731a0ec640f0644 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-10-22 11:21:50,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:50,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:50,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:50,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:50,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:50,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:50,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:50,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:50,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:50,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:50,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:50,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:50,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:50,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:50,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:50,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:50,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:50,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:50,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:50,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:50,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:50,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:50,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:50,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:50,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:50,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:50,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:50,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:50,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:50,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:50,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:50,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:50,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:50,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:50,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:50,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:50,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:50,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:50,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:50,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:50,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:50,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:50,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:50,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:50,669 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:50,670 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:50,670 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:50,670 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:50,670 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:50,670 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:50,671 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:50,671 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:50,671 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:50,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:50,672 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:50,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:50,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:50,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:50,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:50,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:50,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:50,673 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:50,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:50,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:50,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:50,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:50,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:50,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:50,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:50,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:50,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:50,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:50,676 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:50,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:50,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:50,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:50,677 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/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/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 -> c300c29b8d9fc061a97d8a30a731a0ec640f0644 [2019-10-22 11:21:50,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:50,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:50,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:50,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:50,721 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:50,722 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2019-10-22 11:21:50,780 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/data/67ffad29e/c0574d6de85f4b058c1191adeefc87b1/FLAG41d84904a [2019-10-22 11:21:51,252 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:51,253 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2019-10-22 11:21:51,265 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/data/67ffad29e/c0574d6de85f4b058c1191adeefc87b1/FLAG41d84904a [2019-10-22 11:21:51,586 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/data/67ffad29e/c0574d6de85f4b058c1191adeefc87b1 [2019-10-22 11:21:51,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:51,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:51,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:51,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:51,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:51,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:51" (1/1) ... [2019-10-22 11:21:51,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85c4d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:51, skipping insertion in model container [2019-10-22 11:21:51,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:51" (1/1) ... [2019-10-22 11:21:51,608 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:51,663 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:52,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:52,144 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:52,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:52,263 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:52,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52 WrapperNode [2019-10-22 11:21:52,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:52,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:52,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:52,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:52,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:52,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:52,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:52,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:52,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:52,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:52,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:52,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:52,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/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-10-22 11:21:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:21:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:21:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:52,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:53,198 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:53,199 INFO L284 CfgBuilder]: Removed 102 assume(true) statements. [2019-10-22 11:21:53,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:53 BoogieIcfgContainer [2019-10-22 11:21:53,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:53,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:53,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:53,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:53,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:51" (1/3) ... [2019-10-22 11:21:53,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165abf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:53, skipping insertion in model container [2019-10-22 11:21:53,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52" (2/3) ... [2019-10-22 11:21:53,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165abf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:53, skipping insertion in model container [2019-10-22 11:21:53,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:53" (3/3) ... [2019-10-22 11:21:53,210 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product35.cil.c [2019-10-22 11:21:53,224 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:53,236 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:21:53,250 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:21:53,292 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:53,292 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:53,292 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:53,293 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:53,293 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:53,293 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:53,293 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:53,293 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-10-22 11:21:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:53,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:53,319 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:53,321 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:53,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:53,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1673386384, now seen corresponding path program 1 times [2019-10-22 11:21:53,337 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:53,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100420301] [2019-10-22 11:21:53,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:53,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100420301] [2019-10-22 11:21:53,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:53,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:53,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804662403] [2019-10-22 11:21:53,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:21:53,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:53,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:21:53,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:21:53,589 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-10-22 11:21:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:53,620 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2019-10-22 11:21:53,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:21:53,621 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-22 11:21:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:53,635 INFO L225 Difference]: With dead ends: 161 [2019-10-22 11:21:53,635 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 11:21:53,639 INFO L600 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-10-22 11:21:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 11:21:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-22 11:21:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 11:21:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2019-10-22 11:21:53,688 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 18 [2019-10-22 11:21:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:53,688 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2019-10-22 11:21:53,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:21:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2019-10-22 11:21:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:21:53,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:53,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:53,690 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:53,691 INFO L82 PathProgramCache]: Analyzing trace with hash 572864739, now seen corresponding path program 1 times [2019-10-22 11:21:53,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:53,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707796906] [2019-10-22 11:21:53,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:53,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707796906] [2019-10-22 11:21:53,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:53,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:53,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234457782] [2019-10-22 11:21:53,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:53,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:53,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:53,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:53,837 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand 3 states. [2019-10-22 11:21:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:53,849 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2019-10-22 11:21:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:53,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:21:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:53,851 INFO L225 Difference]: With dead ends: 80 [2019-10-22 11:21:53,851 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:21:53,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:21:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-22 11:21:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:21:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2019-10-22 11:21:53,858 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 19 [2019-10-22 11:21:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:53,858 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2019-10-22 11:21:53,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2019-10-22 11:21:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:21:53,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:53,859 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:53,860 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:53,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2071848385, now seen corresponding path program 1 times [2019-10-22 11:21:53,860 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:53,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279428478] [2019-10-22 11:21:53,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:53,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:53,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279428478] [2019-10-22 11:21:53,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:53,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:53,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053840186] [2019-10-22 11:21:53,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:53,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:53,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:53,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:53,968 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand 6 states. [2019-10-22 11:21:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:54,094 INFO L93 Difference]: Finished difference Result 124 states and 184 transitions. [2019-10-22 11:21:54,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:54,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:21:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:54,096 INFO L225 Difference]: With dead ends: 124 [2019-10-22 11:21:54,097 INFO L226 Difference]: Without dead ends: 93 [2019-10-22 11:21:54,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-22 11:21:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 58. [2019-10-22 11:21:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 11:21:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2019-10-22 11:21:54,108 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 24 [2019-10-22 11:21:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:54,109 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2019-10-22 11:21:54,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2019-10-22 11:21:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:21:54,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,110 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:54,110 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:54,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,111 INFO L82 PathProgramCache]: Analyzing trace with hash 343514617, now seen corresponding path program 1 times [2019-10-22 11:21:54,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:54,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684764420] [2019-10-22 11:21:54,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:54,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684764420] [2019-10-22 11:21:54,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:54,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909414878] [2019-10-22 11:21:54,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:54,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:54,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:54,247 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand 3 states. [2019-10-22 11:21:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:54,324 INFO L93 Difference]: Finished difference Result 131 states and 195 transitions. [2019-10-22 11:21:54,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:54,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:21:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:54,325 INFO L225 Difference]: With dead ends: 131 [2019-10-22 11:21:54,326 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 11:21:54,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 11:21:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-10-22 11:21:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 11:21:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2019-10-22 11:21:54,350 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 25 [2019-10-22 11:21:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:54,350 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2019-10-22 11:21:54,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2019-10-22 11:21:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:21:54,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,352 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:54,352 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:54,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1750340408, now seen corresponding path program 1 times [2019-10-22 11:21:54,353 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:54,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640297503] [2019-10-22 11:21:54,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:54,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640297503] [2019-10-22 11:21:54,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:54,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692599435] [2019-10-22 11:21:54,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:54,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:54,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:54,437 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 5 states. [2019-10-22 11:21:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:54,564 INFO L93 Difference]: Finished difference Result 361 states and 530 transitions. [2019-10-22 11:21:54,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:54,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-22 11:21:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:54,567 INFO L225 Difference]: With dead ends: 361 [2019-10-22 11:21:54,567 INFO L226 Difference]: Without dead ends: 290 [2019-10-22 11:21:54,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-22 11:21:54,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 138. [2019-10-22 11:21:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-22 11:21:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 195 transitions. [2019-10-22 11:21:54,611 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 195 transitions. Word has length 27 [2019-10-22 11:21:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:54,611 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 195 transitions. [2019-10-22 11:21:54,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2019-10-22 11:21:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:21:54,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:54,613 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:54,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1110481728, now seen corresponding path program 1 times [2019-10-22 11:21:54,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:54,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327193682] [2019-10-22 11:21:54,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:54,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327193682] [2019-10-22 11:21:54,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:54,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51838995] [2019-10-22 11:21:54,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:54,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:54,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:54,699 INFO L87 Difference]: Start difference. First operand 138 states and 195 transitions. Second operand 5 states. [2019-10-22 11:21:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:54,834 INFO L93 Difference]: Finished difference Result 499 states and 711 transitions. [2019-10-22 11:21:54,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:54,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-22 11:21:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:54,836 INFO L225 Difference]: With dead ends: 499 [2019-10-22 11:21:54,837 INFO L226 Difference]: Without dead ends: 368 [2019-10-22 11:21:54,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-10-22 11:21:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 136. [2019-10-22 11:21:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-22 11:21:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2019-10-22 11:21:54,876 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 28 [2019-10-22 11:21:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:54,876 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2019-10-22 11:21:54,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2019-10-22 11:21:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:21:54,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,885 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:54,886 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2071146496, now seen corresponding path program 1 times [2019-10-22 11:21:54,886 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:54,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388606667] [2019-10-22 11:21:54,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:54,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388606667] [2019-10-22 11:21:54,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:54,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759357064] [2019-10-22 11:21:54,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:54,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:54,984 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand 5 states. [2019-10-22 11:21:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,064 INFO L93 Difference]: Finished difference Result 401 states and 556 transitions. [2019-10-22 11:21:55,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:55,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:21:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,066 INFO L225 Difference]: With dead ends: 401 [2019-10-22 11:21:55,066 INFO L226 Difference]: Without dead ends: 272 [2019-10-22 11:21:55,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-10-22 11:21:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 142. [2019-10-22 11:21:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-22 11:21:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 195 transitions. [2019-10-22 11:21:55,098 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 195 transitions. Word has length 32 [2019-10-22 11:21:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,098 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 195 transitions. [2019-10-22 11:21:55,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2019-10-22 11:21:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:21:55,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:55,100 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1370081918, now seen corresponding path program 1 times [2019-10-22 11:21:55,101 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508620937] [2019-10-22 11:21:55,101 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,101 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:55,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508620937] [2019-10-22 11:21:55,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:55,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981729776] [2019-10-22 11:21:55,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:55,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:55,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:55,181 INFO L87 Difference]: Start difference. First operand 142 states and 195 transitions. Second operand 6 states. [2019-10-22 11:21:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,310 INFO L93 Difference]: Finished difference Result 435 states and 595 transitions. [2019-10-22 11:21:55,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:55,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-22 11:21:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,314 INFO L225 Difference]: With dead ends: 435 [2019-10-22 11:21:55,314 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 11:21:55,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 11:21:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 146. [2019-10-22 11:21:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 11:21:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2019-10-22 11:21:55,338 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 32 [2019-10-22 11:21:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,339 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2019-10-22 11:21:55,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2019-10-22 11:21:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:21:55,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,340 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:55,340 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1956887932, now seen corresponding path program 1 times [2019-10-22 11:21:55,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922965223] [2019-10-22 11:21:55,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:55,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922965223] [2019-10-22 11:21:55,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:55,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640055608] [2019-10-22 11:21:55,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:55,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:55,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:55,382 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand 3 states. [2019-10-22 11:21:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,425 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2019-10-22 11:21:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:55,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-22 11:21:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,427 INFO L225 Difference]: With dead ends: 371 [2019-10-22 11:21:55,427 INFO L226 Difference]: Without dead ends: 232 [2019-10-22 11:21:55,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-22 11:21:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-22 11:21:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 11:21:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 307 transitions. [2019-10-22 11:21:55,463 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 307 transitions. Word has length 32 [2019-10-22 11:21:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,463 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 307 transitions. [2019-10-22 11:21:55,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 307 transitions. [2019-10-22 11:21:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:21:55,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,465 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:55,465 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash 875175876, now seen corresponding path program 1 times [2019-10-22 11:21:55,466 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124624698] [2019-10-22 11:21:55,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:55,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124624698] [2019-10-22 11:21:55,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:55,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285111436] [2019-10-22 11:21:55,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:55,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:55,528 INFO L87 Difference]: Start difference. First operand 232 states and 307 transitions. Second operand 3 states. [2019-10-22 11:21:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,593 INFO L93 Difference]: Finished difference Result 315 states and 418 transitions. [2019-10-22 11:21:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:55,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 11:21:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,595 INFO L225 Difference]: With dead ends: 315 [2019-10-22 11:21:55,595 INFO L226 Difference]: Without dead ends: 313 [2019-10-22 11:21:55,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-22 11:21:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2019-10-22 11:21:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-22 11:21:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2019-10-22 11:21:55,626 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 33 [2019-10-22 11:21:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,627 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2019-10-22 11:21:55,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2019-10-22 11:21:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:21:55,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,628 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:55,628 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1646221848, now seen corresponding path program 1 times [2019-10-22 11:21:55,629 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006368462] [2019-10-22 11:21:55,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:56,329 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:56,329 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:56,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:56 BoogieIcfgContainer [2019-10-22 11:21:56,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:56,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:56,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:56,432 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:56,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:53" (3/4) ... [2019-10-22 11:21:56,437 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:21:56,577 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4cffc05f-4f71-4afa-99d7-50e6ed8066ee/bin/utaipan/witness.graphml [2019-10-22 11:21:56,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:56,579 INFO L168 Benchmark]: Toolchain (without parser) took 4989.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 938.3 MB in the beginning and 1.2 GB in the end (delta: -256.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:56,579 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:56,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:56,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.70 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:56,580 INFO L168 Benchmark]: Boogie Preprocessor took 32.39 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:56,580 INFO L168 Benchmark]: RCFGBuilder took 845.25 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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:56,580 INFO L168 Benchmark]: TraceAbstraction took 3229.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.9 MB in the end (delta: 177.0 MB). Peak memory consumption was 177.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:56,581 INFO L168 Benchmark]: Witness Printer took 145.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 892.9 MB in the beginning and 1.2 GB in the end (delta: -301.7 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:56,583 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 673.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.70 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.39 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 845.25 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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3229.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.9 MB in the end (delta: 177.0 MB). Peak memory consumption was 177.0 MB. Max. memory is 11.5 GB. * Witness Printer took 145.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 892.9 MB in the beginning and 1.2 GB in the end (delta: -301.7 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 736]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L416] int pumpRunning = 0; [L417] int systemActive = 1; [L655] int methAndRunningLastTime ; [L741] int cleanupTimeShifts = 4; [L839] int waterLevel = 1; [L840] int methaneLevelCritical = 0; [L815] int retValue_acc ; [L816] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L723] int retValue_acc ; [L726] retValue_acc = 1 [L727] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L822] tmp = valid_product() [L824] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L660] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L588] int splverifierCounter ; [L589] int tmp ; [L590] int tmp___0 ; [L591] int tmp___1 ; [L592] int tmp___2 ; [L595] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L597] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L599] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L605] tmp = __VERIFIER_nondet_int() [L607] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L857] COND TRUE waterLevel < 2 [L858] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L615] tmp___0 = __VERIFIER_nondet_int() [L617] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L869] COND FALSE !(\read(methaneLevelCritical)) [L872] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L625] tmp___2 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L424] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L431] COND TRUE \read(systemActive) [L453] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L456] COND TRUE ! pumpRunning [L550] int retValue_acc ; [L551] int tmp ; [L552] int tmp___0 ; [L919] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L922] COND FALSE !(waterLevel < 2) [L926] retValue_acc = 0 [L927] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L556] tmp = isHighWaterSensorDry() [L558] COND FALSE !(\read(tmp)) [L561] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L563] retValue_acc = tmp___0 [L564] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L458] tmp = isHighWaterLevel() [L460] COND TRUE \read(tmp) [L481] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L665] int tmp ; [L666] int tmp___0 ; [L878] int retValue_acc ; [L881] retValue_acc = methaneLevelCritical [L882] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L670] tmp = isMethaneLevelCritical() [L672] COND TRUE \read(tmp) [L505] int retValue_acc ; [L508] retValue_acc = pumpRunning [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L674] tmp___0 = isPumpRunning() [L676] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L677] COND FALSE !(\read(methAndRunningLastTime)) [L682] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L597] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L599] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L605] tmp = __VERIFIER_nondet_int() [L607] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L615] tmp___0 = __VERIFIER_nondet_int() [L617] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L625] tmp___2 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L424] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L845] COND TRUE waterLevel > 0 [L846] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L431] COND TRUE \read(systemActive) [L453] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L456] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L665] int tmp ; [L666] int tmp___0 ; [L878] int retValue_acc ; [L881] retValue_acc = methaneLevelCritical [L882] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L670] tmp = isMethaneLevelCritical() [L672] COND TRUE \read(tmp) [L505] int retValue_acc ; [L508] retValue_acc = pumpRunning [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L674] tmp___0 = isPumpRunning() [L676] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L677] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L736] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.1s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 708 SDtfs, 995 SDslu, 1212 SDs, 0 SdLazy, 134 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 753 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 14762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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...