./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec3_product34.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_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/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 5f0a99b238839eec8a869cf6a8a47d3d1cc483bf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:24,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:24,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:24,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:24,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:24,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:24,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:24,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:24,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:24,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:24,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:24,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:24,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:24,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:24,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:24,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:24,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:24,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:24,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:24,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:24,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:24,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:24,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:24,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:24,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:24,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:24,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:24,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:24,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:24,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:24,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:24,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:24,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:24,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:24,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:24,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:24,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:24,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:24,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:24,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:24,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:24,704 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:24,717 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:24,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:24,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:24,718 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:24,719 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:24,719 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:24,719 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:24,719 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:24,719 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:24,720 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:24,720 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:24,720 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:24,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:24,721 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:24,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:24,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:24,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:24,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:24,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:24,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:24,723 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:24,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:24,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:24,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:24,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:24,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:24,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:24,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:24,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:24,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:24,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:24,725 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:24,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:24,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:24,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:24,726 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_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/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 -> 5f0a99b238839eec8a869cf6a8a47d3d1cc483bf [2019-10-22 11:22:24,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:24,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:24,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:24,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:24,771 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:24,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c [2019-10-22 11:22:24,828 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/data/85871e8bf/dcbf63a710ec49f99aec52d2790b718b/FLAGb8184d662 [2019-10-22 11:22:25,296 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:25,297 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c [2019-10-22 11:22:25,309 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/data/85871e8bf/dcbf63a710ec49f99aec52d2790b718b/FLAGb8184d662 [2019-10-22 11:22:25,795 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/data/85871e8bf/dcbf63a710ec49f99aec52d2790b718b [2019-10-22 11:22:25,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:25,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:25,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:25,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:25,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:25,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:25" (1/1) ... [2019-10-22 11:22:25,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b053f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:25, skipping insertion in model container [2019-10-22 11:22:25,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:25" (1/1) ... [2019-10-22 11:22:25,819 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:25,865 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:26,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:26,260 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:26,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:26,368 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:26,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26 WrapperNode [2019-10-22 11:22:26,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:26,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:26,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:26,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:26,380 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:22:26" (1/1) ... [2019-10-22 11:22:26,397 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:22:26" (1/1) ... [2019-10-22 11:22:26,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:26,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:26,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:26,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:26,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26" (1/1) ... [2019-10-22 11:22:26,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26" (1/1) ... [2019-10-22 11:22:26,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26" (1/1) ... [2019-10-22 11:22:26,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26" (1/1) ... [2019-10-22 11:22:26,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26" (1/1) ... [2019-10-22 11:22:26,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26" (1/1) ... [2019-10-22 11:22:26,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26" (1/1) ... [2019-10-22 11:22:26,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:26,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:26,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:26,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:26,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/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:22:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:22:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:22:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:26,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:27,456 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:27,457 INFO L284 CfgBuilder]: Removed 104 assume(true) statements. [2019-10-22 11:22:27,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:27 BoogieIcfgContainer [2019-10-22 11:22:27,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:27,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:27,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:27,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:27,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:25" (1/3) ... [2019-10-22 11:22:27,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef5d896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:27, skipping insertion in model container [2019-10-22 11:22:27,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:26" (2/3) ... [2019-10-22 11:22:27,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef5d896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:27, skipping insertion in model container [2019-10-22 11:22:27,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:27" (3/3) ... [2019-10-22 11:22:27,467 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product34.cil.c [2019-10-22 11:22:27,477 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:27,495 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:22:27,510 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:22:27,548 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:27,548 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:27,548 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:27,548 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:27,548 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:27,548 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:27,549 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:27,549 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-10-22 11:22:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:22:27,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:27,575 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:22:27,577 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:27,583 INFO L82 PathProgramCache]: Analyzing trace with hash 143052540, now seen corresponding path program 1 times [2019-10-22 11:22:27,593 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:27,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614087440] [2019-10-22 11:22:27,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:27,855 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:22:27,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614087440] [2019-10-22 11:22:27,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:27,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:27,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810109739] [2019-10-22 11:22:27,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:27,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:27,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:27,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:27,882 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-10-22 11:22:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:27,909 INFO L93 Difference]: Finished difference Result 162 states and 245 transitions. [2019-10-22 11:22:27,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:27,911 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-22 11:22:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:27,924 INFO L225 Difference]: With dead ends: 162 [2019-10-22 11:22:27,924 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 11:22:27,927 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:22:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 11:22:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-22 11:22:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 11:22:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2019-10-22 11:22:27,974 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 18 [2019-10-22 11:22:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:27,975 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2019-10-22 11:22:27,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2019-10-22 11:22:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:22:27,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:27,976 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:22:27,977 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash -767978213, now seen corresponding path program 1 times [2019-10-22 11:22:27,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:27,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939641740] [2019-10-22 11:22:27,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:28,101 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:22:28,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939641740] [2019-10-22 11:22:28,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:28,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:28,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312821453] [2019-10-22 11:22:28,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:28,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:28,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:28,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:28,105 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand 3 states. [2019-10-22 11:22:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:28,117 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2019-10-22 11:22:28,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:28,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:22:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:28,119 INFO L225 Difference]: With dead ends: 80 [2019-10-22 11:22:28,119 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:22:28,120 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:22:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:22:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:22:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:22:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-10-22 11:22:28,126 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-10-22 11:22:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:28,126 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-10-22 11:22:28,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-10-22 11:22:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:22:28,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:28,127 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:22:28,128 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash 459341460, now seen corresponding path program 1 times [2019-10-22 11:22:28,128 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:28,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683279959] [2019-10-22 11:22:28,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:28,204 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:22:28,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683279959] [2019-10-22 11:22:28,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:28,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:28,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725131154] [2019-10-22 11:22:28,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:28,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:28,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:28,206 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-10-22 11:22:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:28,248 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-10-22 11:22:28,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:28,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:22:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:28,249 INFO L225 Difference]: With dead ends: 66 [2019-10-22 11:22:28,250 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:22:28,250 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:22:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:22:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:22:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:22:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-10-22 11:22:28,255 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-10-22 11:22:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:28,256 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-10-22 11:22:28,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-10-22 11:22:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:22:28,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:28,257 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:22:28,257 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:28,258 INFO L82 PathProgramCache]: Analyzing trace with hash -179810352, now seen corresponding path program 1 times [2019-10-22 11:22:28,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:28,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660653779] [2019-10-22 11:22:28,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:28,323 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:22:28,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660653779] [2019-10-22 11:22:28,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:28,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:28,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809879058] [2019-10-22 11:22:28,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:28,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:28,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:28,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:28,325 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-10-22 11:22:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:28,351 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-10-22 11:22:28,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:28,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:22:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:28,353 INFO L225 Difference]: With dead ends: 89 [2019-10-22 11:22:28,353 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 11:22:28,353 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:22:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 11:22:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-10-22 11:22:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 11:22:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-10-22 11:22:28,362 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 25 [2019-10-22 11:22:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:28,362 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-10-22 11:22:28,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-10-22 11:22:28,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:22:28,363 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:28,363 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:22:28,364 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:28,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:28,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1667839457, now seen corresponding path program 1 times [2019-10-22 11:22:28,365 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:28,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114024250] [2019-10-22 11:22:28,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:28,486 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:22:28,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114024250] [2019-10-22 11:22:28,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:28,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:28,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601829484] [2019-10-22 11:22:28,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:28,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:28,490 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 5 states. [2019-10-22 11:22:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:28,555 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2019-10-22 11:22:28,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:28,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:22:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:28,557 INFO L225 Difference]: With dead ends: 149 [2019-10-22 11:22:28,557 INFO L226 Difference]: Without dead ends: 98 [2019-10-22 11:22:28,557 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:22:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-22 11:22:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-10-22 11:22:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-22 11:22:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2019-10-22 11:22:28,569 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 31 [2019-10-22 11:22:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:28,569 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2019-10-22 11:22:28,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2019-10-22 11:22:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:22:28,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:28,571 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:22:28,571 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash 540443364, now seen corresponding path program 1 times [2019-10-22 11:22:28,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:28,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874313473] [2019-10-22 11:22:28,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:28,637 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:22:28,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874313473] [2019-10-22 11:22:28,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:28,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:28,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274096474] [2019-10-22 11:22:28,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:28,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:28,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:28,639 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand 5 states. [2019-10-22 11:22:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:28,831 INFO L93 Difference]: Finished difference Result 314 states and 451 transitions. [2019-10-22 11:22:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:28,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:22:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:28,835 INFO L225 Difference]: With dead ends: 314 [2019-10-22 11:22:28,836 INFO L226 Difference]: Without dead ends: 260 [2019-10-22 11:22:28,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:22:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-22 11:22:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2019-10-22 11:22:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-22 11:22:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-10-22 11:22:28,877 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 31 [2019-10-22 11:22:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:28,878 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-10-22 11:22:28,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-10-22 11:22:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:28,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:28,879 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:22:28,880 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1572316506, now seen corresponding path program 1 times [2019-10-22 11:22:28,880 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:28,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034817249] [2019-10-22 11:22:28,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:28,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:28,999 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:22:28,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034817249] [2019-10-22 11:22:28,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:29,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:29,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797346572] [2019-10-22 11:22:29,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:29,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:29,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:29,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:29,002 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 5 states. [2019-10-22 11:22:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:29,187 INFO L93 Difference]: Finished difference Result 499 states and 704 transitions. [2019-10-22 11:22:29,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:22:29,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:22:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:29,190 INFO L225 Difference]: With dead ends: 499 [2019-10-22 11:22:29,190 INFO L226 Difference]: Without dead ends: 445 [2019-10-22 11:22:29,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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:22:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-10-22 11:22:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 152. [2019-10-22 11:22:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-22 11:22:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-10-22 11:22:29,220 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 32 [2019-10-22 11:22:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:29,220 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-10-22 11:22:29,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-10-22 11:22:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:29,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:29,222 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:22:29,222 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:29,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:29,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1711533540, now seen corresponding path program 1 times [2019-10-22 11:22:29,223 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:29,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123031889] [2019-10-22 11:22:29,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:29,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:29,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:29,271 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:22:29,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123031889] [2019-10-22 11:22:29,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:29,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:29,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889542301] [2019-10-22 11:22:29,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:29,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:29,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:29,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:29,273 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 4 states. [2019-10-22 11:22:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:29,324 INFO L93 Difference]: Finished difference Result 352 states and 487 transitions. [2019-10-22 11:22:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:29,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-22 11:22:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:29,326 INFO L225 Difference]: With dead ends: 352 [2019-10-22 11:22:29,326 INFO L226 Difference]: Without dead ends: 250 [2019-10-22 11:22:29,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-22 11:22:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2019-10-22 11:22:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-22 11:22:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2019-10-22 11:22:29,350 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 32 [2019-10-22 11:22:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:29,350 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2019-10-22 11:22:29,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2019-10-22 11:22:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:29,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:29,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, 1, 1, 1, 1, 1] [2019-10-22 11:22:29,352 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1197872225, now seen corresponding path program 1 times [2019-10-22 11:22:29,353 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:29,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978108300] [2019-10-22 11:22:29,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:29,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:29,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:29,407 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:22:29,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978108300] [2019-10-22 11:22:29,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:29,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:29,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096814537] [2019-10-22 11:22:29,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:29,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:29,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:29,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:29,409 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 5 states. [2019-10-22 11:22:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:29,514 INFO L93 Difference]: Finished difference Result 351 states and 489 transitions. [2019-10-22 11:22:29,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:29,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:22:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:29,516 INFO L225 Difference]: With dead ends: 351 [2019-10-22 11:22:29,516 INFO L226 Difference]: Without dead ends: 90 [2019-10-22 11:22:29,517 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:22:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-22 11:22:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2019-10-22 11:22:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-22 11:22:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2019-10-22 11:22:29,527 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 32 [2019-10-22 11:22:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:29,527 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2019-10-22 11:22:29,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2019-10-22 11:22:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:29,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:29,529 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:22:29,529 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:29,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1969698978, now seen corresponding path program 1 times [2019-10-22 11:22:29,530 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:29,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547834566] [2019-10-22 11:22:29,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:29,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:29,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:29,581 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:22:29,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547834566] [2019-10-22 11:22:29,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:29,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:29,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751865105] [2019-10-22 11:22:29,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:29,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:29,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:29,583 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 5 states. [2019-10-22 11:22:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:29,621 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-10-22 11:22:29,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:29,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:22:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:29,622 INFO L225 Difference]: With dead ends: 103 [2019-10-22 11:22:29,622 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:22:29,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:22:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:22:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:22:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:22:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:22:29,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-10-22 11:22:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:29,624 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:22:29,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:22:29,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:22:29,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:22:29,751 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-10-22 11:22:30,365 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 15 [2019-10-22 11:22:30,588 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 15 [2019-10-22 11:22:30,793 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2019-10-22 11:22:31,045 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 15 [2019-10-22 11:22:31,198 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 20 [2019-10-22 11:22:31,358 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 15 [2019-10-22 11:22:31,452 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 98) no Hoare annotation was computed. [2019-10-22 11:22:31,452 INFO L439 ceAbstractionStarter]: At program point L234(lines 234 240) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (<= ~waterLevel~0 1) (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~2) (= ~pumpRunning~0 0) .cse1)) (and (= ~pumpRunning~0 1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) .cse1)))) [2019-10-22 11:22:31,452 INFO L439 ceAbstractionStarter]: At program point L234-1(lines 234 240) the Hoare annotation is: false [2019-10-22 11:22:31,452 INFO L439 ceAbstractionStarter]: At program point L234-2(lines 234 240) the Hoare annotation is: false [2019-10-22 11:22:31,452 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:22:31,453 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 776) no Hoare annotation was computed. [2019-10-22 11:22:31,453 INFO L439 ceAbstractionStarter]: At program point L763-1(lines 1 918) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1) (and (= ~pumpRunning~0 1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) .cse1)))) [2019-10-22 11:22:31,453 INFO L443 ceAbstractionStarter]: For program point L763-2(lines 763 776) no Hoare annotation was computed. [2019-10-22 11:22:31,453 INFO L439 ceAbstractionStarter]: At program point L763-3(lines 1 918) the Hoare annotation is: false [2019-10-22 11:22:31,453 INFO L443 ceAbstractionStarter]: For program point L763-4(lines 763 776) no Hoare annotation was computed. [2019-10-22 11:22:31,453 INFO L439 ceAbstractionStarter]: At program point L763-5(lines 1 918) the Hoare annotation is: false [2019-10-22 11:22:31,453 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 786) no Hoare annotation was computed. [2019-10-22 11:22:31,454 INFO L439 ceAbstractionStarter]: At program point L879(lines 870 883) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2) (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) (and .cse0 .cse1 .cse2)))) [2019-10-22 11:22:31,454 INFO L439 ceAbstractionStarter]: At program point L367(lines 352 370) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3)) (.cse1 (= 1 ~systemActive~0)) (.cse4 (<= ~waterLevel~0 1)) (.cse2 (= ~pumpRunning~0 0)) (.cse3 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) .cse0 (= 1 |ULTIMATE.start_isHighWaterLevel_#res|) (and .cse1 .cse2 .cse3) (= 1 ULTIMATE.start_isHighWaterLevel_~tmp___0~1)) (and .cse0 (and .cse1 .cse4 .cse2 .cse3)) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse4 .cse2 .cse3))) [2019-10-22 11:22:31,454 INFO L439 ceAbstractionStarter]: At program point L879-1(lines 870 883) the Hoare annotation is: false [2019-10-22 11:22:31,454 INFO L439 ceAbstractionStarter]: At program point L367-1(lines 352 370) the Hoare annotation is: false [2019-10-22 11:22:31,454 INFO L439 ceAbstractionStarter]: At program point L879-2(lines 870 883) the Hoare annotation is: false [2019-10-22 11:22:31,454 INFO L439 ceAbstractionStarter]: At program point L367-2(lines 352 370) the Hoare annotation is: false [2019-10-22 11:22:31,454 INFO L439 ceAbstractionStarter]: At program point L103(lines 54 104) the Hoare annotation is: false [2019-10-22 11:22:31,454 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 786) no Hoare annotation was computed. [2019-10-22 11:22:31,455 INFO L443 ceAbstractionStarter]: For program point L797(lines 797 801) no Hoare annotation was computed. [2019-10-22 11:22:31,455 INFO L443 ceAbstractionStarter]: For program point L797-3(lines 797 801) no Hoare annotation was computed. [2019-10-22 11:22:31,455 INFO L443 ceAbstractionStarter]: For program point L797-6(lines 797 801) no Hoare annotation was computed. [2019-10-22 11:22:31,455 INFO L443 ceAbstractionStarter]: For program point L56(lines 55 102) no Hoare annotation was computed. [2019-10-22 11:22:31,455 INFO L439 ceAbstractionStarter]: At program point L915(lines 910 918) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-10-22 11:22:31,455 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 174) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-10-22 11:22:31,455 INFO L439 ceAbstractionStarter]: At program point L866(lines 861 869) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~2) (<= ~waterLevel~0 1) (not (= |ULTIMATE.start_getWaterLevel_#res| 2)) (= ~pumpRunning~0 0) .cse1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-10-22 11:22:31,455 INFO L439 ceAbstractionStarter]: At program point L866-1(lines 861 869) the Hoare annotation is: false [2019-10-22 11:22:31,456 INFO L439 ceAbstractionStarter]: At program point L866-2(lines 861 869) the Hoare annotation is: false [2019-10-22 11:22:31,456 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 773) no Hoare annotation was computed. [2019-10-22 11:22:31,459 INFO L443 ceAbstractionStarter]: For program point L767-2(lines 767 773) no Hoare annotation was computed. [2019-10-22 11:22:31,459 INFO L443 ceAbstractionStarter]: For program point L767-4(lines 767 773) no Hoare annotation was computed. [2019-10-22 11:22:31,459 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 61) no Hoare annotation was computed. [2019-10-22 11:22:31,459 INFO L439 ceAbstractionStarter]: At program point L123-2(lines 123 137) the Hoare annotation is: false [2019-10-22 11:22:31,460 INFO L439 ceAbstractionStarter]: At program point L834(lines 829 837) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~2) (= ~pumpRunning~0 0) .cse1) (<= ~waterLevel~0 1)) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-10-22 11:22:31,460 INFO L439 ceAbstractionStarter]: At program point L834-1(lines 829 837) the Hoare annotation is: false [2019-10-22 11:22:31,460 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:22:31,460 INFO L439 ceAbstractionStarter]: At program point L834-2(lines 829 837) the Hoare annotation is: false [2019-10-22 11:22:31,460 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-22 11:22:31,461 INFO L446 ceAbstractionStarter]: At program point L207(lines 188 210) the Hoare annotation is: true [2019-10-22 11:22:31,461 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 81) no Hoare annotation was computed. [2019-10-22 11:22:31,462 INFO L439 ceAbstractionStarter]: At program point L75-1(lines 75 81) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= ~pumpRunning~0 1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) .cse1)))) [2019-10-22 11:22:31,462 INFO L443 ceAbstractionStarter]: For program point L786(line 786) no Hoare annotation was computed. [2019-10-22 11:22:31,462 INFO L443 ceAbstractionStarter]: For program point L786-1(line 786) no Hoare annotation was computed. [2019-10-22 11:22:31,462 INFO L443 ceAbstractionStarter]: For program point L786-2(line 786) no Hoare annotation was computed. [2019-10-22 11:22:31,463 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-10-22 11:22:31,463 INFO L439 ceAbstractionStarter]: At program point L93-2(lines 227 233) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= ~pumpRunning~0 1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) .cse1)))) [2019-10-22 11:22:31,463 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 276) no Hoare annotation was computed. [2019-10-22 11:22:31,463 INFO L443 ceAbstractionStarter]: For program point L259-1(lines 259 276) no Hoare annotation was computed. [2019-10-22 11:22:31,463 INFO L443 ceAbstractionStarter]: For program point L259-2(lines 259 276) no Hoare annotation was computed. [2019-10-22 11:22:31,463 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 131) no Hoare annotation was computed. [2019-10-22 11:22:31,463 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 227 233) no Hoare annotation was computed. [2019-10-22 11:22:31,464 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:22:31,464 INFO L443 ceAbstractionStarter]: For program point L821(lines 821 825) no Hoare annotation was computed. [2019-10-22 11:22:31,464 INFO L439 ceAbstractionStarter]: At program point L227(lines 226 245) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= ~pumpRunning~0 1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) .cse1)))) [2019-10-22 11:22:31,464 INFO L443 ceAbstractionStarter]: For program point L227-1(lines 227 233) no Hoare annotation was computed. [2019-10-22 11:22:31,464 INFO L439 ceAbstractionStarter]: At program point L227-2(lines 226 245) the Hoare annotation is: false [2019-10-22 11:22:31,464 INFO L439 ceAbstractionStarter]: At program point L227-3(lines 226 245) the Hoare annotation is: false [2019-10-22 11:22:31,464 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 777) no Hoare annotation was computed. [2019-10-22 11:22:31,464 INFO L443 ceAbstractionStarter]: For program point L757-2(lines 757 777) no Hoare annotation was computed. [2019-10-22 11:22:31,464 INFO L443 ceAbstractionStarter]: For program point L757-4(lines 757 777) no Hoare annotation was computed. [2019-10-22 11:22:31,465 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-10-22 11:22:31,465 INFO L443 ceAbstractionStarter]: For program point L361-2(lines 361 365) no Hoare annotation was computed. [2019-10-22 11:22:31,465 INFO L443 ceAbstractionStarter]: For program point L361-3(lines 361 365) no Hoare annotation was computed. [2019-10-22 11:22:31,465 INFO L443 ceAbstractionStarter]: For program point L361-5(lines 361 365) no Hoare annotation was computed. [2019-10-22 11:22:31,465 INFO L443 ceAbstractionStarter]: For program point L361-6(lines 361 365) no Hoare annotation was computed. [2019-10-22 11:22:31,466 INFO L443 ceAbstractionStarter]: For program point L361-8(lines 361 365) no Hoare annotation was computed. [2019-10-22 11:22:31,466 INFO L439 ceAbstractionStarter]: At program point L312(lines 307 315) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) (= |ULTIMATE.start_isPumpRunning_#res| 1) (= 0 ULTIMATE.start_test_~splverifierCounter~0)) [2019-10-22 11:22:31,466 INFO L439 ceAbstractionStarter]: At program point L312-1(lines 307 315) the Hoare annotation is: false [2019-10-22 11:22:31,466 INFO L439 ceAbstractionStarter]: At program point L312-2(lines 307 315) the Hoare annotation is: false [2019-10-22 11:22:31,466 INFO L439 ceAbstractionStarter]: At program point L907(lines 1 918) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-10-22 11:22:31,466 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 880) no Hoare annotation was computed. [2019-10-22 11:22:31,466 INFO L443 ceAbstractionStarter]: For program point L874-1(lines 874 880) no Hoare annotation was computed. [2019-10-22 11:22:31,466 INFO L443 ceAbstractionStarter]: For program point L874-2(lines 874 880) no Hoare annotation was computed. [2019-10-22 11:22:31,466 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 271) no Hoare annotation was computed. [2019-10-22 11:22:31,467 INFO L443 ceAbstractionStarter]: For program point L263-1(lines 263 271) no Hoare annotation was computed. [2019-10-22 11:22:31,467 INFO L443 ceAbstractionStarter]: For program point L263-2(lines 263 271) no Hoare annotation was computed. [2019-10-22 11:22:31,467 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 71) no Hoare annotation was computed. [2019-10-22 11:22:31,467 INFO L439 ceAbstractionStarter]: At program point L65-1(lines 65 71) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= ~pumpRunning~0 1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) .cse1)))) [2019-10-22 11:22:31,467 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:22:31,467 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 813) no Hoare annotation was computed. [2019-10-22 11:22:31,467 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 205) no Hoare annotation was computed. [2019-10-22 11:22:31,467 INFO L446 ceAbstractionStarter]: At program point L198-1(lines 198 205) the Hoare annotation is: true [2019-10-22 11:22:31,468 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 786) no Hoare annotation was computed. [2019-10-22 11:22:31,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:31 BoogieIcfgContainer [2019-10-22 11:22:31,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:31,508 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:31,508 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:31,512 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:31,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:27" (3/4) ... [2019-10-22 11:22:31,516 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:22:31,539 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-10-22 11:22:31,539 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-10-22 11:22:31,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-10-22 11:22:31,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 11:22:31,544 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:22:31,544 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:22:31,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (\result == 0 && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) [2019-10-22 11:22:31,584 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && !(\result == 2)) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) [2019-10-22 11:22:31,585 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == tmp) && 1 == \result) && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) && 1 == tmp___0) || (0 == tmp && ((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) [2019-10-22 11:22:31,586 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && \result == 1) && 0 == splverifierCounter [2019-10-22 11:22:31,663 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7205afcf-0a95-4cc0-9b2b-93f4dcc8806a/bin/utaipan/witness.graphml [2019-10-22 11:22:31,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:31,666 INFO L168 Benchmark]: Toolchain (without parser) took 5865.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.0 MB). Free memory was 944.5 MB in the beginning and 902.6 MB in the end (delta: 41.9 MB). Peak memory consumption was 269.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:31,666 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:31,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:31,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:31,668 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 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:22:31,668 INFO L168 Benchmark]: RCFGBuilder took 982.71 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.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:31,668 INFO L168 Benchmark]: TraceAbstraction took 4048.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 913.0 MB in the end (delta: 158.8 MB). Peak memory consumption was 256.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:31,669 INFO L168 Benchmark]: Witness Printer took 156.28 ms. Allocated memory is still 1.3 GB. Free memory was 913.0 MB in the beginning and 902.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:31,671 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 566.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.11 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 982.71 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.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4048.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 913.0 MB in the end (delta: 158.8 MB). Peak memory consumption was 256.1 MB. Max. memory is 11.5 GB. * Witness Printer took 156.28 ms. Allocated memory is still 1.3 GB. Free memory was 913.0 MB in the beginning and 902.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 786]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 786]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 786]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (pumpRunning == 1 && (1 == systemActive && 0 == tmp) && 0 == splverifierCounter) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && \result == 1) && 0 == splverifierCounter - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 861]: Loop Invariant Derived loop invariant: (((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && !(\result == 2)) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 861]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 861]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (pumpRunning == 1 && (1 == systemActive && 0 == tmp) && 0 == splverifierCounter) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (\result == 0 && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == tmp) && 1 == \result) && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) && 1 == tmp___0) || (0 == tmp && ((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: ((((1 == systemActive && 0 == tmp) && pumpRunning == 0) && 0 == splverifierCounter) && waterLevel <= 1) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (pumpRunning == 1 && (1 == systemActive && 0 == tmp) && 0 == splverifierCounter) - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (waterLevel <= 1 && ((1 == systemActive && 0 == tmp) && pumpRunning == 0) && 0 == splverifierCounter) || (pumpRunning == 1 && (1 == systemActive && 0 == tmp) && 0 == splverifierCounter) - InvariantResult [Line: 910]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (pumpRunning == 1 && (1 == systemActive && 0 == tmp) && 0 == splverifierCounter) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (pumpRunning == 1 && (1 == systemActive && 0 == tmp) && 0 == splverifierCounter) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, HoareTripleCheckerStatistics: 745 SDtfs, 823 SDslu, 1116 SDs, 0 SdLazy, 168 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=7, 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, 10 MinimizatonAttempts, 618 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 34 PreInvPairs, 101 NumberOfFragments, 379 HoareAnnotationTreeSize, 34 FomulaSimplifications, 26056 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 34 FomulaSimplificationsInter, 4317 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 11520 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 correct! Received shutdown request...