./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product38.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_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/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 a0c13a298b8ef5fea6639223509104e0f4da0801 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:49,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:49,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:49,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:49,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:49,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:49,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:49,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:49,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:49,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:49,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:49,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:49,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:49,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:49,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:49,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:49,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:49,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:49,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:49,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:49,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:49,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:49,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:49,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:49,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:49,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:49,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:49,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:49,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:49,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:49,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:49,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:49,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:49,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:49,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:49,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:49,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:49,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:49,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:49,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:49,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:49,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:49,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:49,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:49,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:49,291 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:49,291 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:49,291 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:49,292 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:49,292 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:49,292 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:49,292 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:49,292 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:49,292 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:49,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:49,293 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:49,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:49,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:49,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:49,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:49,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:49,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:49,294 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:49,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:49,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:49,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:49,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:49,295 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:49,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:49,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:49,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:49,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:49,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:49,296 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:49,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:49,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:49,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:49,297 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_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/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 -> a0c13a298b8ef5fea6639223509104e0f4da0801 [2019-10-22 11:24:49,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:49,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:49,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:49,335 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:49,335 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:49,336 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c [2019-10-22 11:24:49,393 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/data/6f4c4d369/664b070d0e2c4fd688ba816f34d2149b/FLAGb303927e1 [2019-10-22 11:24:49,811 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:49,812 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/sv-benchmarks/c/product-lines/minepump_spec1_product38.cil.c [2019-10-22 11:24:49,825 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/data/6f4c4d369/664b070d0e2c4fd688ba816f34d2149b/FLAGb303927e1 [2019-10-22 11:24:49,838 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/data/6f4c4d369/664b070d0e2c4fd688ba816f34d2149b [2019-10-22 11:24:49,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:49,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:49,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:49,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:49,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:49,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:49" (1/1) ... [2019-10-22 11:24:49,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b85dbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:49, skipping insertion in model container [2019-10-22 11:24:49,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:49" (1/1) ... [2019-10-22 11:24:49,856 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:49,891 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:50,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:50,236 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:50,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:50,359 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:50,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50 WrapperNode [2019-10-22 11:24:50,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:50,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:50,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:50,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:50,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:50,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:50,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:50,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:50,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... [2019-10-22 11:24:50,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:50,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:50,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:50,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:50,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:24:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:51,341 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:51,342 INFO L284 CfgBuilder]: Removed 158 assume(true) statements. [2019-10-22 11:24:51,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:51 BoogieIcfgContainer [2019-10-22 11:24:51,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:51,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:51,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:51,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:51,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:49" (1/3) ... [2019-10-22 11:24:51,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5163d19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:51, skipping insertion in model container [2019-10-22 11:24:51,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:50" (2/3) ... [2019-10-22 11:24:51,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5163d19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:51, skipping insertion in model container [2019-10-22 11:24:51,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:51" (3/3) ... [2019-10-22 11:24:51,356 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product38.cil.c [2019-10-22 11:24:51,364 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:51,371 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:24:51,380 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:24:51,401 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:51,401 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:51,402 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:51,402 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:51,402 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:51,402 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:51,402 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:51,402 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-10-22 11:24:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:24:51,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,428 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1529342393, now seen corresponding path program 1 times [2019-10-22 11:24:51,441 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067204348] [2019-10-22 11:24:51,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:51,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067204348] [2019-10-22 11:24:51,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:51,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547681764] [2019-10-22 11:24:51,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:24:51,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:24:51,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:24:51,640 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-10-22 11:24:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,668 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-10-22 11:24:51,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:24:51,669 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:24:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,678 INFO L225 Difference]: With dead ends: 216 [2019-10-22 11:24:51,678 INFO L226 Difference]: Without dead ends: 107 [2019-10-22 11:24:51,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:24:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-22 11:24:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-22 11:24:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 11:24:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-10-22 11:24:51,718 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-10-22 11:24:51,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,719 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-10-22 11:24:51,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:24:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-10-22 11:24:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:24:51,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,720 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,720 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1945506518, now seen corresponding path program 1 times [2019-10-22 11:24:51,721 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887184253] [2019-10-22 11:24:51,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:51,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887184253] [2019-10-22 11:24:51,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:51,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209436435] [2019-10-22 11:24:51,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:51,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:51,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:51,818 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-10-22 11:24:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,831 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-10-22 11:24:51,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:51,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:24:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,840 INFO L225 Difference]: With dead ends: 107 [2019-10-22 11:24:51,840 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:24:51,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:24:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 11:24:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:24:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-10-22 11:24:51,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-10-22 11:24:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,852 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-10-22 11:24:51,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-10-22 11:24:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:51,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,853 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,853 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1939738244, now seen corresponding path program 1 times [2019-10-22 11:24:51,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478391710] [2019-10-22 11:24:51,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,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:24:51,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478391710] [2019-10-22 11:24:51,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:52,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706507759] [2019-10-22 11:24:52,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:52,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,001 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 5 states. [2019-10-22 11:24:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,063 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-10-22 11:24:52,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:52,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-22 11:24:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,065 INFO L225 Difference]: With dead ends: 84 [2019-10-22 11:24:52,065 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:24:52,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:24:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 11:24:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:24:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-10-22 11:24:52,071 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-10-22 11:24:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,071 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-10-22 11:24:52,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-10-22 11:24:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:52,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,072 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:24:52,073 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1547834963, now seen corresponding path program 1 times [2019-10-22 11:24:52,073 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741511963] [2019-10-22 11:24:52,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741511963] [2019-10-22 11:24:52,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:52,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040597250] [2019-10-22 11:24:52,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:52,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:52,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:52,131 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-10-22 11:24:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,193 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-10-22 11:24:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:52,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:24:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,194 INFO L225 Difference]: With dead ends: 105 [2019-10-22 11:24:52,194 INFO L226 Difference]: Without dead ends: 66 [2019-10-22 11:24:52,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-22 11:24:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-22 11:24:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 11:24:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-10-22 11:24:52,203 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-10-22 11:24:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,203 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-10-22 11:24:52,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-10-22 11:24:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:24:52,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,204 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1827782978, now seen corresponding path program 1 times [2019-10-22 11:24:52,205 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448212523] [2019-10-22 11:24:52,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448212523] [2019-10-22 11:24:52,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:52,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82880307] [2019-10-22 11:24:52,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:52,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:52,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,295 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-10-22 11:24:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,414 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-10-22 11:24:52,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:52,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:24:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,415 INFO L225 Difference]: With dead ends: 171 [2019-10-22 11:24:52,416 INFO L226 Difference]: Without dead ends: 113 [2019-10-22 11:24:52,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-22 11:24:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-10-22 11:24:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:24:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-10-22 11:24:52,425 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-10-22 11:24:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,427 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-10-22 11:24:52,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-10-22 11:24:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:24:52,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,428 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,428 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash 834728065, now seen corresponding path program 1 times [2019-10-22 11:24:52,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117736171] [2019-10-22 11:24:52,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117736171] [2019-10-22 11:24:52,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:52,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343137056] [2019-10-22 11:24:52,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:52,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,527 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-10-22 11:24:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,634 INFO L93 Difference]: Finished difference Result 344 states and 483 transitions. [2019-10-22 11:24:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:52,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:24:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,638 INFO L225 Difference]: With dead ends: 344 [2019-10-22 11:24:52,638 INFO L226 Difference]: Without dead ends: 280 [2019-10-22 11:24:52,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-22 11:24:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 128. [2019-10-22 11:24:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-22 11:24:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2019-10-22 11:24:52,670 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 30 [2019-10-22 11:24:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,675 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2019-10-22 11:24:52,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2019-10-22 11:24:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:52,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,677 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1506496567, now seen corresponding path program 1 times [2019-10-22 11:24:52,677 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843453062] [2019-10-22 11:24:52,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843453062] [2019-10-22 11:24:52,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:52,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162168815] [2019-10-22 11:24:52,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:52,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:52,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,754 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand 5 states. [2019-10-22 11:24:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,876 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2019-10-22 11:24:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:52,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:24:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,878 INFO L225 Difference]: With dead ends: 366 [2019-10-22 11:24:52,879 INFO L226 Difference]: Without dead ends: 364 [2019-10-22 11:24:52,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-10-22 11:24:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 128. [2019-10-22 11:24:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-22 11:24:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2019-10-22 11:24:52,906 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 31 [2019-10-22 11:24:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,906 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2019-10-22 11:24:52,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2019-10-22 11:24:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:52,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,907 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,908 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1549041486, now seen corresponding path program 1 times [2019-10-22 11:24:52,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586085782] [2019-10-22 11:24:52,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:52,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586085782] [2019-10-22 11:24:52,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:52,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511903342] [2019-10-22 11:24:52,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:52,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:52,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:52,957 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand 4 states. [2019-10-22 11:24:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,023 INFO L93 Difference]: Finished difference Result 308 states and 416 transitions. [2019-10-22 11:24:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:53,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 11:24:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,024 INFO L225 Difference]: With dead ends: 308 [2019-10-22 11:24:53,024 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 11:24:53,025 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:24:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 11:24:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2019-10-22 11:24:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-22 11:24:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2019-10-22 11:24:53,043 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 31 [2019-10-22 11:24:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,044 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2019-10-22 11:24:53,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2019-10-22 11:24:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:24:53,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:53,046 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:53,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1290876048, now seen corresponding path program 1 times [2019-10-22 11:24:53,046 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448447397] [2019-10-22 11:24:53,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:53,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448447397] [2019-10-22 11:24:53,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:53,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787351390] [2019-10-22 11:24:53,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:53,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:53,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:53,094 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand 3 states. [2019-10-22 11:24:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,119 INFO L93 Difference]: Finished difference Result 316 states and 422 transitions. [2019-10-22 11:24:53,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:53,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 11:24:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,121 INFO L225 Difference]: With dead ends: 316 [2019-10-22 11:24:53,121 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 11:24:53,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 11:24:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-10-22 11:24:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-22 11:24:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2019-10-22 11:24:53,143 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 31 [2019-10-22 11:24:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,143 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2019-10-22 11:24:53,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2019-10-22 11:24:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:24:53,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,144 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:24:53,144 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash 891331378, now seen corresponding path program 1 times [2019-10-22 11:24:53,149 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431327646] [2019-10-22 11:24:53,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:54,003 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:24:54,003 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:24:54,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:54 BoogieIcfgContainer [2019-10-22 11:24:54,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:54,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:54,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:54,102 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:54,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:51" (3/4) ... [2019-10-22 11:24:54,104 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:24:54,192 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3f3a0e08-d6e2-4f2d-9600-b34a7b7a9097/bin/utaipan/witness.graphml [2019-10-22 11:24:54,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:54,194 INFO L168 Benchmark]: Toolchain (without parser) took 4352.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -226.4 MB). Peak memory consumption was 219.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,194 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:54,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,195 INFO L168 Benchmark]: Boogie Preprocessor took 64.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:54,196 INFO L168 Benchmark]: RCFGBuilder took 827.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,196 INFO L168 Benchmark]: TraceAbstraction took 2757.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 857.4 MB in the end (delta: 172.1 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,196 INFO L168 Benchmark]: Witness Printer took 90.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 857.4 MB in the beginning and 1.2 GB in the end (delta: -313.5 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:54,199 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 518.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.00 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 827.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2757.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 857.4 MB in the end (delta: 172.1 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. * Witness Printer took 90.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 857.4 MB in the beginning and 1.2 GB in the end (delta: -313.5 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 837]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L377] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L580] int pumpRunning = 0; [L581] int systemActive = 1; [L843] int waterLevel = 1; [L844] int methaneLevelCritical = 0; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L170] int retValue_acc ; [L173] retValue_acc = 1 [L174] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L767] int splverifierCounter ; [L768] int tmp ; [L769] int tmp___0 ; [L770] int tmp___1 ; [L771] int tmp___2 ; [L774] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L776] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L784] tmp = __VERIFIER_nondet_int() [L786] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L861] COND TRUE waterLevel < 2 [L862] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L794] tmp___0 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L873] COND FALSE !(\read(methaneLevelCritical)) [L876] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L804] tmp___2 = __VERIFIER_nondet_int() [L806] COND TRUE \read(tmp___2) [L761] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L587] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L594] COND TRUE \read(systemActive) [L642] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L645] COND FALSE !(\read(pumpRunning)) [L616] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L619] COND TRUE ! pumpRunning [L739] int retValue_acc ; [L740] int tmp ; [L741] int tmp___0 ; [L923] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L926] COND FALSE !(waterLevel < 2) [L930] retValue_acc = 0 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L745] tmp = isHighWaterSensorDry() [L747] COND FALSE !(\read(tmp)) [L750] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L752] retValue_acc = tmp___0 [L753] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L621] tmp = isHighWaterLevel() [L623] COND TRUE \read(tmp) [L670] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L183] int tmp ; [L184] int tmp___0 ; [L882] int retValue_acc ; [L885] retValue_acc = methaneLevelCritical [L886] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L188] tmp = isMethaneLevelCritical() [L190] COND TRUE \read(tmp) [L694] int retValue_acc ; [L697] retValue_acc = pumpRunning [L698] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L192] tmp___0 = isPumpRunning() [L194] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L837] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 111 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 785 SDtfs, 952 SDslu, 964 SDs, 0 SdLazy, 149 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 483 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 11571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...