./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product33.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_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/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 3e754f75ca06d39e1069a0bad88498ddd2436bb7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:24:49,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:49,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:49,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:49,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:49,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:49,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:49,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:49,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:49,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:49,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:49,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:49,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:49,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:49,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:49,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:49,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:49,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:49,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:49,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:49,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:49,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:49,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:49,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:49,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:49,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:49,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:49,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:49,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:49,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:49,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:49,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:49,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:49,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:49,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:49,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:49,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:49,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:49,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:49,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:49,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:49,672 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:49,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:49,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:49,684 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:49,684 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:49,684 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:49,685 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:49,685 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:49,685 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:49,685 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:49,685 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:49,685 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:49,686 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:49,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:49,686 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:49,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:49,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:49,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:49,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:49,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:49,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:49,687 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:49,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:49,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:49,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:49,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:49,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:49,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:49,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:49,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:49,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:49,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:49,689 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:49,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:49,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:49,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:49,690 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_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/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 -> 3e754f75ca06d39e1069a0bad88498ddd2436bb7 [2019-10-22 11:24:49,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:49,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:49,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:49,732 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:49,733 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:49,733 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2019-10-22 11:24:49,788 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/data/adfe4d723/472db7760a0e4c039f91a00ed6d6abf1/FLAG887b664f0 [2019-10-22 11:24:50,210 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:50,211 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2019-10-22 11:24:50,221 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/data/adfe4d723/472db7760a0e4c039f91a00ed6d6abf1/FLAG887b664f0 [2019-10-22 11:24:50,571 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/data/adfe4d723/472db7760a0e4c039f91a00ed6d6abf1 [2019-10-22 11:24:50,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:50,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:50,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:50,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:50,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:50,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db9e7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50, skipping insertion in model container [2019-10-22 11:24:50,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,588 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:50,637 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:50,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:50,974 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:51,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:51,059 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:51,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51 WrapperNode [2019-10-22 11:24:51,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:51,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:51,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:51,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:51,068 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:24:51" (1/1) ... [2019-10-22 11:24:51,092 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:24:51" (1/1) ... [2019-10-22 11:24:51,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:51,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:51,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:51,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:51,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51" (1/1) ... [2019-10-22 11:24:51,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51" (1/1) ... [2019-10-22 11:24:51,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51" (1/1) ... [2019-10-22 11:24:51,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51" (1/1) ... [2019-10-22 11:24:51,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51" (1/1) ... [2019-10-22 11:24:51,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51" (1/1) ... [2019-10-22 11:24:51,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51" (1/1) ... [2019-10-22 11:24:51,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:51,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:51,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:51,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:51,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/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:24:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:24:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:51,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:51,848 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:51,848 INFO L284 CfgBuilder]: Removed 96 assume(true) statements. [2019-10-22 11:24:51,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:51 BoogieIcfgContainer [2019-10-22 11:24:51,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:51,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:51,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:51,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:51,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:50" (1/3) ... [2019-10-22 11:24:51,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6898ded7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:51, skipping insertion in model container [2019-10-22 11:24:51,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:51" (2/3) ... [2019-10-22 11:24:51,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6898ded7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:51, skipping insertion in model container [2019-10-22 11:24:51,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:51" (3/3) ... [2019-10-22 11:24:51,857 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product33.cil.c [2019-10-22 11:24:51,866 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:51,873 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:24:51,890 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:24:51,922 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:51,923 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:51,923 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:51,923 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:51,923 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:51,923 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:51,924 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:51,924 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-10-22 11:24:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:24:51,947 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,951 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash 768274677, now seen corresponding path program 1 times [2019-10-22 11:24:51,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162932593] [2019-10-22 11:24:51,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,183 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:24:52,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162932593] [2019-10-22 11:24:52,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:52,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801382832] [2019-10-22 11:24:52,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:24:52,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:24:52,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:24:52,206 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-10-22 11:24:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,232 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2019-10-22 11:24:52,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:24:52,233 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:24:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,242 INFO L225 Difference]: With dead ends: 150 [2019-10-22 11:24:52,242 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 11:24:52,245 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:24:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 11:24:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 11:24:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 11:24:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-10-22 11:24:52,284 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2019-10-22 11:24:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,284 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-10-22 11:24:52,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:24:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-10-22 11:24:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:24:52,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,285 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,285 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1484097871, now seen corresponding path program 1 times [2019-10-22 11:24:52,286 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027216193] [2019-10-22 11:24:52,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,384 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:24:52,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027216193] [2019-10-22 11:24:52,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:52,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115673212] [2019-10-22 11:24:52,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:52,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:52,388 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2019-10-22 11:24:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,405 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2019-10-22 11:24:52,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:52,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:24:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,407 INFO L225 Difference]: With dead ends: 74 [2019-10-22 11:24:52,408 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:24:52,408 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:24:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:24:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:24:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:24:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-10-22 11:24:52,411 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2019-10-22 11:24:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,412 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-10-22 11:24:52,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-10-22 11:24:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:52,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,413 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] [2019-10-22 11:24:52,413 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,413 INFO L82 PathProgramCache]: Analyzing trace with hash 670124178, now seen corresponding path program 1 times [2019-10-22 11:24:52,414 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546182297] [2019-10-22 11:24:52,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,505 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:24:52,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546182297] [2019-10-22 11:24:52,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:52,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743935455] [2019-10-22 11:24:52,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:52,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:52,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:52,506 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 3 states. [2019-10-22 11:24:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,518 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2019-10-22 11:24:52,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:52,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 11:24:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,521 INFO L225 Difference]: With dead ends: 62 [2019-10-22 11:24:52,521 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:24:52,521 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:24:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:24:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:24:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:24:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-10-22 11:24:52,526 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2019-10-22 11:24:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,526 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-10-22 11:24:52,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2019-10-22 11:24:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:52,527 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,527 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] [2019-10-22 11:24:52,527 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1804645939, now seen corresponding path program 1 times [2019-10-22 11:24:52,528 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138097703] [2019-10-22 11:24:52,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,597 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:24:52,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138097703] [2019-10-22 11:24:52,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:52,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137580131] [2019-10-22 11:24:52,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:52,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:52,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:52,599 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2019-10-22 11:24:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,638 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2019-10-22 11:24:52,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:52,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:24:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,639 INFO L225 Difference]: With dead ends: 83 [2019-10-22 11:24:52,640 INFO L226 Difference]: Without dead ends: 55 [2019-10-22 11:24:52,640 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:24:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-22 11:24:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-10-22 11:24:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:24:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2019-10-22 11:24:52,647 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2019-10-22 11:24:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,647 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2019-10-22 11:24:52,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2019-10-22 11:24:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:24:52,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,648 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] [2019-10-22 11:24:52,648 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1746371458, now seen corresponding path program 1 times [2019-10-22 11:24:52,649 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629416056] [2019-10-22 11:24:52,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,733 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:24:52,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629416056] [2019-10-22 11:24:52,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:52,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071240292] [2019-10-22 11:24:52,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:52,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:52,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,735 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2019-10-22 11:24:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,789 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2019-10-22 11:24:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:52,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-22 11:24:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,791 INFO L225 Difference]: With dead ends: 139 [2019-10-22 11:24:52,791 INFO L226 Difference]: Without dead ends: 92 [2019-10-22 11:24:52,792 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:24:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-22 11:24:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-10-22 11:24:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 11:24:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-10-22 11:24:52,798 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2019-10-22 11:24:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,799 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-10-22 11:24:52,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-10-22 11:24:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:24:52,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,800 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] [2019-10-22 11:24:52,800 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash 916139585, now seen corresponding path program 1 times [2019-10-22 11:24:52,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866979975] [2019-10-22 11:24:52,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,869 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:24:52,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866979975] [2019-10-22 11:24:52,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:52,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122030825] [2019-10-22 11:24:52,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:52,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,871 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 5 states. [2019-10-22 11:24:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,953 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-10-22 11:24:52,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:52,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-22 11:24:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,955 INFO L225 Difference]: With dead ends: 270 [2019-10-22 11:24:52,956 INFO L226 Difference]: Without dead ends: 220 [2019-10-22 11:24:52,956 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:24:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-22 11:24:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 100. [2019-10-22 11:24:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-22 11:24:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2019-10-22 11:24:52,981 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 29 [2019-10-22 11:24:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,986 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2019-10-22 11:24:52,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2019-10-22 11:24:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:24:52,987 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,988 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] [2019-10-22 11:24:52,988 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash -863305781, now seen corresponding path program 1 times [2019-10-22 11:24:52,988 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381563492] [2019-10-22 11:24:52,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,068 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:24:53,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381563492] [2019-10-22 11:24:53,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:53,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104157129] [2019-10-22 11:24:53,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:53,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:53,072 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand 5 states. [2019-10-22 11:24:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,191 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2019-10-22 11:24:53,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:53,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:24:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,195 INFO L225 Difference]: With dead ends: 280 [2019-10-22 11:24:53,195 INFO L226 Difference]: Without dead ends: 278 [2019-10-22 11:24:53,196 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:24:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-22 11:24:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-10-22 11:24:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-22 11:24:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2019-10-22 11:24:53,230 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 30 [2019-10-22 11:24:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,230 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2019-10-22 11:24:53,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2019-10-22 11:24:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:24:53,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,231 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] [2019-10-22 11:24:53,232 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash 376123462, now seen corresponding path program 1 times [2019-10-22 11:24:53,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013458537] [2019-10-22 11:24:53,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,309 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:24:53,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013458537] [2019-10-22 11:24:53,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:53,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858159441] [2019-10-22 11:24:53,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:53,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:53,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:53,311 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand 5 states. [2019-10-22 11:24:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,373 INFO L93 Difference]: Finished difference Result 276 states and 374 transitions. [2019-10-22 11:24:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:53,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:24:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,378 INFO L225 Difference]: With dead ends: 276 [2019-10-22 11:24:53,378 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 11:24:53,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 11:24:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 104. [2019-10-22 11:24:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-22 11:24:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2019-10-22 11:24:53,401 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 30 [2019-10-22 11:24:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,402 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2019-10-22 11:24:53,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2019-10-22 11:24:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:24:53,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,403 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] [2019-10-22 11:24:53,403 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,403 INFO L82 PathProgramCache]: Analyzing trace with hash 634288900, now seen corresponding path program 1 times [2019-10-22 11:24:53,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136990670] [2019-10-22 11:24:53,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,458 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:24:53,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136990670] [2019-10-22 11:24:53,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:53,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846339732] [2019-10-22 11:24:53,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:53,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:53,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:53,460 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand 3 states. [2019-10-22 11:24:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,490 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2019-10-22 11:24:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:53,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 11:24:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,491 INFO L225 Difference]: With dead ends: 250 [2019-10-22 11:24:53,491 INFO L226 Difference]: Without dead ends: 152 [2019-10-22 11:24:53,492 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:24:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-22 11:24:53,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-22 11:24:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-22 11:24:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2019-10-22 11:24:53,517 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2019-10-22 11:24:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,518 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2019-10-22 11:24:53,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2019-10-22 11:24:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:53,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,519 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] [2019-10-22 11:24:53,519 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1373527294, now seen corresponding path program 1 times [2019-10-22 11:24:53,520 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132803665] [2019-10-22 11:24:53,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:54,284 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:24:54,284 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:24:54,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:54 BoogieIcfgContainer [2019-10-22 11:24:54,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:54,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:54,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:54,385 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:54,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:51" (3/4) ... [2019-10-22 11:24:54,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:24:54,478 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1e6c2f7e-90f6-451a-8a93-8bba25bfa612/bin/utaipan/witness.graphml [2019-10-22 11:24:54,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:54,480 INFO L168 Benchmark]: Toolchain (without parser) took 3905.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 941.0 MB in the beginning and 951.4 MB in the end (delta: -10.4 MB). Peak memory consumption was 126.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,480 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:54,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,482 INFO L168 Benchmark]: Boogie Preprocessor took 58.52 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-10-22 11:24:54,482 INFO L168 Benchmark]: RCFGBuilder took 654.09 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.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,482 INFO L168 Benchmark]: TraceAbstraction took 2534.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.6 MB in the end (delta: 90.7 MB). Peak memory consumption was 90.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,483 INFO L168 Benchmark]: Witness Printer took 93.03 ms. Allocated memory is still 1.2 GB. Free memory was 968.6 MB in the beginning and 951.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,485 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 485.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.52 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 654.09 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.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2534.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.6 MB in the end (delta: 90.7 MB). Peak memory consumption was 90.7 MB. Max. memory is 11.5 GB. * Witness Printer took 93.03 ms. Allocated memory is still 1.2 GB. Free memory was 968.6 MB in the beginning and 951.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 410]: 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; [L424] int pumpRunning = 0; [L425] int systemActive = 1; [L683] int cleanupTimeShifts = 4; [L806] int waterLevel = 1; [L807] int methaneLevelCritical = 0; [L756] int retValue_acc ; [L757] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L674] int retValue_acc ; [L677] retValue_acc = 1 [L678] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L763] tmp = valid_product() [L765] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L581] int splverifierCounter ; [L582] int tmp ; [L583] int tmp___0 ; [L584] int tmp___1 ; [L585] int tmp___2 ; [L588] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L590] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L592] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L598] tmp = __VERIFIER_nondet_int() [L600] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] COND TRUE waterLevel < 2 [L825] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] tmp___0 = __VERIFIER_nondet_int() [L610] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L836] COND FALSE !(\read(methaneLevelCritical)) [L839] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L618] tmp___2 = __VERIFIER_nondet_int() [L620] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] COND TRUE \read(systemActive) [L461] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L464] COND TRUE ! pumpRunning [L558] int retValue_acc ; [L559] int tmp ; [L560] int tmp___0 ; [L886] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L889] COND FALSE !(waterLevel < 2) [L893] retValue_acc = 0 [L894] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L564] tmp = isHighWaterSensorDry() [L566] COND FALSE !(\read(tmp)) [L569] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L571] retValue_acc = tmp___0 [L572] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L466] tmp = isHighWaterLevel() [L468] COND TRUE \read(tmp) [L489] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L780] int tmp ; [L781] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = methaneLevelCritical [L849] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L785] tmp = isMethaneLevelCritical() [L787] COND TRUE \read(tmp) [L513] int retValue_acc ; [L516] retValue_acc = pumpRunning [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L789] tmp___0 = isPumpRunning() [L791] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L410] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 577 SDtfs, 704 SDslu, 767 SDs, 0 SdLazy, 102 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 414 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 12233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...