./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_7.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_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_7.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/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 ccd6d122756047ddb1225c106ac06a6748e14c22 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:26:18,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:18,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:18,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:18,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:18,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:18,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:18,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:18,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:18,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:18,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:18,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:18,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:18,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:18,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:18,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:18,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:18,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:18,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:18,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:18,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:18,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:18,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:18,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:18,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:18,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:18,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:18,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:18,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:18,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:18,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:18,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:18,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:18,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:18,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:18,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:18,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:18,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:18,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:18,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:18,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:18,512 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:18,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:18,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:18,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:18,524 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:18,524 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:18,524 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:18,524 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:18,524 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:18,525 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:18,525 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:18,525 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:18,525 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:18,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:18,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:18,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:18,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:18,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:18,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:18,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:18,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:18,527 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:18,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:18,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:18,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:18,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:18,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:18,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:18,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:18,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:18,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:18,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:18,529 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:18,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:18,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:18,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:18,530 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_b077d3a6-c3fe-48be-986e-8a7447fb4936/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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2019-10-22 11:26:18,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:18,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:18,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:18,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:18,571 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:18,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/../../sv-benchmarks/c/locks/test_locks_7.c [2019-10-22 11:26:18,619 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/data/4811b5307/b31f9df0173349ba9b2195c54701af5e/FLAG6ef7011f0 [2019-10-22 11:26:18,996 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:18,996 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/sv-benchmarks/c/locks/test_locks_7.c [2019-10-22 11:26:19,002 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/data/4811b5307/b31f9df0173349ba9b2195c54701af5e/FLAG6ef7011f0 [2019-10-22 11:26:19,011 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/data/4811b5307/b31f9df0173349ba9b2195c54701af5e [2019-10-22 11:26:19,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:19,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:19,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:19,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:19,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:19,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:19" (1/1) ... [2019-10-22 11:26:19,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc8eb70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19, skipping insertion in model container [2019-10-22 11:26:19,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:19" (1/1) ... [2019-10-22 11:26:19,030 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:19,047 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:19,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:19,226 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:19,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:19,320 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:19,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19 WrapperNode [2019-10-22 11:26:19,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:19,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:19,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:19,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:19,328 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:26:19" (1/1) ... [2019-10-22 11:26:19,333 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:26:19" (1/1) ... [2019-10-22 11:26:19,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:19,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:19,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:19,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:19,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19" (1/1) ... [2019-10-22 11:26:19,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19" (1/1) ... [2019-10-22 11:26:19,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19" (1/1) ... [2019-10-22 11:26:19,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19" (1/1) ... [2019-10-22 11:26:19,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19" (1/1) ... [2019-10-22 11:26:19,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19" (1/1) ... [2019-10-22 11:26:19,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19" (1/1) ... [2019-10-22 11:26:19,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:19,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:19,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:19,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:19,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/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:26:19,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:19,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:19,597 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:19,597 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 11:26:19,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:19 BoogieIcfgContainer [2019-10-22 11:26:19,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:19,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:19,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:19,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:19,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:19" (1/3) ... [2019-10-22 11:26:19,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511bfd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:19, skipping insertion in model container [2019-10-22 11:26:19,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:19" (2/3) ... [2019-10-22 11:26:19,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511bfd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:19, skipping insertion in model container [2019-10-22 11:26:19,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:19" (3/3) ... [2019-10-22 11:26:19,605 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-10-22 11:26:19,614 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:19,620 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:26:19,630 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:26:19,650 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:19,651 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:19,651 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:19,651 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:19,651 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:19,651 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:19,651 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:19,651 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-10-22 11:26:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:26:19,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:19,687 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:19,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1589939160, now seen corresponding path program 1 times [2019-10-22 11:26:19,709 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:19,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128073409] [2019-10-22 11:26:19,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:19,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:19,905 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:26:19,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128073409] [2019-10-22 11:26:19,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:19,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:19,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208175031] [2019-10-22 11:26:19,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:19,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:19,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:19,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:19,922 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2019-10-22 11:26:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:19,955 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2019-10-22 11:26:19,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:19,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 11:26:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:19,967 INFO L225 Difference]: With dead ends: 64 [2019-10-22 11:26:19,967 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:26:19,970 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:26:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:26:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-10-22 11:26:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:26:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2019-10-22 11:26:20,002 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 13 [2019-10-22 11:26:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,002 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. [2019-10-22 11:26:20,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. [2019-10-22 11:26:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:26:20,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,004 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1982966170, now seen corresponding path program 1 times [2019-10-22 11:26:20,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619538191] [2019-10-22 11:26:20,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,047 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:26:20,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619538191] [2019-10-22 11:26:20,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328490652] [2019-10-22 11:26:20,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,051 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. [2019-10-22 11:26:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,079 INFO L93 Difference]: Finished difference Result 83 states and 148 transitions. [2019-10-22 11:26:20,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 11:26:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,081 INFO L225 Difference]: With dead ends: 83 [2019-10-22 11:26:20,082 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:26:20,082 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:26:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:26:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-10-22 11:26:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 11:26:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2019-10-22 11:26:20,089 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 13 [2019-10-22 11:26:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,090 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 85 transitions. [2019-10-22 11:26:20,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 85 transitions. [2019-10-22 11:26:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:26:20,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,091 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,091 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2043259385, now seen corresponding path program 1 times [2019-10-22 11:26:20,092 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864859327] [2019-10-22 11:26:20,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,122 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:26:20,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864859327] [2019-10-22 11:26:20,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28945457] [2019-10-22 11:26:20,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,124 INFO L87 Difference]: Start difference. First operand 48 states and 85 transitions. Second operand 3 states. [2019-10-22 11:26:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,139 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2019-10-22 11:26:20,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 11:26:20,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,141 INFO L225 Difference]: With dead ends: 77 [2019-10-22 11:26:20,141 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 11:26:20,141 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:26:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 11:26:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-10-22 11:26:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 11:26:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2019-10-22 11:26:20,146 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 14 [2019-10-22 11:26:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,146 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 87 transitions. [2019-10-22 11:26:20,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2019-10-22 11:26:20,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:26:20,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,147 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,148 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1342194807, now seen corresponding path program 1 times [2019-10-22 11:26:20,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75102688] [2019-10-22 11:26:20,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:20,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75102688] [2019-10-22 11:26:20,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157887392] [2019-10-22 11:26:20,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,179 INFO L87 Difference]: Start difference. First operand 51 states and 87 transitions. Second operand 3 states. [2019-10-22 11:26:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,195 INFO L93 Difference]: Finished difference Result 96 states and 164 transitions. [2019-10-22 11:26:20,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 11:26:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,197 INFO L225 Difference]: With dead ends: 96 [2019-10-22 11:26:20,197 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 11:26:20,197 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:26:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 11:26:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2019-10-22 11:26:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:26:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2019-10-22 11:26:20,204 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 14 [2019-10-22 11:26:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,204 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2019-10-22 11:26:20,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2019-10-22 11:26:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:26:20,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,205 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,206 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1735221817, now seen corresponding path program 1 times [2019-10-22 11:26:20,206 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778741447] [2019-10-22 11:26:20,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,233 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:26:20,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778741447] [2019-10-22 11:26:20,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483776267] [2019-10-22 11:26:20,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,235 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand 3 states. [2019-10-22 11:26:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,263 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2019-10-22 11:26:20,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 11:26:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,265 INFO L225 Difference]: With dead ends: 160 [2019-10-22 11:26:20,265 INFO L226 Difference]: Without dead ends: 96 [2019-10-22 11:26:20,266 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:26:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-22 11:26:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-10-22 11:26:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-22 11:26:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 158 transitions. [2019-10-22 11:26:20,279 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 158 transitions. Word has length 14 [2019-10-22 11:26:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,280 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 158 transitions. [2019-10-22 11:26:20,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 158 transitions. [2019-10-22 11:26:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:26:20,280 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,281 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,281 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848603, now seen corresponding path program 1 times [2019-10-22 11:26:20,281 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56852124] [2019-10-22 11:26:20,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,337 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:26:20,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56852124] [2019-10-22 11:26:20,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403706029] [2019-10-22 11:26:20,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,338 INFO L87 Difference]: Start difference. First operand 94 states and 158 transitions. Second operand 3 states. [2019-10-22 11:26:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,366 INFO L93 Difference]: Finished difference Result 143 states and 237 transitions. [2019-10-22 11:26:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 11:26:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,368 INFO L225 Difference]: With dead ends: 143 [2019-10-22 11:26:20,368 INFO L226 Difference]: Without dead ends: 98 [2019-10-22 11:26:20,368 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:26:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-22 11:26:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-10-22 11:26:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-22 11:26:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 158 transitions. [2019-10-22 11:26:20,376 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 158 transitions. Word has length 15 [2019-10-22 11:26:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,376 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 158 transitions. [2019-10-22 11:26:20,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 158 transitions. [2019-10-22 11:26:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:26:20,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,377 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,377 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2042913181, now seen corresponding path program 1 times [2019-10-22 11:26:20,378 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292605556] [2019-10-22 11:26:20,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,408 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:26:20,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292605556] [2019-10-22 11:26:20,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787829374] [2019-10-22 11:26:20,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,409 INFO L87 Difference]: Start difference. First operand 96 states and 158 transitions. Second operand 3 states. [2019-10-22 11:26:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,425 INFO L93 Difference]: Finished difference Result 272 states and 448 transitions. [2019-10-22 11:26:20,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 11:26:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,427 INFO L225 Difference]: With dead ends: 272 [2019-10-22 11:26:20,427 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 11:26:20,428 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:26:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 11:26:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-10-22 11:26:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 11:26:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2019-10-22 11:26:20,440 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 15 [2019-10-22 11:26:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,440 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2019-10-22 11:26:20,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2019-10-22 11:26:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:26:20,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:20,441 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1859027105, now seen corresponding path program 1 times [2019-10-22 11:26:20,442 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044791263] [2019-10-22 11:26:20,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,463 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:26:20,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044791263] [2019-10-22 11:26:20,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855678007] [2019-10-22 11:26:20,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,465 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand 3 states. [2019-10-22 11:26:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,479 INFO L93 Difference]: Finished difference Result 224 states and 364 transitions. [2019-10-22 11:26:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 11:26:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,480 INFO L225 Difference]: With dead ends: 224 [2019-10-22 11:26:20,480 INFO L226 Difference]: Without dead ends: 222 [2019-10-22 11:26:20,481 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:26:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-22 11:26:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 180. [2019-10-22 11:26:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 11:26:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 286 transitions. [2019-10-22 11:26:20,492 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 286 transitions. Word has length 15 [2019-10-22 11:26:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,492 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 286 transitions. [2019-10-22 11:26:20,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 286 transitions. [2019-10-22 11:26:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:26:20,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,493 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:26:20,494 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1093985828, now seen corresponding path program 1 times [2019-10-22 11:26:20,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021620119] [2019-10-22 11:26:20,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,514 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:26:20,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021620119] [2019-10-22 11:26:20,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762666963] [2019-10-22 11:26:20,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,516 INFO L87 Difference]: Start difference. First operand 180 states and 286 transitions. Second operand 3 states. [2019-10-22 11:26:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,546 INFO L93 Difference]: Finished difference Result 324 states and 520 transitions. [2019-10-22 11:26:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 11:26:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,551 INFO L225 Difference]: With dead ends: 324 [2019-10-22 11:26:20,551 INFO L226 Difference]: Without dead ends: 322 [2019-10-22 11:26:20,552 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:26:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-22 11:26:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 256. [2019-10-22 11:26:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-22 11:26:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 398 transitions. [2019-10-22 11:26:20,564 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 398 transitions. Word has length 16 [2019-10-22 11:26:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,564 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 398 transitions. [2019-10-22 11:26:20,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2019-10-22 11:26:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:26:20,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,566 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:26:20,566 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1487012838, now seen corresponding path program 1 times [2019-10-22 11:26:20,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682756527] [2019-10-22 11:26:20,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,585 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:26:20,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682756527] [2019-10-22 11:26:20,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119139876] [2019-10-22 11:26:20,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,587 INFO L87 Difference]: Start difference. First operand 256 states and 398 transitions. Second operand 3 states. [2019-10-22 11:26:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,641 INFO L93 Difference]: Finished difference Result 596 states and 928 transitions. [2019-10-22 11:26:20,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 11:26:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,643 INFO L225 Difference]: With dead ends: 596 [2019-10-22 11:26:20,643 INFO L226 Difference]: Without dead ends: 346 [2019-10-22 11:26:20,644 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:26:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-22 11:26:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2019-10-22 11:26:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-22 11:26:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 522 transitions. [2019-10-22 11:26:20,671 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 522 transitions. Word has length 16 [2019-10-22 11:26:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,671 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 522 transitions. [2019-10-22 11:26:20,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 522 transitions. [2019-10-22 11:26:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:26:20,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,673 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:26:20,673 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash 446393042, now seen corresponding path program 1 times [2019-10-22 11:26:20,673 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537697759] [2019-10-22 11:26:20,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,710 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:26:20,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537697759] [2019-10-22 11:26:20,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252168373] [2019-10-22 11:26:20,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,712 INFO L87 Difference]: Start difference. First operand 344 states and 522 transitions. Second operand 3 states. [2019-10-22 11:26:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,744 INFO L93 Difference]: Finished difference Result 524 states and 792 transitions. [2019-10-22 11:26:20,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:26:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,745 INFO L225 Difference]: With dead ends: 524 [2019-10-22 11:26:20,746 INFO L226 Difference]: Without dead ends: 358 [2019-10-22 11:26:20,746 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:26:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-10-22 11:26:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-10-22 11:26:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-22 11:26:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 530 transitions. [2019-10-22 11:26:20,766 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 530 transitions. Word has length 17 [2019-10-22 11:26:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,767 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 530 transitions. [2019-10-22 11:26:20,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 530 transitions. [2019-10-22 11:26:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:26:20,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,768 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:26:20,768 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1147457620, now seen corresponding path program 1 times [2019-10-22 11:26:20,769 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081295147] [2019-10-22 11:26:20,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,808 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:26:20,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081295147] [2019-10-22 11:26:20,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485598631] [2019-10-22 11:26:20,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,810 INFO L87 Difference]: Start difference. First operand 356 states and 530 transitions. Second operand 3 states. [2019-10-22 11:26:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,835 INFO L93 Difference]: Finished difference Result 616 states and 924 transitions. [2019-10-22 11:26:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:26:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,839 INFO L225 Difference]: With dead ends: 616 [2019-10-22 11:26:20,839 INFO L226 Difference]: Without dead ends: 614 [2019-10-22 11:26:20,839 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:26:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-22 11:26:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 516. [2019-10-22 11:26:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-10-22 11:26:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2019-10-22 11:26:20,857 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 17 [2019-10-22 11:26:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,857 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2019-10-22 11:26:20,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2019-10-22 11:26:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:26:20,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,858 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:26:20,858 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash 754430610, now seen corresponding path program 1 times [2019-10-22 11:26:20,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714855107] [2019-10-22 11:26:20,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,889 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:26:20,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714855107] [2019-10-22 11:26:20,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257959188] [2019-10-22 11:26:20,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,890 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand 3 states. [2019-10-22 11:26:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,922 INFO L93 Difference]: Finished difference Result 1176 states and 1692 transitions. [2019-10-22 11:26:20,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:26:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:20,924 INFO L225 Difference]: With dead ends: 1176 [2019-10-22 11:26:20,924 INFO L226 Difference]: Without dead ends: 678 [2019-10-22 11:26:20,925 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:26:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-10-22 11:26:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2019-10-22 11:26:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-10-22 11:26:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 946 transitions. [2019-10-22 11:26:20,945 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 946 transitions. Word has length 17 [2019-10-22 11:26:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:20,945 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 946 transitions. [2019-10-22 11:26:20,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 946 transitions. [2019-10-22 11:26:20,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:26:20,947 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:20,947 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:26:20,948 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:20,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:20,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1211663535, now seen corresponding path program 1 times [2019-10-22 11:26:20,948 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:20,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715733352] [2019-10-22 11:26:20,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:20,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:20,970 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:26:20,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715733352] [2019-10-22 11:26:20,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:20,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:20,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114204220] [2019-10-22 11:26:20,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:20,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:20,971 INFO L87 Difference]: Start difference. First operand 676 states and 946 transitions. Second operand 3 states. [2019-10-22 11:26:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:20,997 INFO L93 Difference]: Finished difference Result 1016 states and 1412 transitions. [2019-10-22 11:26:20,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:20,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 11:26:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,000 INFO L225 Difference]: With dead ends: 1016 [2019-10-22 11:26:21,000 INFO L226 Difference]: Without dead ends: 694 [2019-10-22 11:26:21,001 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:26:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-10-22 11:26:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-10-22 11:26:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-10-22 11:26:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 946 transitions. [2019-10-22 11:26:21,023 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 946 transitions. Word has length 18 [2019-10-22 11:26:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,024 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 946 transitions. [2019-10-22 11:26:21,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 946 transitions. [2019-10-22 11:26:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:26:21,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:21,026 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:26:21,026 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1912728113, now seen corresponding path program 1 times [2019-10-22 11:26:21,026 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:21,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450451361] [2019-10-22 11:26:21,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,044 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:26:21,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450451361] [2019-10-22 11:26:21,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:21,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732579722] [2019-10-22 11:26:21,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:21,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:21,045 INFO L87 Difference]: Start difference. First operand 692 states and 946 transitions. Second operand 3 states. [2019-10-22 11:26:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,075 INFO L93 Difference]: Finished difference Result 1160 states and 1588 transitions. [2019-10-22 11:26:21,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:21,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 11:26:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,079 INFO L225 Difference]: With dead ends: 1160 [2019-10-22 11:26:21,079 INFO L226 Difference]: Without dead ends: 1158 [2019-10-22 11:26:21,080 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:26:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-10-22 11:26:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1028. [2019-10-22 11:26:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-10-22 11:26:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1362 transitions. [2019-10-22 11:26:21,115 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1362 transitions. Word has length 18 [2019-10-22 11:26:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,115 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1362 transitions. [2019-10-22 11:26:21,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1362 transitions. [2019-10-22 11:26:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:26:21,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:21,117 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:26:21,117 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1519701103, now seen corresponding path program 1 times [2019-10-22 11:26:21,118 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:21,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508596594] [2019-10-22 11:26:21,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,132 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:26:21,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508596594] [2019-10-22 11:26:21,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:21,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924758000] [2019-10-22 11:26:21,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:21,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:21,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:21,134 INFO L87 Difference]: Start difference. First operand 1028 states and 1362 transitions. Second operand 3 states. [2019-10-22 11:26:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,167 INFO L93 Difference]: Finished difference Result 2312 states and 3028 transitions. [2019-10-22 11:26:21,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:21,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 11:26:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,171 INFO L225 Difference]: With dead ends: 2312 [2019-10-22 11:26:21,171 INFO L226 Difference]: Without dead ends: 1318 [2019-10-22 11:26:21,173 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:26:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-10-22 11:26:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2019-10-22 11:26:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-10-22 11:26:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1666 transitions. [2019-10-22 11:26:21,213 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1666 transitions. Word has length 18 [2019-10-22 11:26:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,213 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 1666 transitions. [2019-10-22 11:26:21,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1666 transitions. [2019-10-22 11:26:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:26:21,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:21,215 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:26:21,215 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:21,216 INFO L82 PathProgramCache]: Analyzing trace with hash -834754617, now seen corresponding path program 1 times [2019-10-22 11:26:21,216 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:21,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471055394] [2019-10-22 11:26:21,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,230 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:26:21,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471055394] [2019-10-22 11:26:21,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:21,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355165225] [2019-10-22 11:26:21,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:21,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:21,231 INFO L87 Difference]: Start difference. First operand 1316 states and 1666 transitions. Second operand 3 states. [2019-10-22 11:26:21,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,261 INFO L93 Difference]: Finished difference Result 1976 states and 2484 transitions. [2019-10-22 11:26:21,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:21,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:26:21,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,265 INFO L225 Difference]: With dead ends: 1976 [2019-10-22 11:26:21,265 INFO L226 Difference]: Without dead ends: 1350 [2019-10-22 11:26:21,266 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:26:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-10-22 11:26:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-10-22 11:26:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-10-22 11:26:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1666 transitions. [2019-10-22 11:26:21,305 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1666 transitions. Word has length 19 [2019-10-22 11:26:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,305 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 1666 transitions. [2019-10-22 11:26:21,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1666 transitions. [2019-10-22 11:26:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:26:21,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:21,307 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:26:21,307 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash -133690039, now seen corresponding path program 1 times [2019-10-22 11:26:21,308 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:21,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38295131] [2019-10-22 11:26:21,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,320 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:26:21,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38295131] [2019-10-22 11:26:21,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:21,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189505454] [2019-10-22 11:26:21,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:21,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:21,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:21,322 INFO L87 Difference]: Start difference. First operand 1348 states and 1666 transitions. Second operand 3 states. [2019-10-22 11:26:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,360 INFO L93 Difference]: Finished difference Result 2182 states and 2659 transitions. [2019-10-22 11:26:21,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:21,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:26:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,366 INFO L225 Difference]: With dead ends: 2182 [2019-10-22 11:26:21,366 INFO L226 Difference]: Without dead ends: 2180 [2019-10-22 11:26:21,367 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:26:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-10-22 11:26:21,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2052. [2019-10-22 11:26:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-10-22 11:26:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2466 transitions. [2019-10-22 11:26:21,413 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2466 transitions. Word has length 19 [2019-10-22 11:26:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,414 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 2466 transitions. [2019-10-22 11:26:21,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2466 transitions. [2019-10-22 11:26:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:26:21,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:21,417 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:26:21,417 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash -526717049, now seen corresponding path program 1 times [2019-10-22 11:26:21,418 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:21,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141308373] [2019-10-22 11:26:21,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,430 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:26:21,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141308373] [2019-10-22 11:26:21,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:21,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182070278] [2019-10-22 11:26:21,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:21,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:21,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:21,432 INFO L87 Difference]: Start difference. First operand 2052 states and 2466 transitions. Second operand 3 states. [2019-10-22 11:26:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,488 INFO L93 Difference]: Finished difference Result 4548 states and 5346 transitions. [2019-10-22 11:26:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:21,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:26:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,489 INFO L225 Difference]: With dead ends: 4548 [2019-10-22 11:26:21,489 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:26:21,492 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:26:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:26:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:26:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:26:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:26:21,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-22 11:26:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,493 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:26:21,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:26:21,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:26:21,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:26:21,513 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-10-22 11:26:21,513 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:26:21,513 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:26:21,514 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-10-22 11:26:21,514 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,514 INFO L446 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-10-22 11:26:21,514 INFO L446 ceAbstractionStarter]: At program point L120(lines 4 121) the Hoare annotation is: true [2019-10-22 11:26:21,514 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-10-22 11:26:21,514 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-22 11:26:21,514 INFO L439 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-10-22 11:26:21,514 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,515 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,516 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,516 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-10-22 11:26:21,516 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,516 INFO L446 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-10-22 11:26:21,516 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-10-22 11:26:21,516 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,516 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-10-22 11:26:21,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:21 BoogieIcfgContainer [2019-10-22 11:26:21,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:21,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:21,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:21,526 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:21,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:19" (3/4) ... [2019-10-22 11:26:21,530 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:26:21,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:26:21,547 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:26:21,609 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b077d3a6-c3fe-48be-986e-8a7447fb4936/bin/utaipan/witness.graphml [2019-10-22 11:26:21,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:21,611 INFO L168 Benchmark]: Toolchain (without parser) took 2596.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.2 MB in the beginning and 814.8 MB in the end (delta: 136.4 MB). Peak memory consumption was 273.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:21,612 INFO L168 Benchmark]: CDTParser took 0.15 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:26:21,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.2 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:21,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.09 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:26:21,614 INFO L168 Benchmark]: Boogie Preprocessor took 20.45 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:21,614 INFO L168 Benchmark]: RCFGBuilder took 226.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:21,614 INFO L168 Benchmark]: TraceAbstraction took 1926.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.9 MB in the end (delta: 283.7 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:21,615 INFO L168 Benchmark]: Witness Printer took 83.76 ms. Allocated memory is still 1.2 GB. Free memory was 821.9 MB in the beginning and 814.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:21,616 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.15 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 303.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.2 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.09 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. * Boogie Preprocessor took 20.45 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 226.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1926.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.9 MB in the end (delta: 283.7 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. * Witness Printer took 83.76 ms. Allocated memory is still 1.2 GB. Free memory was 821.9 MB in the beginning and 814.8 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 1.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1109 SDtfs, 543 SDslu, 710 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2052occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 9228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...