./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37b8edad74269e9ff0decb0295cb9343b2467e698f16054f344bf342aab69b21 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:14:26,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:14:26,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:14:26,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:14:26,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:14:26,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:14:26,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:14:26,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:14:26,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:14:26,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:14:26,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:14:26,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:14:26,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:14:26,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:14:26,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:14:26,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:14:26,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:14:26,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:14:26,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:14:26,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:14:26,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:14:26,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:14:26,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:14:26,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:14:26,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:14:26,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:14:26,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:14:26,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:14:26,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:14:26,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:14:26,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:14:26,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:14:26,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:14:26,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:14:26,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:14:26,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:14:26,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:14:26,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:14:26,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:14:26,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:14:26,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:14:26,472 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-20 23:14:26,516 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:14:26,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:14:26,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:14:26,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:14:26,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:14:26,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:14:26,518 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:14:26,518 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:14:26,519 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:14:26,519 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 23:14:26,519 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:14:26,519 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:14:26,519 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 23:14:26,519 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 23:14:26,520 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:14:26,520 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 23:14:26,520 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 23:14:26,520 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 23:14:26,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:14:26,521 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:14:26,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:14:26,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:14:26,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:14:26,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 23:14:26,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:14:26,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 23:14:26,523 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:14:26,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 23:14:26,523 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:14:26,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 23:14:26,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:14:26,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:14:26,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:14:26,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:14:26,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:14:26,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 23:14:26,525 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 23:14:26,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 23:14:26,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 23:14:26,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:14:26,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:14:26,525 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P 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(reach_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 -> 37b8edad74269e9ff0decb0295cb9343b2467e698f16054f344bf342aab69b21 [2021-11-20 23:14:26,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:14:26,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:14:26,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:14:26,951 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:14:26,952 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:14:26,954 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2021-11-20 23:14:27,041 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/data/0baab9226/1bf9243ca3fc422faabbc5790d8d151b/FLAG10f70421d [2021-11-20 23:14:27,816 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:14:27,819 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2021-11-20 23:14:27,849 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/data/0baab9226/1bf9243ca3fc422faabbc5790d8d151b/FLAG10f70421d [2021-11-20 23:14:28,008 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/data/0baab9226/1bf9243ca3fc422faabbc5790d8d151b [2021-11-20 23:14:28,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:14:28,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:14:28,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:14:28,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:14:28,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:14:28,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:28,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769403cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28, skipping insertion in model container [2021-11-20 23:14:28,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:28,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:14:28,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:14:28,338 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-20 23:14:28,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] [2021-11-20 23:14:28,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2021-11-20 23:14:28,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] [2021-11-20 23:14:28,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2021-11-20 23:14:28,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2021-11-20 23:14:28,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2021-11-20 23:14:28,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2021-11-20 23:14:28,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:14:28,802 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:14:28,818 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-11-20 23:14:28,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] [2021-11-20 23:14:28,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2021-11-20 23:14:28,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] [2021-11-20 23:14:28,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2021-11-20 23:14:28,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2021-11-20 23:14:28,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2021-11-20 23:14:28,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2021-11-20 23:14:28,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:14:28,955 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:14:28,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28 WrapperNode [2021-11-20 23:14:28,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:14:28,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:14:28,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:14:28,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:14:28,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,042 INFO L137 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 190 [2021-11-20 23:14:29,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:14:29,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:14:29,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:14:29,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:14:29,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:14:29,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:14:29,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:14:29,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:14:29,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (1/1) ... [2021-11-20 23:14:29,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:14:29,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:29,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:14:29,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:14:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-11-20 23:14:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-11-20 23:14:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-11-20 23:14:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-11-20 23:14:29,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:14:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:14:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 23:14:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 23:14:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:14:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 23:14:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:14:29,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:14:29,187 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 23:14:29,351 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:14:29,353 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:14:29,713 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:14:29,725 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:14:29,725 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-20 23:14:29,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:14:29 BoogieIcfgContainer [2021-11-20 23:14:29,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:14:29,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:14:29,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:14:29,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:14:29,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:14:28" (1/3) ... [2021-11-20 23:14:29,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3a94d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:14:29, skipping insertion in model container [2021-11-20 23:14:29,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:28" (2/3) ... [2021-11-20 23:14:29,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3a94d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:14:29, skipping insertion in model container [2021-11-20 23:14:29,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:14:29" (3/3) ... [2021-11-20 23:14:29,739 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2021-11-20 23:14:29,746 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 23:14:29,746 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:14:29,747 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-20 23:14:29,747 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 23:14:29,799 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,799 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,800 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,800 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,800 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,800 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,801 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,801 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,801 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,802 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,802 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,802 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,802 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,803 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,803 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,803 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,803 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,804 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,804 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,804 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,805 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,805 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,805 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,806 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,806 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,806 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,806 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,807 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,807 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,807 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,808 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,808 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,808 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,808 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,809 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,809 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,809 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,810 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,810 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,810 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,810 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,811 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,812 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,813 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,813 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,813 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,813 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,814 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,814 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,814 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,814 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,815 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,815 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,815 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,816 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,816 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,816 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,817 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,817 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,817 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,818 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,818 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,818 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,818 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,819 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,819 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,819 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,819 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,820 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,820 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,820 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,821 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,821 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,821 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,821 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,822 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,822 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,822 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,822 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,823 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,823 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,823 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,823 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,823 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,824 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,824 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,824 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,824 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,825 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,825 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,825 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,825 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,826 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,826 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,826 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,826 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,827 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,827 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,827 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,827 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,828 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,828 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,828 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,828 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,829 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,829 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,829 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,829 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,830 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,830 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,830 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,830 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,831 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,831 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,831 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,831 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,832 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,832 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,832 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,832 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,833 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,833 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,833 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,833 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,834 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,834 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,834 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,834 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,835 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,835 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,835 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,835 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,836 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,836 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,836 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,836 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,837 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,837 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,837 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,837 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,838 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,839 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,839 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,839 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,839 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,840 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,840 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,840 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,840 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,841 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,842 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,843 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,844 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,845 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,846 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,847 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,848 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,848 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,848 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,848 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,849 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,850 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,850 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,850 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,850 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,851 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,852 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,852 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,852 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,853 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,853 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,853 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,853 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,854 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,854 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,854 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,854 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,855 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,855 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,855 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,855 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,856 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,856 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,856 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,856 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,857 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,858 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,859 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,860 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,861 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,862 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,863 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,864 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,865 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,866 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,866 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,866 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,866 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,867 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,868 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,869 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,870 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,871 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,872 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,873 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,874 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,875 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,875 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,875 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,876 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,876 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,876 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,876 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,877 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,877 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,877 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,877 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,877 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,878 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,878 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,878 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,878 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,879 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,879 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,879 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,879 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,880 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,880 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,880 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,880 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,881 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,881 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,881 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,881 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,882 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,882 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,882 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,882 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,883 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,883 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,883 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,883 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,884 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,884 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,884 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,884 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,885 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,885 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,885 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,885 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,885 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,886 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,886 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,886 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,886 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,887 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,887 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,887 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,887 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,887 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,888 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,888 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,888 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,888 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,888 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,889 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,889 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,889 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,889 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,890 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,890 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,890 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,890 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,891 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,891 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,891 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,891 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,891 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,892 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,892 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,892 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,892 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,893 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,893 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,893 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,893 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,893 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,894 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,894 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,894 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,894 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,895 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,895 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,895 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,895 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,896 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,896 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,896 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,896 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,897 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,898 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,899 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,900 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,901 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,902 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,903 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,904 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,905 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,905 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,905 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,905 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,906 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,910 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,910 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,911 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,912 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,912 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,912 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,912 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,913 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,914 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,915 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,916 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,917 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,918 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,922 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,923 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,924 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,924 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,924 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,924 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,924 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,925 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,925 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,925 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,925 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,925 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,926 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,926 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,926 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:14:29,929 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-20 23:14:29,978 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:14:29,986 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 23:14:29,986 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-20 23:14:30,005 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-20 23:14:30,021 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 220 transitions, 456 flow [2021-11-20 23:14:30,024 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 220 transitions, 456 flow [2021-11-20 23:14:30,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 210 places, 220 transitions, 456 flow [2021-11-20 23:14:30,150 INFO L129 PetriNetUnfolder]: 17/218 cut-off events. [2021-11-20 23:14:30,150 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-20 23:14:30,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 218 events. 17/218 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 442 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 173. Up to 2 conditions per place. [2021-11-20 23:14:30,198 INFO L116 LiptonReduction]: Number of co-enabled transitions 17440 [2021-11-20 23:14:36,374 INFO L131 LiptonReduction]: Checked pairs total: 29990 [2021-11-20 23:14:36,374 INFO L133 LiptonReduction]: Total number of compositions: 198 [2021-11-20 23:14:36,387 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 60 transitions, 136 flow [2021-11-20 23:14:36,493 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1913 states, 1908 states have (on average 3.5455974842767297) internal successors, (6765), 1912 states have internal predecessors, (6765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 1913 states, 1908 states have (on average 3.5455974842767297) internal successors, (6765), 1912 states have internal predecessors, (6765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-20 23:14:36,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:36,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:36,524 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:36,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash 858118945, now seen corresponding path program 1 times [2021-11-20 23:14:36,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:36,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071146135] [2021-11-20 23:14:36,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:36,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:36,968 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:36,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071146135] [2021-11-20 23:14:36,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071146135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:36,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:36,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 23:14:36,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088036446] [2021-11-20 23:14:36,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:36,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 23:14:36,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 23:14:37,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:14:37,015 INFO L87 Difference]: Start difference. First operand has 1913 states, 1908 states have (on average 3.5455974842767297) internal successors, (6765), 1912 states have internal predecessors, (6765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:37,547 INFO L93 Difference]: Finished difference Result 2069 states and 6691 transitions. [2021-11-20 23:14:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:14:37,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-20 23:14:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:37,586 INFO L225 Difference]: With dead ends: 2069 [2021-11-20 23:14:37,586 INFO L226 Difference]: Without dead ends: 1982 [2021-11-20 23:14:37,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:14:37,590 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:37,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 21 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:14:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-11-20 23:14:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1899. [2021-11-20 23:14:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1895 states have (on average 3.2912928759894458) internal successors, (6237), 1898 states have internal predecessors, (6237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 6237 transitions. [2021-11-20 23:14:37,762 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 6237 transitions. Word has length 17 [2021-11-20 23:14:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:37,763 INFO L470 AbstractCegarLoop]: Abstraction has 1899 states and 6237 transitions. [2021-11-20 23:14:37,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 6237 transitions. [2021-11-20 23:14:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 23:14:37,767 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:37,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:37,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 23:14:37,768 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:37,769 INFO L85 PathProgramCache]: Analyzing trace with hash 551663106, now seen corresponding path program 1 times [2021-11-20 23:14:37,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:37,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272004470] [2021-11-20 23:14:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:37,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:37,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:37,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272004470] [2021-11-20 23:14:37,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272004470] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:37,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:37,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 23:14:37,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828315583] [2021-11-20 23:14:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:37,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 23:14:37,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 23:14:37,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 23:14:37,996 INFO L87 Difference]: Start difference. First operand 1899 states and 6237 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:38,602 INFO L93 Difference]: Finished difference Result 2946 states and 9724 transitions. [2021-11-20 23:14:38,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:14:38,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-20 23:14:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:38,632 INFO L225 Difference]: With dead ends: 2946 [2021-11-20 23:14:38,632 INFO L226 Difference]: Without dead ends: 2804 [2021-11-20 23:14:38,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:14:38,634 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 162 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:38,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 9 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:14:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2021-11-20 23:14:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2472. [2021-11-20 23:14:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2468 states have (on average 3.309967585089141) internal successors, (8169), 2471 states have internal predecessors, (8169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 8169 transitions. [2021-11-20 23:14:38,757 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 8169 transitions. Word has length 18 [2021-11-20 23:14:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:38,758 INFO L470 AbstractCegarLoop]: Abstraction has 2472 states and 8169 transitions. [2021-11-20 23:14:38,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:38,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 8169 transitions. [2021-11-20 23:14:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 23:14:38,762 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:38,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:38,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 23:14:38,763 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:38,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1943633856, now seen corresponding path program 2 times [2021-11-20 23:14:38,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:38,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837402665] [2021-11-20 23:14:38,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:38,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:38,933 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837402665] [2021-11-20 23:14:38,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837402665] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:38,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:38,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 23:14:38,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659908853] [2021-11-20 23:14:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:38,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 23:14:38,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 23:14:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 23:14:38,936 INFO L87 Difference]: Start difference. First operand 2472 states and 8169 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:39,553 INFO L93 Difference]: Finished difference Result 2702 states and 8801 transitions. [2021-11-20 23:14:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:14:39,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-20 23:14:39,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:39,579 INFO L225 Difference]: With dead ends: 2702 [2021-11-20 23:14:39,580 INFO L226 Difference]: Without dead ends: 2571 [2021-11-20 23:14:39,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:14:39,584 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 117 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:39,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 10 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:14:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2021-11-20 23:14:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2392. [2021-11-20 23:14:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2388 states have (on average 3.298994974874372) internal successors, (7878), 2391 states have internal predecessors, (7878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 7878 transitions. [2021-11-20 23:14:39,727 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 7878 transitions. Word has length 18 [2021-11-20 23:14:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:39,727 INFO L470 AbstractCegarLoop]: Abstraction has 2392 states and 7878 transitions. [2021-11-20 23:14:39,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 7878 transitions. [2021-11-20 23:14:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:14:39,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:39,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:39,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 23:14:39,734 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 612061240, now seen corresponding path program 1 times [2021-11-20 23:14:39,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:39,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485324936] [2021-11-20 23:14:39,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:39,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:40,094 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:40,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485324936] [2021-11-20 23:14:40,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485324936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:40,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:40,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 23:14:40,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133597645] [2021-11-20 23:14:40,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:40,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 23:14:40,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:40,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 23:14:40,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:14:40,097 INFO L87 Difference]: Start difference. First operand 2392 states and 7878 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:41,845 INFO L93 Difference]: Finished difference Result 3213 states and 10483 transitions. [2021-11-20 23:14:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:14:41,846 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 23:14:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:41,881 INFO L225 Difference]: With dead ends: 3213 [2021-11-20 23:14:41,881 INFO L226 Difference]: Without dead ends: 3127 [2021-11-20 23:14:41,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:14:41,883 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 180 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:41,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 25 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-20 23:14:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2021-11-20 23:14:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 2882. [2021-11-20 23:14:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2878 states have (on average 3.3175816539263376) internal successors, (9548), 2881 states have internal predecessors, (9548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 9548 transitions. [2021-11-20 23:14:42,047 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 9548 transitions. Word has length 25 [2021-11-20 23:14:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:42,048 INFO L470 AbstractCegarLoop]: Abstraction has 2882 states and 9548 transitions. [2021-11-20 23:14:42,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 9548 transitions. [2021-11-20 23:14:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:14:42,060 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:42,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:42,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 23:14:42,061 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash 673642219, now seen corresponding path program 1 times [2021-11-20 23:14:42,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:42,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707663815] [2021-11-20 23:14:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:42,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:42,607 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:42,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707663815] [2021-11-20 23:14:42,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707663815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:42,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:42,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:14:42,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339349605] [2021-11-20 23:14:42,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:42,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:14:42,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:42,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:14:42,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:14:42,610 INFO L87 Difference]: Start difference. First operand 2882 states and 9548 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:45,117 INFO L93 Difference]: Finished difference Result 3829 states and 12485 transitions. [2021-11-20 23:14:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 23:14:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 23:14:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:45,153 INFO L225 Difference]: With dead ends: 3829 [2021-11-20 23:14:45,153 INFO L226 Difference]: Without dead ends: 3743 [2021-11-20 23:14:45,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=299, Invalid=693, Unknown=0, NotChecked=0, Total=992 [2021-11-20 23:14:45,155 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 258 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:45,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 41 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-20 23:14:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2021-11-20 23:14:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3442. [2021-11-20 23:14:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3438 states have (on average 3.3065735892961023) internal successors, (11368), 3441 states have internal predecessors, (11368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 11368 transitions. [2021-11-20 23:14:45,282 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 11368 transitions. Word has length 25 [2021-11-20 23:14:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:45,282 INFO L470 AbstractCegarLoop]: Abstraction has 3442 states and 11368 transitions. [2021-11-20 23:14:45,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 11368 transitions. [2021-11-20 23:14:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:14:45,292 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:45,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:45,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 23:14:45,293 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -626712486, now seen corresponding path program 2 times [2021-11-20 23:14:45,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:45,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203100659] [2021-11-20 23:14:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:45,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:45,703 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:45,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203100659] [2021-11-20 23:14:45,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203100659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:45,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:45,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 23:14:45,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177569197] [2021-11-20 23:14:45,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:45,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 23:14:45,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:45,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 23:14:45,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:14:45,705 INFO L87 Difference]: Start difference. First operand 3442 states and 11368 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:48,166 INFO L93 Difference]: Finished difference Result 4830 states and 15620 transitions. [2021-11-20 23:14:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-20 23:14:48,166 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 23:14:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:48,192 INFO L225 Difference]: With dead ends: 4830 [2021-11-20 23:14:48,192 INFO L226 Difference]: Without dead ends: 4744 [2021-11-20 23:14:48,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 23:14:48,194 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 222 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:48,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 39 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-20 23:14:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2021-11-20 23:14:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 3582. [2021-11-20 23:14:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 3578 states have (on average 3.300167691447736) internal successors, (11808), 3581 states have internal predecessors, (11808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 11808 transitions. [2021-11-20 23:14:48,347 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 11808 transitions. Word has length 25 [2021-11-20 23:14:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:48,347 INFO L470 AbstractCegarLoop]: Abstraction has 3582 states and 11808 transitions. [2021-11-20 23:14:48,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 11808 transitions. [2021-11-20 23:14:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:14:48,358 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:48,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:48,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 23:14:48,359 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:48,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1115878098, now seen corresponding path program 3 times [2021-11-20 23:14:48,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:48,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457609583] [2021-11-20 23:14:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:48,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:48,804 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:48,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457609583] [2021-11-20 23:14:48,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457609583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:48,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:48,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:14:48,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447677854] [2021-11-20 23:14:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:48,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:14:48,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:14:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:14:48,806 INFO L87 Difference]: Start difference. First operand 3582 states and 11808 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:51,867 INFO L93 Difference]: Finished difference Result 4687 states and 14931 transitions. [2021-11-20 23:14:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-20 23:14:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 23:14:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:51,886 INFO L225 Difference]: With dead ends: 4687 [2021-11-20 23:14:51,886 INFO L226 Difference]: Without dead ends: 4601 [2021-11-20 23:14:51,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=455, Invalid=1267, Unknown=0, NotChecked=0, Total=1722 [2021-11-20 23:14:51,888 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 277 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:51,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 66 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2656 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-20 23:14:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2021-11-20 23:14:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 3162. [2021-11-20 23:14:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3162 states, 3158 states have (on average 3.2365421152628246) internal successors, (10221), 3161 states have internal predecessors, (10221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 10221 transitions. [2021-11-20 23:14:52,046 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 10221 transitions. Word has length 25 [2021-11-20 23:14:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:52,047 INFO L470 AbstractCegarLoop]: Abstraction has 3162 states and 10221 transitions. [2021-11-20 23:14:52,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 10221 transitions. [2021-11-20 23:14:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:14:52,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:52,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:52,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 23:14:52,057 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:52,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1853265656, now seen corresponding path program 4 times [2021-11-20 23:14:52,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:52,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724434949] [2021-11-20 23:14:52,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:52,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:52,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:52,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724434949] [2021-11-20 23:14:52,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724434949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:52,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:52,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 23:14:52,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577600113] [2021-11-20 23:14:52,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:52,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 23:14:52,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:52,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 23:14:52,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:14:52,472 INFO L87 Difference]: Start difference. First operand 3162 states and 10221 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:55,619 INFO L93 Difference]: Finished difference Result 4316 states and 13699 transitions. [2021-11-20 23:14:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-20 23:14:55,619 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 23:14:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:55,662 INFO L225 Difference]: With dead ends: 4316 [2021-11-20 23:14:55,662 INFO L226 Difference]: Without dead ends: 4230 [2021-11-20 23:14:55,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=409, Invalid=1151, Unknown=0, NotChecked=0, Total=1560 [2021-11-20 23:14:55,665 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 262 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:55,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 61 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-20 23:14:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2021-11-20 23:14:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 3106. [2021-11-20 23:14:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3102 states have (on average 3.238233397807866) internal successors, (10045), 3105 states have internal predecessors, (10045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 10045 transitions. [2021-11-20 23:14:55,775 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 10045 transitions. Word has length 25 [2021-11-20 23:14:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:55,775 INFO L470 AbstractCegarLoop]: Abstraction has 3106 states and 10045 transitions. [2021-11-20 23:14:55,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 10045 transitions. [2021-11-20 23:14:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:14:55,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:55,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:55,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 23:14:55,785 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash 532362993, now seen corresponding path program 2 times [2021-11-20 23:14:55,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:55,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876609894] [2021-11-20 23:14:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:55,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:56,143 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:56,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876609894] [2021-11-20 23:14:56,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876609894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:56,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:56,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:14:56,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122499862] [2021-11-20 23:14:56,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:56,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:14:56,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:56,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:14:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:14:56,146 INFO L87 Difference]: Start difference. First operand 3106 states and 10045 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:58,552 INFO L93 Difference]: Finished difference Result 4602 states and 14458 transitions. [2021-11-20 23:14:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-20 23:14:58,552 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 23:14:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:58,566 INFO L225 Difference]: With dead ends: 4602 [2021-11-20 23:14:58,566 INFO L226 Difference]: Without dead ends: 4516 [2021-11-20 23:14:58,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=398, Invalid=1008, Unknown=0, NotChecked=0, Total=1406 [2021-11-20 23:14:58,568 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 291 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:58,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 50 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 23:14:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2021-11-20 23:14:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 3036. [2021-11-20 23:14:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3032 states have (on average 3.2437335092348283) internal successors, (9835), 3035 states have internal predecessors, (9835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 9835 transitions. [2021-11-20 23:14:58,679 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 9835 transitions. Word has length 25 [2021-11-20 23:14:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:58,680 INFO L470 AbstractCegarLoop]: Abstraction has 3036 states and 9835 transitions. [2021-11-20 23:14:58,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 9835 transitions. [2021-11-20 23:14:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:14:58,687 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:58,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:58,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 23:14:58,688 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:14:58,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:58,689 INFO L85 PathProgramCache]: Analyzing trace with hash -365364165, now seen corresponding path program 3 times [2021-11-20 23:14:58,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:58,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025830298] [2021-11-20 23:14:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:58,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:14:59,086 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:59,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025830298] [2021-11-20 23:14:59,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025830298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:59,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:59,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:14:59,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871052504] [2021-11-20 23:14:59,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:59,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:14:59,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:59,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:14:59,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:14:59,088 INFO L87 Difference]: Start difference. First operand 3036 states and 9835 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:02,036 INFO L93 Difference]: Finished difference Result 4382 states and 13798 transitions. [2021-11-20 23:15:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-20 23:15:02,036 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 23:15:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:02,049 INFO L225 Difference]: With dead ends: 4382 [2021-11-20 23:15:02,049 INFO L226 Difference]: Without dead ends: 4296 [2021-11-20 23:15:02,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2021-11-20 23:15:02,051 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 263 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:02,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 66 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2557 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-20 23:15:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2021-11-20 23:15:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 2966. [2021-11-20 23:15:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2962 states have (on average 3.229237002025658) internal successors, (9565), 2965 states have internal predecessors, (9565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 9565 transitions. [2021-11-20 23:15:02,155 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 9565 transitions. Word has length 25 [2021-11-20 23:15:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:02,156 INFO L470 AbstractCegarLoop]: Abstraction has 2966 states and 9565 transitions. [2021-11-20 23:15:02,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 9565 transitions. [2021-11-20 23:15:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:15:02,162 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:02,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:02,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 23:15:02,163 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:02,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1499949225, now seen corresponding path program 4 times [2021-11-20 23:15:02,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:02,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712821033] [2021-11-20 23:15:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:02,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:02,496 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:02,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712821033] [2021-11-20 23:15:02,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712821033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:02,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:02,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:02,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400468676] [2021-11-20 23:15:02,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:02,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:15:02,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:02,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:15:02,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:02,498 INFO L87 Difference]: Start difference. First operand 2966 states and 9565 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:05,286 INFO L93 Difference]: Finished difference Result 4162 states and 13138 transitions. [2021-11-20 23:15:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-20 23:15:05,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 23:15:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:05,294 INFO L225 Difference]: With dead ends: 4162 [2021-11-20 23:15:05,294 INFO L226 Difference]: Without dead ends: 4076 [2021-11-20 23:15:05,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=477, Invalid=1245, Unknown=0, NotChecked=0, Total=1722 [2021-11-20 23:15:05,295 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 267 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:05,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 63 Invalid, 2316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2267 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-20 23:15:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2021-11-20 23:15:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 2826. [2021-11-20 23:15:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2822 states have (on average 3.2406094968107726) internal successors, (9145), 2825 states have internal predecessors, (9145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 9145 transitions. [2021-11-20 23:15:05,412 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 9145 transitions. Word has length 25 [2021-11-20 23:15:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:05,412 INFO L470 AbstractCegarLoop]: Abstraction has 2826 states and 9145 transitions. [2021-11-20 23:15:05,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 9145 transitions. [2021-11-20 23:15:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:15:05,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:05,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:05,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 23:15:05,419 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:05,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash -794497401, now seen corresponding path program 5 times [2021-11-20 23:15:05,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:05,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232900343] [2021-11-20 23:15:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:05,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:05,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:05,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232900343] [2021-11-20 23:15:05,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232900343] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:05,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:05,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:05,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786264345] [2021-11-20 23:15:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:05,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:15:05,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:05,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:15:05,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:05,831 INFO L87 Difference]: Start difference. First operand 2826 states and 9145 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:08,808 INFO L93 Difference]: Finished difference Result 3807 states and 12013 transitions. [2021-11-20 23:15:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-20 23:15:08,808 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-20 23:15:08,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:08,814 INFO L225 Difference]: With dead ends: 3807 [2021-11-20 23:15:08,814 INFO L226 Difference]: Without dead ends: 3721 [2021-11-20 23:15:08,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=496, Invalid=1310, Unknown=0, NotChecked=0, Total=1806 [2021-11-20 23:15:08,815 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 227 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:08,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 72 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-20 23:15:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2021-11-20 23:15:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 2634. [2021-11-20 23:15:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2630 states have (on average 3.229657794676806) internal successors, (8494), 2633 states have internal predecessors, (8494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 8494 transitions. [2021-11-20 23:15:08,893 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 8494 transitions. Word has length 25 [2021-11-20 23:15:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:08,893 INFO L470 AbstractCegarLoop]: Abstraction has 2634 states and 8494 transitions. [2021-11-20 23:15:08,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 8494 transitions. [2021-11-20 23:15:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:08,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:08,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:08,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 23:15:08,899 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1791762257, now seen corresponding path program 1 times [2021-11-20 23:15:08,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:08,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648598526] [2021-11-20 23:15:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:08,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:09,398 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:09,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648598526] [2021-11-20 23:15:09,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648598526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:09,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:09,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 23:15:09,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757341215] [2021-11-20 23:15:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:09,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:15:09,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:09,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:15:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:09,401 INFO L87 Difference]: Start difference. First operand 2634 states and 8494 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:10,679 INFO L93 Difference]: Finished difference Result 4526 states and 14762 transitions. [2021-11-20 23:15:10,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:15:10,679 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:10,688 INFO L225 Difference]: With dead ends: 4526 [2021-11-20 23:15:10,688 INFO L226 Difference]: Without dead ends: 4526 [2021-11-20 23:15:10,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:15:10,689 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 250 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:10,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 64 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1827 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-20 23:15:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2021-11-20 23:15:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 3722. [2021-11-20 23:15:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3718 states have (on average 3.230231307154384) internal successors, (12010), 3721 states have internal predecessors, (12010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 12010 transitions. [2021-11-20 23:15:10,806 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 12010 transitions. Word has length 27 [2021-11-20 23:15:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:10,806 INFO L470 AbstractCegarLoop]: Abstraction has 3722 states and 12010 transitions. [2021-11-20 23:15:10,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 12010 transitions. [2021-11-20 23:15:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:10,814 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:10,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:10,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 23:15:10,814 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1183722421, now seen corresponding path program 1 times [2021-11-20 23:15:10,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:10,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817555487] [2021-11-20 23:15:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:10,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:11,382 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:11,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817555487] [2021-11-20 23:15:11,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817555487] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:11,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:11,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:11,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097158885] [2021-11-20 23:15:11,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:11,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:15:11,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:15:11,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:15:11,384 INFO L87 Difference]: Start difference. First operand 3722 states and 12010 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:13,131 INFO L93 Difference]: Finished difference Result 5674 states and 18458 transitions. [2021-11-20 23:15:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:15:13,131 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:13,142 INFO L225 Difference]: With dead ends: 5674 [2021-11-20 23:15:13,142 INFO L226 Difference]: Without dead ends: 5674 [2021-11-20 23:15:13,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:15:13,144 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 281 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:13,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 75 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:15:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5674 states. [2021-11-20 23:15:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5674 to 4310. [2021-11-20 23:15:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 4306 states have (on average 3.2080817464003717) internal successors, (13814), 4309 states have internal predecessors, (13814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 13814 transitions. [2021-11-20 23:15:13,272 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 13814 transitions. Word has length 27 [2021-11-20 23:15:13,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:13,273 INFO L470 AbstractCegarLoop]: Abstraction has 4310 states and 13814 transitions. [2021-11-20 23:15:13,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:13,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 13814 transitions. [2021-11-20 23:15:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:13,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:13,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:13,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 23:15:13,282 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:13,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1747595345, now seen corresponding path program 2 times [2021-11-20 23:15:13,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:13,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892635128] [2021-11-20 23:15:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:13,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:13,869 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:13,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892635128] [2021-11-20 23:15:13,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892635128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:13,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:13,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 23:15:13,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699956721] [2021-11-20 23:15:13,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:13,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:15:13,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:13,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:15:13,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:13,875 INFO L87 Difference]: Start difference. First operand 4310 states and 13814 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:15,331 INFO L93 Difference]: Finished difference Result 6076 states and 19818 transitions. [2021-11-20 23:15:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:15:15,331 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:15,343 INFO L225 Difference]: With dead ends: 6076 [2021-11-20 23:15:15,343 INFO L226 Difference]: Without dead ends: 6076 [2021-11-20 23:15:15,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:15:15,344 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 240 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:15,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 69 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:15:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2021-11-20 23:15:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 5272. [2021-11-20 23:15:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5272 states, 5268 states have (on average 3.231586940015186) internal successors, (17024), 5271 states have internal predecessors, (17024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5272 states to 5272 states and 17024 transitions. [2021-11-20 23:15:15,490 INFO L78 Accepts]: Start accepts. Automaton has 5272 states and 17024 transitions. Word has length 27 [2021-11-20 23:15:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:15,491 INFO L470 AbstractCegarLoop]: Abstraction has 5272 states and 17024 transitions. [2021-11-20 23:15:15,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5272 states and 17024 transitions. [2021-11-20 23:15:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:15,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:15,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:15,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-20 23:15:15,502 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1747595336, now seen corresponding path program 1 times [2021-11-20 23:15:15,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:15,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302141540] [2021-11-20 23:15:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:15,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:16,013 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:16,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302141540] [2021-11-20 23:15:16,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302141540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:16,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:16,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 23:15:16,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640739324] [2021-11-20 23:15:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:16,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:15:16,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:15:16,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:16,015 INFO L87 Difference]: Start difference. First operand 5272 states and 17024 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:17,465 INFO L93 Difference]: Finished difference Result 6076 states and 19704 transitions. [2021-11-20 23:15:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:15:17,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:17,482 INFO L225 Difference]: With dead ends: 6076 [2021-11-20 23:15:17,482 INFO L226 Difference]: Without dead ends: 6076 [2021-11-20 23:15:17,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:15:17,483 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 265 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:17,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 66 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:15:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2021-11-20 23:15:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 4184. [2021-11-20 23:15:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4184 states, 4180 states have (on average 3.214354066985646) internal successors, (13436), 4183 states have internal predecessors, (13436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 13436 transitions. [2021-11-20 23:15:17,609 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 13436 transitions. Word has length 27 [2021-11-20 23:15:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:17,610 INFO L470 AbstractCegarLoop]: Abstraction has 4184 states and 13436 transitions. [2021-11-20 23:15:17,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 13436 transitions. [2021-11-20 23:15:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:17,618 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:17,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:17,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-20 23:15:17,619 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:17,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1339901129, now seen corresponding path program 3 times [2021-11-20 23:15:17,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:17,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518068480] [2021-11-20 23:15:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:17,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:18,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518068480] [2021-11-20 23:15:18,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518068480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:18,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:18,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:18,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30386538] [2021-11-20 23:15:18,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:18,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:15:18,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:18,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:15:18,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:15:18,171 INFO L87 Difference]: Start difference. First operand 4184 states and 13436 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:19,753 INFO L93 Difference]: Finished difference Result 5836 states and 19098 transitions. [2021-11-20 23:15:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 23:15:19,753 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:19,765 INFO L225 Difference]: With dead ends: 5836 [2021-11-20 23:15:19,765 INFO L226 Difference]: Without dead ends: 5836 [2021-11-20 23:15:19,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2021-11-20 23:15:19,766 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 264 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:19,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 85 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 23:15:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5836 states. [2021-11-20 23:15:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5836 to 5032. [2021-11-20 23:15:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5032 states, 5028 states have (on average 3.242641209228321) internal successors, (16304), 5031 states have internal predecessors, (16304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 16304 transitions. [2021-11-20 23:15:19,915 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 16304 transitions. Word has length 27 [2021-11-20 23:15:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:19,915 INFO L470 AbstractCegarLoop]: Abstraction has 5032 states and 16304 transitions. [2021-11-20 23:15:19,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 16304 transitions. [2021-11-20 23:15:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:19,925 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:19,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:19,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-20 23:15:19,926 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1339901120, now seen corresponding path program 2 times [2021-11-20 23:15:19,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:19,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825181348] [2021-11-20 23:15:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:19,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:20,507 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:20,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825181348] [2021-11-20 23:15:20,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825181348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:20,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:20,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:20,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353031558] [2021-11-20 23:15:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:20,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:15:20,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:20,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:15:20,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:15:20,509 INFO L87 Difference]: Start difference. First operand 5032 states and 16304 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:22,174 INFO L93 Difference]: Finished difference Result 5836 states and 18984 transitions. [2021-11-20 23:15:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 23:15:22,175 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:22,186 INFO L225 Difference]: With dead ends: 5836 [2021-11-20 23:15:22,186 INFO L226 Difference]: Without dead ends: 5836 [2021-11-20 23:15:22,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2021-11-20 23:15:22,187 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 274 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:22,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 72 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:15:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5836 states. [2021-11-20 23:15:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5836 to 4004. [2021-11-20 23:15:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 4000 states have (on average 3.224) internal successors, (12896), 4003 states have internal predecessors, (12896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 12896 transitions. [2021-11-20 23:15:22,296 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 12896 transitions. Word has length 27 [2021-11-20 23:15:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:22,297 INFO L470 AbstractCegarLoop]: Abstraction has 4004 states and 12896 transitions. [2021-11-20 23:15:22,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 12896 transitions. [2021-11-20 23:15:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:22,305 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:22,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:22,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-20 23:15:22,305 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:22,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:22,306 INFO L85 PathProgramCache]: Analyzing trace with hash -148961921, now seen corresponding path program 4 times [2021-11-20 23:15:22,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:22,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215487696] [2021-11-20 23:15:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:22,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:22,839 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:22,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215487696] [2021-11-20 23:15:22,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215487696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:22,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:22,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 23:15:22,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047861857] [2021-11-20 23:15:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:22,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:15:22,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:22,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:15:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:22,841 INFO L87 Difference]: Start difference. First operand 4004 states and 12896 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:24,383 INFO L93 Difference]: Finished difference Result 5596 states and 18264 transitions. [2021-11-20 23:15:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:15:24,383 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:24,395 INFO L225 Difference]: With dead ends: 5596 [2021-11-20 23:15:24,395 INFO L226 Difference]: Without dead ends: 5596 [2021-11-20 23:15:24,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:15:24,396 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 267 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:24,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 69 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:15:24,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2021-11-20 23:15:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 3944. [2021-11-20 23:15:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3940 states have (on average 3.2274111675126904) internal successors, (12716), 3943 states have internal predecessors, (12716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 12716 transitions. [2021-11-20 23:15:24,527 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 12716 transitions. Word has length 27 [2021-11-20 23:15:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:24,527 INFO L470 AbstractCegarLoop]: Abstraction has 3944 states and 12716 transitions. [2021-11-20 23:15:24,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 12716 transitions. [2021-11-20 23:15:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:24,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:24,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:24,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-20 23:15:24,536 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:24,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2025857443, now seen corresponding path program 5 times [2021-11-20 23:15:24,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:24,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600091990] [2021-11-20 23:15:24,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:24,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:25,200 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:25,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600091990] [2021-11-20 23:15:25,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600091990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:25,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:25,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 23:15:25,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709068913] [2021-11-20 23:15:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:25,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:15:25,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:15:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:25,202 INFO L87 Difference]: Start difference. First operand 3944 states and 12716 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:26,804 INFO L93 Difference]: Finished difference Result 5468 states and 17919 transitions. [2021-11-20 23:15:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:15:26,805 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:26,817 INFO L225 Difference]: With dead ends: 5468 [2021-11-20 23:15:26,817 INFO L226 Difference]: Without dead ends: 5468 [2021-11-20 23:15:26,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:15:26,818 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 271 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:26,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 73 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 23:15:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2021-11-20 23:15:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 4592. [2021-11-20 23:15:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4592 states, 4588 states have (on average 3.2615518744551) internal successors, (14964), 4591 states have internal predecessors, (14964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4592 states to 4592 states and 14964 transitions. [2021-11-20 23:15:26,906 INFO L78 Accepts]: Start accepts. Automaton has 4592 states and 14964 transitions. Word has length 27 [2021-11-20 23:15:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:26,907 INFO L470 AbstractCegarLoop]: Abstraction has 4592 states and 14964 transitions. [2021-11-20 23:15:26,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4592 states and 14964 transitions. [2021-11-20 23:15:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:26,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:26,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:26,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-20 23:15:26,958 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2025857452, now seen corresponding path program 3 times [2021-11-20 23:15:26,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:26,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796363164] [2021-11-20 23:15:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:26,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:27,411 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:27,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796363164] [2021-11-20 23:15:27,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796363164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:27,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:27,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 23:15:27,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957641044] [2021-11-20 23:15:27,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:27,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 23:15:27,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 23:15:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:15:27,412 INFO L87 Difference]: Start difference. First operand 4592 states and 14964 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:28,631 INFO L93 Difference]: Finished difference Result 5396 states and 17644 transitions. [2021-11-20 23:15:28,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:15:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:28,642 INFO L225 Difference]: With dead ends: 5396 [2021-11-20 23:15:28,642 INFO L226 Difference]: Without dead ends: 5396 [2021-11-20 23:15:28,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-11-20 23:15:28,643 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 218 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:28,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 56 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-20 23:15:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2021-11-20 23:15:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 3804. [2021-11-20 23:15:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 3800 states have (on average 3.2305263157894735) internal successors, (12276), 3803 states have internal predecessors, (12276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 12276 transitions. [2021-11-20 23:15:28,716 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 12276 transitions. Word has length 27 [2021-11-20 23:15:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:28,716 INFO L470 AbstractCegarLoop]: Abstraction has 3804 states and 12276 transitions. [2021-11-20 23:15:28,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 12276 transitions. [2021-11-20 23:15:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:28,722 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:28,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:28,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-20 23:15:28,722 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:28,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1027409839, now seen corresponding path program 6 times [2021-11-20 23:15:28,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:28,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289484619] [2021-11-20 23:15:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:28,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:29,201 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:29,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289484619] [2021-11-20 23:15:29,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289484619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:29,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:29,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 23:15:29,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124392601] [2021-11-20 23:15:29,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:29,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:15:29,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:29,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:15:29,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:29,203 INFO L87 Difference]: Start difference. First operand 3804 states and 12276 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:30,761 INFO L93 Difference]: Finished difference Result 6686 states and 21991 transitions. [2021-11-20 23:15:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 23:15:30,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:30,775 INFO L225 Difference]: With dead ends: 6686 [2021-11-20 23:15:30,775 INFO L226 Difference]: Without dead ends: 6686 [2021-11-20 23:15:30,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:15:30,776 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 261 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:30,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 74 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:15:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6686 states. [2021-11-20 23:15:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6686 to 3846. [2021-11-20 23:15:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3842 states have (on average 3.2313899010931806) internal successors, (12415), 3845 states have internal predecessors, (12415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 12415 transitions. [2021-11-20 23:15:30,865 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 12415 transitions. Word has length 27 [2021-11-20 23:15:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:30,866 INFO L470 AbstractCegarLoop]: Abstraction has 3846 states and 12415 transitions. [2021-11-20 23:15:30,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 12415 transitions. [2021-11-20 23:15:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:30,870 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:30,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:30,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-20 23:15:30,871 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:30,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 485894865, now seen corresponding path program 2 times [2021-11-20 23:15:30,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:30,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505413454] [2021-11-20 23:15:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:30,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:31,515 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:31,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505413454] [2021-11-20 23:15:31,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505413454] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:31,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:31,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:31,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96370820] [2021-11-20 23:15:31,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:31,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:15:31,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:31,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:15:31,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:15:31,516 INFO L87 Difference]: Start difference. First operand 3846 states and 12415 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:33,133 INFO L93 Difference]: Finished difference Result 5738 states and 18683 transitions. [2021-11-20 23:15:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:15:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:33,175 INFO L225 Difference]: With dead ends: 5738 [2021-11-20 23:15:33,175 INFO L226 Difference]: Without dead ends: 5738 [2021-11-20 23:15:33,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:15:33,177 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 353 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:33,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 73 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-20 23:15:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2021-11-20 23:15:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 3786. [2021-11-20 23:15:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3786 states, 3782 states have (on average 3.2350608143839237) internal successors, (12235), 3785 states have internal predecessors, (12235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 12235 transitions. [2021-11-20 23:15:33,245 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 12235 transitions. Word has length 27 [2021-11-20 23:15:33,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:33,245 INFO L470 AbstractCegarLoop]: Abstraction has 3786 states and 12235 transitions. [2021-11-20 23:15:33,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 12235 transitions. [2021-11-20 23:15:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:33,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:33,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:33,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-20 23:15:33,250 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1058522523, now seen corresponding path program 3 times [2021-11-20 23:15:33,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:33,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910844428] [2021-11-20 23:15:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:33,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:33,898 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:33,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910844428] [2021-11-20 23:15:33,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910844428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:33,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:33,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:33,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679132996] [2021-11-20 23:15:33,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:33,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:15:33,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:15:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:15:33,901 INFO L87 Difference]: Start difference. First operand 3786 states and 12235 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:35,489 INFO L93 Difference]: Finished difference Result 5618 states and 18323 transitions. [2021-11-20 23:15:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:15:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:35,500 INFO L225 Difference]: With dead ends: 5618 [2021-11-20 23:15:35,500 INFO L226 Difference]: Without dead ends: 5618 [2021-11-20 23:15:35,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:15:35,501 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 353 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:35,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 73 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-20 23:15:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2021-11-20 23:15:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 3726. [2021-11-20 23:15:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3726 states, 3722 states have (on average 3.2388500806018268) internal successors, (12055), 3725 states have internal predecessors, (12055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 12055 transitions. [2021-11-20 23:15:35,571 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 12055 transitions. Word has length 27 [2021-11-20 23:15:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:35,572 INFO L470 AbstractCegarLoop]: Abstraction has 3726 states and 12055 transitions. [2021-11-20 23:15:35,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 12055 transitions. [2021-11-20 23:15:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:35,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:35,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:35,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-20 23:15:35,577 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:35,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1671639415, now seen corresponding path program 4 times [2021-11-20 23:15:35,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:35,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381965467] [2021-11-20 23:15:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:35,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:36,272 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:36,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381965467] [2021-11-20 23:15:36,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381965467] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:36,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:36,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:36,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312015586] [2021-11-20 23:15:36,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:36,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:15:36,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:36,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:15:36,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:15:36,274 INFO L87 Difference]: Start difference. First operand 3726 states and 12055 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:37,946 INFO L93 Difference]: Finished difference Result 5498 states and 17963 transitions. [2021-11-20 23:15:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:15:37,947 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:37,956 INFO L225 Difference]: With dead ends: 5498 [2021-11-20 23:15:37,956 INFO L226 Difference]: Without dead ends: 5498 [2021-11-20 23:15:37,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:15:37,957 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 301 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:37,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 81 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:15:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5498 states. [2021-11-20 23:15:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5498 to 3546. [2021-11-20 23:15:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3546 states, 3542 states have (on average 3.2509881422924902) internal successors, (11515), 3545 states have internal predecessors, (11515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 11515 transitions. [2021-11-20 23:15:38,021 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 11515 transitions. Word has length 27 [2021-11-20 23:15:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:38,021 INFO L470 AbstractCegarLoop]: Abstraction has 3546 states and 11515 transitions. [2021-11-20 23:15:38,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 11515 transitions. [2021-11-20 23:15:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:38,025 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:38,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:38,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-20 23:15:38,026 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash 978343143, now seen corresponding path program 5 times [2021-11-20 23:15:38,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:38,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896796868] [2021-11-20 23:15:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:38,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:38,564 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:38,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896796868] [2021-11-20 23:15:38,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896796868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:38,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:38,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:38,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463758641] [2021-11-20 23:15:38,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:38,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:15:38,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:38,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:15:38,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:15:38,565 INFO L87 Difference]: Start difference. First operand 3546 states and 11515 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:40,210 INFO L93 Difference]: Finished difference Result 5138 states and 16883 transitions. [2021-11-20 23:15:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 23:15:40,210 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:40,221 INFO L225 Difference]: With dead ends: 5138 [2021-11-20 23:15:40,221 INFO L226 Difference]: Without dead ends: 5138 [2021-11-20 23:15:40,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2021-11-20 23:15:40,222 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 332 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:40,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 76 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1952 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:15:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2021-11-20 23:15:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 3546. [2021-11-20 23:15:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3546 states, 3542 states have (on average 3.2509881422924902) internal successors, (11515), 3545 states have internal predecessors, (11515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 11515 transitions. [2021-11-20 23:15:40,295 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 11515 transitions. Word has length 27 [2021-11-20 23:15:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:40,295 INFO L470 AbstractCegarLoop]: Abstraction has 3546 states and 11515 transitions. [2021-11-20 23:15:40,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 11515 transitions. [2021-11-20 23:15:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:40,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:40,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:40,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-20 23:15:40,302 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:40,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -772704601, now seen corresponding path program 6 times [2021-11-20 23:15:40,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:40,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119617560] [2021-11-20 23:15:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:40,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:40,921 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:40,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119617560] [2021-11-20 23:15:40,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119617560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:40,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:40,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:40,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198069035] [2021-11-20 23:15:40,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:40,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:15:40,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:15:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:15:40,923 INFO L87 Difference]: Start difference. First operand 3546 states and 11515 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:43,056 INFO L93 Difference]: Finished difference Result 7016 states and 23302 transitions. [2021-11-20 23:15:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 23:15:43,057 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:43,074 INFO L225 Difference]: With dead ends: 7016 [2021-11-20 23:15:43,074 INFO L226 Difference]: Without dead ends: 7016 [2021-11-20 23:15:43,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:15:43,075 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 296 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:43,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 92 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-20 23:15:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2021-11-20 23:15:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 3552. [2021-11-20 23:15:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3552 states, 3548 states have (on average 3.2508455467869224) internal successors, (11534), 3551 states have internal predecessors, (11534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 11534 transitions. [2021-11-20 23:15:43,156 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 11534 transitions. Word has length 27 [2021-11-20 23:15:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:43,156 INFO L470 AbstractCegarLoop]: Abstraction has 3552 states and 11534 transitions. [2021-11-20 23:15:43,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 11534 transitions. [2021-11-20 23:15:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:15:43,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:43,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:43,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-20 23:15:43,160 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1166751201, now seen corresponding path program 7 times [2021-11-20 23:15:43,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:43,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50297233] [2021-11-20 23:15:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:43,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:43,838 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:43,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50297233] [2021-11-20 23:15:43,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50297233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:43,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:43,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 23:15:43,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226880593] [2021-11-20 23:15:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:43,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 23:15:43,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:43,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 23:15:43,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-20 23:15:43,840 INFO L87 Difference]: Start difference. First operand 3552 states and 11534 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:45,628 INFO L93 Difference]: Finished difference Result 5074 states and 16682 transitions. [2021-11-20 23:15:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:15:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:15:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:45,638 INFO L225 Difference]: With dead ends: 5074 [2021-11-20 23:15:45,639 INFO L226 Difference]: Without dead ends: 5074 [2021-11-20 23:15:45,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:15:45,639 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 322 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:45,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 87 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2247 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 23:15:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2021-11-20 23:15:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 3352. [2021-11-20 23:15:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3348 states have (on average 3.259856630824373) internal successors, (10914), 3351 states have internal predecessors, (10914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 10914 transitions. [2021-11-20 23:15:45,706 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 10914 transitions. Word has length 27 [2021-11-20 23:15:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:45,706 INFO L470 AbstractCegarLoop]: Abstraction has 3352 states and 10914 transitions. [2021-11-20 23:15:45,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 10914 transitions. [2021-11-20 23:15:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 23:15:45,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:45,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:45,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-20 23:15:45,710 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -536695196, now seen corresponding path program 1 times [2021-11-20 23:15:45,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:45,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621052099] [2021-11-20 23:15:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:45,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:46,033 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:46,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621052099] [2021-11-20 23:15:46,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621052099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:46,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:46,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 23:15:46,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905466678] [2021-11-20 23:15:46,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:46,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 23:15:46,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:46,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 23:15:46,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:15:46,035 INFO L87 Difference]: Start difference. First operand 3352 states and 10914 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:47,168 INFO L93 Difference]: Finished difference Result 9472 states and 31200 transitions. [2021-11-20 23:15:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:15:47,169 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 23:15:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:47,189 INFO L225 Difference]: With dead ends: 9472 [2021-11-20 23:15:47,189 INFO L226 Difference]: Without dead ends: 9472 [2021-11-20 23:15:47,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2021-11-20 23:15:47,190 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 340 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:47,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 26 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 23:15:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2021-11-20 23:15:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 7470. [2021-11-20 23:15:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7470 states, 7466 states have (on average 3.360835788909724) internal successors, (25092), 7469 states have internal predecessors, (25092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 25092 transitions. [2021-11-20 23:15:47,359 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 25092 transitions. Word has length 30 [2021-11-20 23:15:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:47,359 INFO L470 AbstractCegarLoop]: Abstraction has 7470 states and 25092 transitions. [2021-11-20 23:15:47,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 25092 transitions. [2021-11-20 23:15:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 23:15:47,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:47,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:47,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-20 23:15:47,367 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:47,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1700971848, now seen corresponding path program 1 times [2021-11-20 23:15:47,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:47,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908550452] [2021-11-20 23:15:47,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:47,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:47,696 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:47,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908550452] [2021-11-20 23:15:47,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908550452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:47,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:47,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 23:15:47,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901890587] [2021-11-20 23:15:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:47,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:15:47,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:47,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:15:47,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-20 23:15:47,698 INFO L87 Difference]: Start difference. First operand 7470 states and 25092 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:49,038 INFO L93 Difference]: Finished difference Result 12164 states and 40772 transitions. [2021-11-20 23:15:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:15:49,039 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 23:15:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:49,063 INFO L225 Difference]: With dead ends: 12164 [2021-11-20 23:15:49,063 INFO L226 Difference]: Without dead ends: 12164 [2021-11-20 23:15:49,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-11-20 23:15:49,066 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 325 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:49,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 36 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-20 23:15:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12164 states. [2021-11-20 23:15:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12164 to 9302. [2021-11-20 23:15:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9302 states, 9298 states have (on average 3.3738438373843835) internal successors, (31370), 9301 states have internal predecessors, (31370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9302 states to 9302 states and 31370 transitions. [2021-11-20 23:15:49,254 INFO L78 Accepts]: Start accepts. Automaton has 9302 states and 31370 transitions. Word has length 30 [2021-11-20 23:15:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:49,255 INFO L470 AbstractCegarLoop]: Abstraction has 9302 states and 31370 transitions. [2021-11-20 23:15:49,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 9302 states and 31370 transitions. [2021-11-20 23:15:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 23:15:49,264 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:49,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:49,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-20 23:15:49,264 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash -981490814, now seen corresponding path program 2 times [2021-11-20 23:15:49,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:49,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981127557] [2021-11-20 23:15:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:49,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:49,504 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981127557] [2021-11-20 23:15:49,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981127557] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:49,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:49,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-20 23:15:49,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937941758] [2021-11-20 23:15:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:49,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 23:15:49,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:49,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 23:15:49,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:15:49,506 INFO L87 Difference]: Start difference. First operand 9302 states and 31370 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:50,730 INFO L93 Difference]: Finished difference Result 16084 states and 53591 transitions. [2021-11-20 23:15:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:15:50,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 23:15:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:50,768 INFO L225 Difference]: With dead ends: 16084 [2021-11-20 23:15:50,769 INFO L226 Difference]: Without dead ends: 16084 [2021-11-20 23:15:50,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-11-20 23:15:50,770 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 497 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:50,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 45 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 23:15:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2021-11-20 23:15:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 9030. [2021-11-20 23:15:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9030 states, 9026 states have (on average 3.3516507866164416) internal successors, (30252), 9029 states have internal predecessors, (30252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9030 states to 9030 states and 30252 transitions. [2021-11-20 23:15:51,058 INFO L78 Accepts]: Start accepts. Automaton has 9030 states and 30252 transitions. Word has length 30 [2021-11-20 23:15:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:51,059 INFO L470 AbstractCegarLoop]: Abstraction has 9030 states and 30252 transitions. [2021-11-20 23:15:51,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 9030 states and 30252 transitions. [2021-11-20 23:15:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 23:15:51,070 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:51,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:51,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-20 23:15:51,071 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -432366582, now seen corresponding path program 3 times [2021-11-20 23:15:51,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:51,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214248566] [2021-11-20 23:15:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:51,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:51,318 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:51,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214248566] [2021-11-20 23:15:51,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214248566] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:51,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:51,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-20 23:15:51,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269834825] [2021-11-20 23:15:51,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:51,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 23:15:51,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:51,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 23:15:51,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:15:51,320 INFO L87 Difference]: Start difference. First operand 9030 states and 30252 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:52,896 INFO L93 Difference]: Finished difference Result 16030 states and 53672 transitions. [2021-11-20 23:15:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 23:15:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 23:15:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:52,933 INFO L225 Difference]: With dead ends: 16030 [2021-11-20 23:15:52,934 INFO L226 Difference]: Without dead ends: 16030 [2021-11-20 23:15:52,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:15:52,934 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 462 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:52,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 79 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-20 23:15:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16030 states. [2021-11-20 23:15:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16030 to 7370. [2021-11-20 23:15:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7370 states, 7366 states have (on average 3.3351887048601685) internal successors, (24567), 7369 states have internal predecessors, (24567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 24567 transitions. [2021-11-20 23:15:53,222 INFO L78 Accepts]: Start accepts. Automaton has 7370 states and 24567 transitions. Word has length 30 [2021-11-20 23:15:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:53,223 INFO L470 AbstractCegarLoop]: Abstraction has 7370 states and 24567 transitions. [2021-11-20 23:15:53,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7370 states and 24567 transitions. [2021-11-20 23:15:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 23:15:53,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:53,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:53,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-20 23:15:53,233 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:53,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1253284098, now seen corresponding path program 2 times [2021-11-20 23:15:53,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:53,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405251520] [2021-11-20 23:15:53,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:53,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:53,516 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:53,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405251520] [2021-11-20 23:15:53,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405251520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:53,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:53,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 23:15:53,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211647046] [2021-11-20 23:15:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:53,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 23:15:53,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:53,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 23:15:53,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:15:53,518 INFO L87 Difference]: Start difference. First operand 7370 states and 24567 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:54,573 INFO L93 Difference]: Finished difference Result 14448 states and 48158 transitions. [2021-11-20 23:15:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:15:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 23:15:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:54,606 INFO L225 Difference]: With dead ends: 14448 [2021-11-20 23:15:54,606 INFO L226 Difference]: Without dead ends: 14448 [2021-11-20 23:15:54,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:15:54,607 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 421 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:54,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 43 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-20 23:15:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14448 states. [2021-11-20 23:15:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14448 to 8808. [2021-11-20 23:15:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8808 states, 8804 states have (on average 3.3910722398909585) internal successors, (29855), 8807 states have internal predecessors, (29855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8808 states to 8808 states and 29855 transitions. [2021-11-20 23:15:54,787 INFO L78 Accepts]: Start accepts. Automaton has 8808 states and 29855 transitions. Word has length 30 [2021-11-20 23:15:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:54,788 INFO L470 AbstractCegarLoop]: Abstraction has 8808 states and 29855 transitions. [2021-11-20 23:15:54,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8808 states and 29855 transitions. [2021-11-20 23:15:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 23:15:54,797 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:54,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:54,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-20 23:15:54,798 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash 793743864, now seen corresponding path program 3 times [2021-11-20 23:15:54,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:54,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827555923] [2021-11-20 23:15:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:54,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:55,083 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:55,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827555923] [2021-11-20 23:15:55,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827555923] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:55,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:55,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 23:15:55,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969844321] [2021-11-20 23:15:55,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:55,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 23:15:55,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:55,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 23:15:55,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:15:55,084 INFO L87 Difference]: Start difference. First operand 8808 states and 29855 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:56,511 INFO L93 Difference]: Finished difference Result 15696 states and 52460 transitions. [2021-11-20 23:15:56,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 23:15:56,512 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 23:15:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:56,549 INFO L225 Difference]: With dead ends: 15696 [2021-11-20 23:15:56,549 INFO L226 Difference]: Without dead ends: 15696 [2021-11-20 23:15:56,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:15:56,550 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 422 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:56,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 77 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-20 23:15:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15696 states. [2021-11-20 23:15:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15696 to 8868. [2021-11-20 23:15:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8868 states, 8864 states have (on average 3.393614620938628) internal successors, (30081), 8867 states have internal predecessors, (30081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8868 states to 8868 states and 30081 transitions. [2021-11-20 23:15:56,754 INFO L78 Accepts]: Start accepts. Automaton has 8868 states and 30081 transitions. Word has length 30 [2021-11-20 23:15:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:56,754 INFO L470 AbstractCegarLoop]: Abstraction has 8868 states and 30081 transitions. [2021-11-20 23:15:56,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8868 states and 30081 transitions. [2021-11-20 23:15:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 23:15:56,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:56,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:56,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-20 23:15:56,764 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash 335133258, now seen corresponding path program 4 times [2021-11-20 23:15:56,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:56,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005800660] [2021-11-20 23:15:56,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:56,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:57,032 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:57,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005800660] [2021-11-20 23:15:57,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005800660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:57,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:57,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 23:15:57,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857934804] [2021-11-20 23:15:57,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:57,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 23:15:57,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:57,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 23:15:57,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-20 23:15:57,034 INFO L87 Difference]: Start difference. First operand 8868 states and 30081 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:58,989 INFO L93 Difference]: Finished difference Result 16296 states and 54962 transitions. [2021-11-20 23:15:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 23:15:58,989 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-20 23:15:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:59,029 INFO L225 Difference]: With dead ends: 16296 [2021-11-20 23:15:59,029 INFO L226 Difference]: Without dead ends: 16296 [2021-11-20 23:15:59,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2021-11-20 23:15:59,030 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 452 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:59,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 117 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-20 23:15:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16296 states. [2021-11-20 23:15:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16296 to 8016. [2021-11-20 23:15:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8016 states, 8012 states have (on average 3.4146280579131303) internal successors, (27358), 8015 states have internal predecessors, (27358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8016 states to 8016 states and 27358 transitions. [2021-11-20 23:15:59,237 INFO L78 Accepts]: Start accepts. Automaton has 8016 states and 27358 transitions. Word has length 30 [2021-11-20 23:15:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:59,238 INFO L470 AbstractCegarLoop]: Abstraction has 8016 states and 27358 transitions. [2021-11-20 23:15:59,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8016 states and 27358 transitions. [2021-11-20 23:15:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:15:59,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:59,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:59,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-20 23:15:59,250 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:15:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:59,251 INFO L85 PathProgramCache]: Analyzing trace with hash 847172721, now seen corresponding path program 1 times [2021-11-20 23:15:59,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:59,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300967332] [2021-11-20 23:15:59,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:59,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:59,961 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:59,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300967332] [2021-11-20 23:15:59,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300967332] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:59,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:59,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:15:59,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473677345] [2021-11-20 23:15:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:59,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:15:59,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:15:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:15:59,963 INFO L87 Difference]: Start difference. First operand 8016 states and 27358 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:02,953 INFO L93 Difference]: Finished difference Result 10970 states and 37091 transitions. [2021-11-20 23:16:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-20 23:16:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:02,987 INFO L225 Difference]: With dead ends: 10970 [2021-11-20 23:16:02,987 INFO L226 Difference]: Without dead ends: 10970 [2021-11-20 23:16:02,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=259, Invalid=1147, Unknown=0, NotChecked=0, Total=1406 [2021-11-20 23:16:02,989 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 382 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 3230 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:02,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 127 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3230 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-20 23:16:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10970 states. [2021-11-20 23:16:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10970 to 8598. [2021-11-20 23:16:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8598 states, 8594 states have (on average 3.4044682336513845) internal successors, (29258), 8597 states have internal predecessors, (29258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8598 states to 8598 states and 29258 transitions. [2021-11-20 23:16:03,163 INFO L78 Accepts]: Start accepts. Automaton has 8598 states and 29258 transitions. Word has length 31 [2021-11-20 23:16:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:03,163 INFO L470 AbstractCegarLoop]: Abstraction has 8598 states and 29258 transitions. [2021-11-20 23:16:03,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 8598 states and 29258 transitions. [2021-11-20 23:16:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:03,173 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:03,173 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:03,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-20 23:16:03,174 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash 847172712, now seen corresponding path program 1 times [2021-11-20 23:16:03,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:03,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220764070] [2021-11-20 23:16:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:03,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:03,780 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:03,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220764070] [2021-11-20 23:16:03,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220764070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:03,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:03,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-20 23:16:03,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527476628] [2021-11-20 23:16:03,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:03,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 23:16:03,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 23:16:03,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:16:03,782 INFO L87 Difference]: Start difference. First operand 8598 states and 29258 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:06,621 INFO L93 Difference]: Finished difference Result 10906 states and 36867 transitions. [2021-11-20 23:16:06,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 23:16:06,622 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:06,644 INFO L225 Difference]: With dead ends: 10906 [2021-11-20 23:16:06,644 INFO L226 Difference]: Without dead ends: 10906 [2021-11-20 23:16:06,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 23:16:06,645 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 377 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:06,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 117 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-20 23:16:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10906 states. [2021-11-20 23:16:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10906 to 8470. [2021-11-20 23:16:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8470 states, 8466 states have (on average 3.399244034963383) internal successors, (28778), 8469 states have internal predecessors, (28778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8470 states to 8470 states and 28778 transitions. [2021-11-20 23:16:06,795 INFO L78 Accepts]: Start accepts. Automaton has 8470 states and 28778 transitions. Word has length 31 [2021-11-20 23:16:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:06,795 INFO L470 AbstractCegarLoop]: Abstraction has 8470 states and 28778 transitions. [2021-11-20 23:16:06,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8470 states and 28778 transitions. [2021-11-20 23:16:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:06,803 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:06,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:06,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-20 23:16:06,803 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -784773137, now seen corresponding path program 2 times [2021-11-20 23:16:06,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:06,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890927501] [2021-11-20 23:16:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:06,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:07,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:07,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890927501] [2021-11-20 23:16:07,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890927501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:07,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:07,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-20 23:16:07,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803892916] [2021-11-20 23:16:07,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:07,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:16:07,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:07,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:16:07,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:16:07,494 INFO L87 Difference]: Start difference. First operand 8470 states and 28778 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:13,126 INFO L93 Difference]: Finished difference Result 9737 states and 32700 transitions. [2021-11-20 23:16:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-20 23:16:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:13,145 INFO L225 Difference]: With dead ends: 9737 [2021-11-20 23:16:13,146 INFO L226 Difference]: Without dead ends: 9669 [2021-11-20 23:16:13,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=834, Invalid=2472, Unknown=0, NotChecked=0, Total=3306 [2021-11-20 23:16:13,147 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 319 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:13,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 99 Invalid, 3415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3309 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-20 23:16:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9669 states. [2021-11-20 23:16:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9669 to 8650. [2021-11-20 23:16:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8650 states, 8646 states have (on average 3.3909322229932917) internal successors, (29318), 8649 states have internal predecessors, (29318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 29318 transitions. [2021-11-20 23:16:13,295 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 29318 transitions. Word has length 31 [2021-11-20 23:16:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:13,295 INFO L470 AbstractCegarLoop]: Abstraction has 8650 states and 29318 transitions. [2021-11-20 23:16:13,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 29318 transitions. [2021-11-20 23:16:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:13,304 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:13,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:13,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-20 23:16:13,304 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:13,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:13,305 INFO L85 PathProgramCache]: Analyzing trace with hash 542321165, now seen corresponding path program 1 times [2021-11-20 23:16:13,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:13,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647446019] [2021-11-20 23:16:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:13,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:14,203 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:14,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647446019] [2021-11-20 23:16:14,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647446019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:14,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:14,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-20 23:16:14,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579235031] [2021-11-20 23:16:14,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:14,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 23:16:14,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 23:16:14,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:16:14,205 INFO L87 Difference]: Start difference. First operand 8650 states and 29318 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:16,393 INFO L93 Difference]: Finished difference Result 10138 states and 34147 transitions. [2021-11-20 23:16:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 23:16:16,394 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:16,414 INFO L225 Difference]: With dead ends: 10138 [2021-11-20 23:16:16,414 INFO L226 Difference]: Without dead ends: 10138 [2021-11-20 23:16:16,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:16:16,415 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 304 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:16,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 66 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2811 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-20 23:16:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10138 states. [2021-11-20 23:16:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10138 to 10032. [2021-11-20 23:16:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10032 states, 10028 states have (on average 3.3769445552453132) internal successors, (33864), 10031 states have internal predecessors, (33864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10032 states to 10032 states and 33864 transitions. [2021-11-20 23:16:16,585 INFO L78 Accepts]: Start accepts. Automaton has 10032 states and 33864 transitions. Word has length 31 [2021-11-20 23:16:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:16,585 INFO L470 AbstractCegarLoop]: Abstraction has 10032 states and 33864 transitions. [2021-11-20 23:16:16,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 10032 states and 33864 transitions. [2021-11-20 23:16:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:16,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:16,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:16,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-20 23:16:16,595 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2067976577, now seen corresponding path program 3 times [2021-11-20 23:16:16,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:16,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590143631] [2021-11-20 23:16:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:16,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:17,287 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:17,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590143631] [2021-11-20 23:16:17,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590143631] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:17,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:17,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:16:17,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231916722] [2021-11-20 23:16:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:17,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:16:17,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:17,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:16:17,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:16:17,289 INFO L87 Difference]: Start difference. First operand 10032 states and 33864 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:20,305 INFO L93 Difference]: Finished difference Result 13072 states and 43930 transitions. [2021-11-20 23:16:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-20 23:16:20,305 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:20,332 INFO L225 Difference]: With dead ends: 13072 [2021-11-20 23:16:20,333 INFO L226 Difference]: Without dead ends: 13072 [2021-11-20 23:16:20,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=266, Invalid=1140, Unknown=0, NotChecked=0, Total=1406 [2021-11-20 23:16:20,334 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 352 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:20,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 122 Invalid, 3317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3274 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-20 23:16:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13072 states. [2021-11-20 23:16:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13072 to 10564. [2021-11-20 23:16:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10564 states, 10560 states have (on average 3.372537878787879) internal successors, (35614), 10563 states have internal predecessors, (35614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10564 states to 10564 states and 35614 transitions. [2021-11-20 23:16:20,518 INFO L78 Accepts]: Start accepts. Automaton has 10564 states and 35614 transitions. Word has length 31 [2021-11-20 23:16:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:20,519 INFO L470 AbstractCegarLoop]: Abstraction has 10564 states and 35614 transitions. [2021-11-20 23:16:20,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 10564 states and 35614 transitions. [2021-11-20 23:16:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:20,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:20,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:20,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-20 23:16:20,530 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2067976568, now seen corresponding path program 2 times [2021-11-20 23:16:20,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:20,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227752979] [2021-11-20 23:16:20,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:20,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:21,083 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:21,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227752979] [2021-11-20 23:16:21,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227752979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:21,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:21,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-20 23:16:21,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266713718] [2021-11-20 23:16:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:21,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 23:16:21,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 23:16:21,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:16:21,085 INFO L87 Difference]: Start difference. First operand 10564 states and 35614 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:24,001 INFO L93 Difference]: Finished difference Result 13008 states and 43706 transitions. [2021-11-20 23:16:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 23:16:24,002 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:24,029 INFO L225 Difference]: With dead ends: 13008 [2021-11-20 23:16:24,029 INFO L226 Difference]: Without dead ends: 13008 [2021-11-20 23:16:24,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2021-11-20 23:16:24,030 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 322 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 3250 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:24,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 115 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3250 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-20 23:16:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13008 states. [2021-11-20 23:16:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13008 to 10072. [2021-11-20 23:16:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10072 states, 10068 states have (on average 3.3754469606674613) internal successors, (33984), 10071 states have internal predecessors, (33984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10072 states to 10072 states and 33984 transitions. [2021-11-20 23:16:24,214 INFO L78 Accepts]: Start accepts. Automaton has 10072 states and 33984 transitions. Word has length 31 [2021-11-20 23:16:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:24,215 INFO L470 AbstractCegarLoop]: Abstraction has 10072 states and 33984 transitions. [2021-11-20 23:16:24,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 10072 states and 33984 transitions. [2021-11-20 23:16:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:24,224 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:24,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:24,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-20 23:16:24,224 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 436030719, now seen corresponding path program 4 times [2021-11-20 23:16:24,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:24,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460075221] [2021-11-20 23:16:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:24,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:24,916 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:24,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460075221] [2021-11-20 23:16:24,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460075221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:24,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:24,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-20 23:16:24,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841714005] [2021-11-20 23:16:24,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:24,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:16:24,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:24,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:16:24,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:16:24,918 INFO L87 Difference]: Start difference. First operand 10072 states and 33984 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:32,358 INFO L93 Difference]: Finished difference Result 11671 states and 38895 transitions. [2021-11-20 23:16:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-20 23:16:32,358 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:32,381 INFO L225 Difference]: With dead ends: 11671 [2021-11-20 23:16:32,382 INFO L226 Difference]: Without dead ends: 11599 [2021-11-20 23:16:32,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1204, Invalid=3626, Unknown=0, NotChecked=0, Total=4830 [2021-11-20 23:16:32,383 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 287 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 3696 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:32,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 134 Invalid, 3795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3696 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-20 23:16:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11599 states. [2021-11-20 23:16:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11599 to 10352. [2021-11-20 23:16:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10352 states, 10348 states have (on average 3.365287978353305) internal successors, (34824), 10351 states have internal predecessors, (34824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10352 states to 10352 states and 34824 transitions. [2021-11-20 23:16:32,565 INFO L78 Accepts]: Start accepts. Automaton has 10352 states and 34824 transitions. Word has length 31 [2021-11-20 23:16:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:32,565 INFO L470 AbstractCegarLoop]: Abstraction has 10352 states and 34824 transitions. [2021-11-20 23:16:32,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10352 states and 34824 transitions. [2021-11-20 23:16:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:32,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:32,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:32,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-20 23:16:32,577 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:32,577 INFO L85 PathProgramCache]: Analyzing trace with hash 261398979, now seen corresponding path program 5 times [2021-11-20 23:16:32,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:32,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798331333] [2021-11-20 23:16:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:32,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:33,143 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:33,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798331333] [2021-11-20 23:16:33,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798331333] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:33,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:33,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:16:33,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043568011] [2021-11-20 23:16:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:33,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 23:16:33,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 23:16:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:16:33,147 INFO L87 Difference]: Start difference. First operand 10352 states and 34824 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:39,978 INFO L93 Difference]: Finished difference Result 11755 states and 39169 transitions. [2021-11-20 23:16:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-20 23:16:39,978 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:40,074 INFO L225 Difference]: With dead ends: 11755 [2021-11-20 23:16:40,074 INFO L226 Difference]: Without dead ends: 11687 [2021-11-20 23:16:40,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2021-11-20 23:16:40,076 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 308 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 3902 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:40,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 144 Invalid, 3986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3902 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-20 23:16:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11687 states. [2021-11-20 23:16:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11687 to 10672. [2021-11-20 23:16:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10672 states, 10668 states have (on average 3.359955005624297) internal successors, (35844), 10671 states have internal predecessors, (35844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10672 states to 10672 states and 35844 transitions. [2021-11-20 23:16:40,247 INFO L78 Accepts]: Start accepts. Automaton has 10672 states and 35844 transitions. Word has length 31 [2021-11-20 23:16:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:40,247 INFO L470 AbstractCegarLoop]: Abstraction has 10672 states and 35844 transitions. [2021-11-20 23:16:40,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 10672 states and 35844 transitions. [2021-11-20 23:16:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:40,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:40,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:40,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-20 23:16:40,260 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:40,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1190522793, now seen corresponding path program 1 times [2021-11-20 23:16:40,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:40,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411294088] [2021-11-20 23:16:40,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:40,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:41,227 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:41,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411294088] [2021-11-20 23:16:41,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411294088] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:41,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:41,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:16:41,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968805410] [2021-11-20 23:16:41,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:41,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:16:41,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:41,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:16:41,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:16:41,229 INFO L87 Difference]: Start difference. First operand 10672 states and 35844 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:44,110 INFO L93 Difference]: Finished difference Result 11740 states and 39373 transitions. [2021-11-20 23:16:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 23:16:44,110 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:44,135 INFO L225 Difference]: With dead ends: 11740 [2021-11-20 23:16:44,135 INFO L226 Difference]: Without dead ends: 11740 [2021-11-20 23:16:44,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-20 23:16:44,137 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 385 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 3256 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:44,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 83 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3256 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-20 23:16:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11740 states. [2021-11-20 23:16:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11740 to 11390. [2021-11-20 23:16:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11390 states, 11386 states have (on average 3.3607061303354997) internal successors, (38265), 11389 states have internal predecessors, (38265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11390 states to 11390 states and 38265 transitions. [2021-11-20 23:16:44,347 INFO L78 Accepts]: Start accepts. Automaton has 11390 states and 38265 transitions. Word has length 31 [2021-11-20 23:16:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:44,348 INFO L470 AbstractCegarLoop]: Abstraction has 11390 states and 38265 transitions. [2021-11-20 23:16:44,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 11390 states and 38265 transitions. [2021-11-20 23:16:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:44,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:44,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:44,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-20 23:16:44,360 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:44,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:44,361 INFO L85 PathProgramCache]: Analyzing trace with hash -955509683, now seen corresponding path program 6 times [2021-11-20 23:16:44,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:44,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039874254] [2021-11-20 23:16:44,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:44,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:45,070 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:45,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039874254] [2021-11-20 23:16:45,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039874254] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:45,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:45,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-20 23:16:45,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409234071] [2021-11-20 23:16:45,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:45,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:16:45,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:45,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:16:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:16:45,071 INFO L87 Difference]: Start difference. First operand 11390 states and 38265 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:54,192 INFO L93 Difference]: Finished difference Result 14067 states and 46462 transitions. [2021-11-20 23:16:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-20 23:16:54,192 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:54,224 INFO L225 Difference]: With dead ends: 14067 [2021-11-20 23:16:54,224 INFO L226 Difference]: Without dead ends: 13999 [2021-11-20 23:16:54,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2019, Invalid=6537, Unknown=0, NotChecked=0, Total=8556 [2021-11-20 23:16:54,227 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 398 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 4528 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 4626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:54,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 190 Invalid, 4626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4528 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-20 23:16:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13999 states. [2021-11-20 23:16:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13999 to 11900. [2021-11-20 23:16:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11900 states, 11896 states have (on average 3.348604572965703) internal successors, (39835), 11899 states have internal predecessors, (39835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11900 states to 11900 states and 39835 transitions. [2021-11-20 23:16:54,452 INFO L78 Accepts]: Start accepts. Automaton has 11900 states and 39835 transitions. Word has length 31 [2021-11-20 23:16:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:54,452 INFO L470 AbstractCegarLoop]: Abstraction has 11900 states and 39835 transitions. [2021-11-20 23:16:54,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 11900 states and 39835 transitions. [2021-11-20 23:16:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:54,466 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:54,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:54,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-20 23:16:54,466 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:54,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash -361441105, now seen corresponding path program 2 times [2021-11-20 23:16:54,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:54,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52948070] [2021-11-20 23:16:54,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:54,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:55,229 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:55,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52948070] [2021-11-20 23:16:55,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52948070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:55,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:55,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-20 23:16:55,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735809049] [2021-11-20 23:16:55,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:55,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 23:16:55,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:55,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 23:16:55,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:16:55,231 INFO L87 Difference]: Start difference. First operand 11900 states and 39835 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:57,544 INFO L93 Difference]: Finished difference Result 13268 states and 44304 transitions. [2021-11-20 23:16:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 23:16:57,544 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:16:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:57,658 INFO L225 Difference]: With dead ends: 13268 [2021-11-20 23:16:57,658 INFO L226 Difference]: Without dead ends: 13268 [2021-11-20 23:16:57,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:16:57,659 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 272 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:57,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 89 Invalid, 3426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-20 23:16:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13268 states. [2021-11-20 23:16:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13268 to 11750. [2021-11-20 23:16:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11750 states, 11746 states have (on average 3.3513536523071683) internal successors, (39365), 11749 states have internal predecessors, (39365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11750 states to 11750 states and 39365 transitions. [2021-11-20 23:16:57,874 INFO L78 Accepts]: Start accepts. Automaton has 11750 states and 39365 transitions. Word has length 31 [2021-11-20 23:16:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:57,874 INFO L470 AbstractCegarLoop]: Abstraction has 11750 states and 39365 transitions. [2021-11-20 23:16:57,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 11750 states and 39365 transitions. [2021-11-20 23:16:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:16:57,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:57,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:57,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-20 23:16:57,887 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:16:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1112527675, now seen corresponding path program 7 times [2021-11-20 23:16:57,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:57,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081612441] [2021-11-20 23:16:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:57,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:16:58,552 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:58,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081612441] [2021-11-20 23:16:58,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081612441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:16:58,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:16:58,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-20 23:16:58,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725558261] [2021-11-20 23:16:58,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:16:58,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 23:16:58,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:58,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 23:16:58,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-11-20 23:16:58,553 INFO L87 Difference]: Start difference. First operand 11750 states and 39365 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:07,823 INFO L93 Difference]: Finished difference Result 13935 states and 46066 transitions. [2021-11-20 23:17:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-20 23:17:07,823 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:17:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:07,851 INFO L225 Difference]: With dead ends: 13935 [2021-11-20 23:17:07,851 INFO L226 Difference]: Without dead ends: 13867 [2021-11-20 23:17:07,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1844, Invalid=5988, Unknown=0, NotChecked=0, Total=7832 [2021-11-20 23:17:07,858 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 302 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 5743 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 5840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 5743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:07,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 216 Invalid, 5840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 5743 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-11-20 23:17:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13867 states. [2021-11-20 23:17:08,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13867 to 12080. [2021-11-20 23:17:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12080 states, 12076 states have (on average 3.3434084133819146) internal successors, (40375), 12079 states have internal predecessors, (40375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12080 states to 12080 states and 40375 transitions. [2021-11-20 23:17:08,108 INFO L78 Accepts]: Start accepts. Automaton has 12080 states and 40375 transitions. Word has length 31 [2021-11-20 23:17:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:08,108 INFO L470 AbstractCegarLoop]: Abstraction has 12080 states and 40375 transitions. [2021-11-20 23:17:08,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 12080 states and 40375 transitions. [2021-11-20 23:17:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:17:08,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:08,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:08,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-20 23:17:08,121 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:17:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash -518459097, now seen corresponding path program 3 times [2021-11-20 23:17:08,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:08,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570642985] [2021-11-20 23:17:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:08,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:17:08,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:08,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570642985] [2021-11-20 23:17:08,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570642985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:17:08,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:17:08,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:17:08,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184049580] [2021-11-20 23:17:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:17:08,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:17:08,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:08,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:17:08,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:17:08,790 INFO L87 Difference]: Start difference. First operand 12080 states and 40375 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:11,395 INFO L93 Difference]: Finished difference Result 13298 states and 44394 transitions. [2021-11-20 23:17:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 23:17:11,395 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:17:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:11,423 INFO L225 Difference]: With dead ends: 13298 [2021-11-20 23:17:11,423 INFO L226 Difference]: Without dead ends: 13298 [2021-11-20 23:17:11,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2021-11-20 23:17:11,424 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 297 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 3602 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:11,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 100 Invalid, 3626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3602 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-20 23:17:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13298 states. [2021-11-20 23:17:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13298 to 11570. [2021-11-20 23:17:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11570 states, 11566 states have (on average 3.3568217188310565) internal successors, (38825), 11569 states have internal predecessors, (38825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11570 states to 11570 states and 38825 transitions. [2021-11-20 23:17:11,628 INFO L78 Accepts]: Start accepts. Automaton has 11570 states and 38825 transitions. Word has length 31 [2021-11-20 23:17:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:11,628 INFO L470 AbstractCegarLoop]: Abstraction has 11570 states and 38825 transitions. [2021-11-20 23:17:11,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 11570 states and 38825 transitions. [2021-11-20 23:17:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:17:11,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:11,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:11,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-20 23:17:11,640 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:17:11,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2014749307, now seen corresponding path program 8 times [2021-11-20 23:17:11,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:11,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58734130] [2021-11-20 23:17:11,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:11,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:17:12,334 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:12,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58734130] [2021-11-20 23:17:12,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58734130] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:17:12,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:17:12,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-20 23:17:12,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506723132] [2021-11-20 23:17:12,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:17:12,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:17:12,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:12,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:17:12,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:17:12,338 INFO L87 Difference]: Start difference. First operand 11570 states and 38825 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:19,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:19,180 INFO L93 Difference]: Finished difference Result 13583 states and 44988 transitions. [2021-11-20 23:17:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-20 23:17:19,180 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:17:19,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:19,208 INFO L225 Difference]: With dead ends: 13583 [2021-11-20 23:17:19,208 INFO L226 Difference]: Without dead ends: 13515 [2021-11-20 23:17:19,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1312, Invalid=4238, Unknown=0, NotChecked=0, Total=5550 [2021-11-20 23:17:19,209 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 306 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 4015 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 4113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:19,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 137 Invalid, 4113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4015 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-20 23:17:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13515 states. [2021-11-20 23:17:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13515 to 11720. [2021-11-20 23:17:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11720 states, 11716 states have (on average 3.353960396039604) internal successors, (39295), 11719 states have internal predecessors, (39295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11720 states to 11720 states and 39295 transitions. [2021-11-20 23:17:19,412 INFO L78 Accepts]: Start accepts. Automaton has 11720 states and 39295 transitions. Word has length 31 [2021-11-20 23:17:19,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:19,412 INFO L470 AbstractCegarLoop]: Abstraction has 11720 states and 39295 transitions. [2021-11-20 23:17:19,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11720 states and 39295 transitions. [2021-11-20 23:17:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:17:19,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:19,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:19,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-20 23:17:19,424 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:17:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1686149411, now seen corresponding path program 4 times [2021-11-20 23:17:19,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:19,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218203749] [2021-11-20 23:17:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:19,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:17:20,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:20,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218203749] [2021-11-20 23:17:20,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218203749] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:17:20,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:17:20,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-20 23:17:20,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805972710] [2021-11-20 23:17:20,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:17:20,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 23:17:20,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:20,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 23:17:20,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:17:20,170 INFO L87 Difference]: Start difference. First operand 11720 states and 39295 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:22,334 INFO L93 Difference]: Finished difference Result 12788 states and 42824 transitions. [2021-11-20 23:17:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 23:17:22,334 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:17:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:22,362 INFO L225 Difference]: With dead ends: 12788 [2021-11-20 23:17:22,363 INFO L226 Difference]: Without dead ends: 12788 [2021-11-20 23:17:22,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:17:22,363 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 300 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 3031 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 3056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:22,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 80 Invalid, 3056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3031 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-20 23:17:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12788 states. [2021-11-20 23:17:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12788 to 11400. [2021-11-20 23:17:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11400 states, 11396 states have (on average 3.358634608634609) internal successors, (38275), 11399 states have internal predecessors, (38275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11400 states to 11400 states and 38275 transitions. [2021-11-20 23:17:22,567 INFO L78 Accepts]: Start accepts. Automaton has 11400 states and 38275 transitions. Word has length 31 [2021-11-20 23:17:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:22,567 INFO L470 AbstractCegarLoop]: Abstraction has 11400 states and 38275 transitions. [2021-11-20 23:17:22,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 11400 states and 38275 transitions. [2021-11-20 23:17:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:17:22,579 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:22,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:22,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-20 23:17:22,579 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:17:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash 900882487, now seen corresponding path program 9 times [2021-11-20 23:17:22,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:22,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994058579] [2021-11-20 23:17:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:22,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:17:23,202 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:23,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994058579] [2021-11-20 23:17:23,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994058579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:17:23,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:17:23,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-20 23:17:23,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390829533] [2021-11-20 23:17:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:17:23,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:17:23,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:23,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:17:23,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:17:23,203 INFO L87 Difference]: Start difference. First operand 11400 states and 38275 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:35,770 INFO L93 Difference]: Finished difference Result 14175 states and 46706 transitions. [2021-11-20 23:17:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-11-20 23:17:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:17:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:35,797 INFO L225 Difference]: With dead ends: 14175 [2021-11-20 23:17:35,798 INFO L226 Difference]: Without dead ends: 14087 [2021-11-20 23:17:35,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4045 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=3098, Invalid=11908, Unknown=0, NotChecked=0, Total=15006 [2021-11-20 23:17:35,799 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 395 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 6206 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 6312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 6206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:35,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 260 Invalid, 6312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 6206 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-11-20 23:17:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14087 states. [2021-11-20 23:17:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14087 to 11530. [2021-11-20 23:17:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11530 states, 11526 states have (on average 3.356324830817283) internal successors, (38685), 11529 states have internal predecessors, (38685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11530 states to 11530 states and 38685 transitions. [2021-11-20 23:17:35,996 INFO L78 Accepts]: Start accepts. Automaton has 11530 states and 38685 transitions. Word has length 31 [2021-11-20 23:17:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:35,997 INFO L470 AbstractCegarLoop]: Abstraction has 11530 states and 38685 transitions. [2021-11-20 23:17:35,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11530 states and 38685 transitions. [2021-11-20 23:17:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:17:36,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:36,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:36,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-20 23:17:36,009 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:17:36,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash -44988815, now seen corresponding path program 10 times [2021-11-20 23:17:36,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:36,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403993400] [2021-11-20 23:17:36,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:36,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:17:36,699 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:36,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403993400] [2021-11-20 23:17:36,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403993400] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:17:36,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:17:36,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-20 23:17:36,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796488679] [2021-11-20 23:17:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:17:36,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:17:36,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:36,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:17:36,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:17:36,700 INFO L87 Difference]: Start difference. First operand 11530 states and 38685 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:43,923 INFO L93 Difference]: Finished difference Result 13819 states and 45696 transitions. [2021-11-20 23:17:43,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-20 23:17:43,923 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:17:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:43,953 INFO L225 Difference]: With dead ends: 13819 [2021-11-20 23:17:43,953 INFO L226 Difference]: Without dead ends: 13751 [2021-11-20 23:17:43,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1366, Invalid=4486, Unknown=0, NotChecked=0, Total=5852 [2021-11-20 23:17:43,955 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 384 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 4372 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 4484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 4372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:43,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 151 Invalid, 4484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 4372 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-20 23:17:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13751 states. [2021-11-20 23:17:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13751 to 11531. [2021-11-20 23:17:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11531 states, 11527 states have (on average 3.356293918625835) internal successors, (38688), 11530 states have internal predecessors, (38688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11531 states to 11531 states and 38688 transitions. [2021-11-20 23:17:44,193 INFO L78 Accepts]: Start accepts. Automaton has 11531 states and 38688 transitions. Word has length 31 [2021-11-20 23:17:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:44,193 INFO L470 AbstractCegarLoop]: Abstraction has 11531 states and 38688 transitions. [2021-11-20 23:17:44,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 11531 states and 38688 transitions. [2021-11-20 23:17:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:17:44,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:44,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:44,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-11-20 23:17:44,205 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:17:44,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1605977919, now seen corresponding path program 11 times [2021-11-20 23:17:44,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:44,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170262465] [2021-11-20 23:17:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:44,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:17:45,019 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:45,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170262465] [2021-11-20 23:17:45,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170262465] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:17:45,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:17:45,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-20 23:17:45,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526024926] [2021-11-20 23:17:45,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:17:45,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:17:45,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:17:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:17:45,020 INFO L87 Difference]: Start difference. First operand 11531 states and 38688 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:59,855 INFO L93 Difference]: Finished difference Result 14264 states and 46973 transitions. [2021-11-20 23:17:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2021-11-20 23:17:59,855 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:17:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:59,884 INFO L225 Difference]: With dead ends: 14264 [2021-11-20 23:17:59,884 INFO L226 Difference]: Without dead ends: 14176 [2021-11-20 23:17:59,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4445 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3550, Invalid=14006, Unknown=0, NotChecked=0, Total=17556 [2021-11-20 23:17:59,887 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 333 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 7601 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 7688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 7601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:59,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 337 Invalid, 7688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 7601 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-11-20 23:17:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14176 states. [2021-11-20 23:18:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14176 to 11430. [2021-11-20 23:18:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11430 states, 11426 states have (on average 3.3559425870820934) internal successors, (38345), 11429 states have internal predecessors, (38345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11430 states to 11430 states and 38345 transitions. [2021-11-20 23:18:00,099 INFO L78 Accepts]: Start accepts. Automaton has 11430 states and 38345 transitions. Word has length 31 [2021-11-20 23:18:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:00,099 INFO L470 AbstractCegarLoop]: Abstraction has 11430 states and 38345 transitions. [2021-11-20 23:18:00,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 11430 states and 38345 transitions. [2021-11-20 23:18:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:18:00,111 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:00,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:00,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-20 23:18:00,111 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:18:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:00,112 INFO L85 PathProgramCache]: Analyzing trace with hash 259335471, now seen corresponding path program 12 times [2021-11-20 23:18:00,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:00,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766598770] [2021-11-20 23:18:00,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:00,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:00,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:00,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766598770] [2021-11-20 23:18:00,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766598770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:18:00,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:18:00,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-20 23:18:00,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206845654] [2021-11-20 23:18:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:00,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:18:00,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:00,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:18:00,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:18:00,790 INFO L87 Difference]: Start difference. First operand 11430 states and 38345 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:18,129 INFO L93 Difference]: Finished difference Result 13746 states and 45397 transitions. [2021-11-20 23:18:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-11-20 23:18:18,130 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:18:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:18,155 INFO L225 Difference]: With dead ends: 13746 [2021-11-20 23:18:18,155 INFO L226 Difference]: Without dead ends: 13658 [2021-11-20 23:18:18,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5313 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=4000, Invalid=16306, Unknown=0, NotChecked=0, Total=20306 [2021-11-20 23:18:18,156 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 295 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 8872 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 8956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 8872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:18,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 411 Invalid, 8956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 8872 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2021-11-20 23:18:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13658 states. [2021-11-20 23:18:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13658 to 11350. [2021-11-20 23:18:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11350 states, 11346 states have (on average 3.358452317997532) internal successors, (38105), 11349 states have internal predecessors, (38105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11350 states to 11350 states and 38105 transitions. [2021-11-20 23:18:18,345 INFO L78 Accepts]: Start accepts. Automaton has 11350 states and 38105 transitions. Word has length 31 [2021-11-20 23:18:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:18,345 INFO L470 AbstractCegarLoop]: Abstraction has 11350 states and 38105 transitions. [2021-11-20 23:18:18,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 11350 states and 38105 transitions. [2021-11-20 23:18:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:18:18,357 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:18,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:18,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-11-20 23:18:18,357 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:18:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2035111155, now seen corresponding path program 13 times [2021-11-20 23:18:18,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:18,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366049525] [2021-11-20 23:18:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:18,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:18,938 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:18,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366049525] [2021-11-20 23:18:18,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366049525] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:18:18,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:18:18,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-20 23:18:18,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552237211] [2021-11-20 23:18:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:18,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:18:18,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:18:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:18:18,939 INFO L87 Difference]: Start difference. First operand 11350 states and 38105 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:35,440 INFO L93 Difference]: Finished difference Result 13610 states and 44861 transitions. [2021-11-20 23:18:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-11-20 23:18:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:18:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:35,467 INFO L225 Difference]: With dead ends: 13610 [2021-11-20 23:18:35,467 INFO L226 Difference]: Without dead ends: 13494 [2021-11-20 23:18:35,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=3981, Invalid=17775, Unknown=0, NotChecked=0, Total=21756 [2021-11-20 23:18:35,468 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 358 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 7960 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 8040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 7960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:35,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 432 Invalid, 8040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 7960 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-11-20 23:18:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13494 states. [2021-11-20 23:18:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13494 to 11084. [2021-11-20 23:18:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11084 states, 11080 states have (on average 3.3549638989169677) internal successors, (37173), 11083 states have internal predecessors, (37173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11084 states to 11084 states and 37173 transitions. [2021-11-20 23:18:35,706 INFO L78 Accepts]: Start accepts. Automaton has 11084 states and 37173 transitions. Word has length 31 [2021-11-20 23:18:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:35,707 INFO L470 AbstractCegarLoop]: Abstraction has 11084 states and 37173 transitions. [2021-11-20 23:18:35,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 11084 states and 37173 transitions. [2021-11-20 23:18:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:18:35,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:35,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:35,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-11-20 23:18:35,728 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:18:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:35,728 INFO L85 PathProgramCache]: Analyzing trace with hash 195862715, now seen corresponding path program 5 times [2021-11-20 23:18:35,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:35,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297755988] [2021-11-20 23:18:35,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:35,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:36,398 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:36,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297755988] [2021-11-20 23:18:36,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297755988] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:18:36,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:18:36,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:18:36,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399287756] [2021-11-20 23:18:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:36,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:18:36,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:18:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:18:36,400 INFO L87 Difference]: Start difference. First operand 11084 states and 37173 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:39,100 INFO L93 Difference]: Finished difference Result 11770 states and 39324 transitions. [2021-11-20 23:18:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 23:18:39,100 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:18:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:39,124 INFO L225 Difference]: With dead ends: 11770 [2021-11-20 23:18:39,124 INFO L226 Difference]: Without dead ends: 11770 [2021-11-20 23:18:39,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2021-11-20 23:18:39,124 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 319 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:39,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 107 Invalid, 3639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-20 23:18:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states. [2021-11-20 23:18:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 10632. [2021-11-20 23:18:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10632 states, 10628 states have (on average 3.348231087692887) internal successors, (35585), 10631 states have internal predecessors, (35585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10632 states to 10632 states and 35585 transitions. [2021-11-20 23:18:39,313 INFO L78 Accepts]: Start accepts. Automaton has 10632 states and 35585 transitions. Word has length 31 [2021-11-20 23:18:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:39,313 INFO L470 AbstractCegarLoop]: Abstraction has 10632 states and 35585 transitions. [2021-11-20 23:18:39,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 35585 transitions. [2021-11-20 23:18:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:18:39,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:39,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:39,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-11-20 23:18:39,331 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:18:39,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1049571059, now seen corresponding path program 6 times [2021-11-20 23:18:39,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:39,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757252042] [2021-11-20 23:18:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:39,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:39,914 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:39,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757252042] [2021-11-20 23:18:39,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757252042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:18:39,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:18:39,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-20 23:18:39,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336933142] [2021-11-20 23:18:39,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:39,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 23:18:39,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 23:18:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-11-20 23:18:39,915 INFO L87 Difference]: Start difference. First operand 10632 states and 35585 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:42,201 INFO L93 Difference]: Finished difference Result 12709 states and 42517 transitions. [2021-11-20 23:18:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 23:18:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:18:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:42,232 INFO L225 Difference]: With dead ends: 12709 [2021-11-20 23:18:42,232 INFO L226 Difference]: Without dead ends: 12709 [2021-11-20 23:18:42,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2021-11-20 23:18:42,232 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 314 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 3317 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:42,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 86 Invalid, 3344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3317 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-20 23:18:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12709 states. [2021-11-20 23:18:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12709 to 11080. [2021-11-20 23:18:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11080 states, 11076 states have (on average 3.3665583243048034) internal successors, (37288), 11079 states have internal predecessors, (37288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 37288 transitions. [2021-11-20 23:18:42,431 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 37288 transitions. Word has length 31 [2021-11-20 23:18:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:42,431 INFO L470 AbstractCegarLoop]: Abstraction has 11080 states and 37288 transitions. [2021-11-20 23:18:42,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 37288 transitions. [2021-11-20 23:18:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:18:42,442 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:42,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:42,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-20 23:18:42,442 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:18:42,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash 197104431, now seen corresponding path program 2 times [2021-11-20 23:18:42,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:42,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236775615] [2021-11-20 23:18:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:42,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:43,263 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:43,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236775615] [2021-11-20 23:18:43,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236775615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:18:43,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:18:43,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:18:43,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25533254] [2021-11-20 23:18:43,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:43,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:18:43,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:18:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:18:43,265 INFO L87 Difference]: Start difference. First operand 11080 states and 37288 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:46,038 INFO L93 Difference]: Finished difference Result 12568 states and 42097 transitions. [2021-11-20 23:18:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 23:18:46,039 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:18:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:46,066 INFO L225 Difference]: With dead ends: 12568 [2021-11-20 23:18:46,066 INFO L226 Difference]: Without dead ends: 12568 [2021-11-20 23:18:46,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2021-11-20 23:18:46,067 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 371 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3540 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:46,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 102 Invalid, 3574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3540 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-20 23:18:46,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12568 states. [2021-11-20 23:18:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12568 to 11080. [2021-11-20 23:18:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11080 states, 11076 states have (on average 3.3665583243048034) internal successors, (37288), 11079 states have internal predecessors, (37288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 37288 transitions. [2021-11-20 23:18:46,284 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 37288 transitions. Word has length 31 [2021-11-20 23:18:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:46,284 INFO L470 AbstractCegarLoop]: Abstraction has 11080 states and 37288 transitions. [2021-11-20 23:18:46,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 37288 transitions. [2021-11-20 23:18:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:18:46,357 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:46,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:46,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-11-20 23:18:46,358 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:18:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1163740935, now seen corresponding path program 3 times [2021-11-20 23:18:46,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:46,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798266336] [2021-11-20 23:18:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:46,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:47,029 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:47,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798266336] [2021-11-20 23:18:47,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798266336] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:18:47,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:18:47,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:18:47,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463231907] [2021-11-20 23:18:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:47,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:18:47,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:47,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:18:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:18:47,030 INFO L87 Difference]: Start difference. First operand 11080 states and 37288 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:49,589 INFO L93 Difference]: Finished difference Result 12448 states and 41737 transitions. [2021-11-20 23:18:49,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 23:18:49,590 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:18:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:49,616 INFO L225 Difference]: With dead ends: 12448 [2021-11-20 23:18:49,616 INFO L226 Difference]: Without dead ends: 12448 [2021-11-20 23:18:49,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2021-11-20 23:18:49,617 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 449 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 3091 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:49,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 87 Invalid, 3129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3091 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-20 23:18:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12448 states. [2021-11-20 23:18:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12448 to 10960. [2021-11-20 23:18:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10960 states, 10956 states have (on average 3.370573201898503) internal successors, (36928), 10959 states have internal predecessors, (36928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10960 states to 10960 states and 36928 transitions. [2021-11-20 23:18:49,843 INFO L78 Accepts]: Start accepts. Automaton has 10960 states and 36928 transitions. Word has length 31 [2021-11-20 23:18:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:49,844 INFO L470 AbstractCegarLoop]: Abstraction has 10960 states and 36928 transitions. [2021-11-20 23:18:49,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 10960 states and 36928 transitions. [2021-11-20 23:18:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:18:49,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:49,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:49,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-11-20 23:18:49,855 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:18:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1799199463, now seen corresponding path program 4 times [2021-11-20 23:18:49,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:49,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076474394] [2021-11-20 23:18:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:49,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:50,532 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:50,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076474394] [2021-11-20 23:18:50,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076474394] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:18:50,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:18:50,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:18:50,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030655498] [2021-11-20 23:18:50,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:50,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:18:50,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:50,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:18:50,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:18:50,533 INFO L87 Difference]: Start difference. First operand 10960 states and 36928 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:53,132 INFO L93 Difference]: Finished difference Result 12248 states and 41137 transitions. [2021-11-20 23:18:53,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 23:18:53,133 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:18:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:53,157 INFO L225 Difference]: With dead ends: 12248 [2021-11-20 23:18:53,158 INFO L226 Difference]: Without dead ends: 12248 [2021-11-20 23:18:53,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2021-11-20 23:18:53,161 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 387 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 3257 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:53,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 89 Invalid, 3289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3257 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-20 23:18:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12248 states. [2021-11-20 23:18:53,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12248 to 10840. [2021-11-20 23:18:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10840 states, 10836 states have (on average 3.3746770025839794) internal successors, (36568), 10839 states have internal predecessors, (36568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10840 states to 10840 states and 36568 transitions. [2021-11-20 23:18:53,351 INFO L78 Accepts]: Start accepts. Automaton has 10840 states and 36568 transitions. Word has length 31 [2021-11-20 23:18:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:53,351 INFO L470 AbstractCegarLoop]: Abstraction has 10840 states and 36568 transitions. [2021-11-20 23:18:53,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 10840 states and 36568 transitions. [2021-11-20 23:18:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:18:53,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:53,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:53,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-11-20 23:18:53,362 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:18:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1026212421, now seen corresponding path program 5 times [2021-11-20 23:18:53,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:53,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499787712] [2021-11-20 23:18:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:53,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:54,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:54,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499787712] [2021-11-20 23:18:54,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499787712] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:18:54,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:18:54,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:18:54,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735626129] [2021-11-20 23:18:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:54,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:18:54,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:54,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:18:54,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:18:54,154 INFO L87 Difference]: Start difference. First operand 10840 states and 36568 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:56,863 INFO L93 Difference]: Finished difference Result 11908 states and 40097 transitions. [2021-11-20 23:18:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 23:18:56,864 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:18:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:56,888 INFO L225 Difference]: With dead ends: 11908 [2021-11-20 23:18:56,888 INFO L226 Difference]: Without dead ends: 11908 [2021-11-20 23:18:56,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2021-11-20 23:18:56,888 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 354 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:56,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 100 Invalid, 3546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-20 23:18:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11908 states. [2021-11-20 23:18:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11908 to 10840. [2021-11-20 23:18:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10840 states, 10836 states have (on average 3.3746770025839794) internal successors, (36568), 10839 states have internal predecessors, (36568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10840 states to 10840 states and 36568 transitions. [2021-11-20 23:18:57,162 INFO L78 Accepts]: Start accepts. Automaton has 10840 states and 36568 transitions. Word has length 31 [2021-11-20 23:18:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:57,162 INFO L470 AbstractCegarLoop]: Abstraction has 10840 states and 36568 transitions. [2021-11-20 23:18:57,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10840 states and 36568 transitions. [2021-11-20 23:18:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:18:57,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:57,172 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:57,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-11-20 23:18:57,172 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:18:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:57,173 INFO L85 PathProgramCache]: Analyzing trace with hash -135986171, now seen corresponding path program 6 times [2021-11-20 23:18:57,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:57,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158074370] [2021-11-20 23:18:57,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:57,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:18:57,792 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:57,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158074370] [2021-11-20 23:18:57,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158074370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:18:57,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:18:57,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:18:57,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118366495] [2021-11-20 23:18:57,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:57,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:18:57,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:57,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:18:57,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:18:57,793 INFO L87 Difference]: Start difference. First operand 10840 states and 36568 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:00,701 INFO L93 Difference]: Finished difference Result 12625 states and 42327 transitions. [2021-11-20 23:19:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 23:19:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:19:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:00,728 INFO L225 Difference]: With dead ends: 12625 [2021-11-20 23:19:00,728 INFO L226 Difference]: Without dead ends: 12625 [2021-11-20 23:19:00,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=934, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 23:19:00,729 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 352 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3972 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:00,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 109 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3972 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-20 23:19:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12625 states. [2021-11-20 23:19:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12625 to 10406. [2021-11-20 23:19:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10406 states, 10402 states have (on average 3.3630071140165354) internal successors, (34982), 10405 states have internal predecessors, (34982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10406 states to 10406 states and 34982 transitions. [2021-11-20 23:19:00,917 INFO L78 Accepts]: Start accepts. Automaton has 10406 states and 34982 transitions. Word has length 31 [2021-11-20 23:19:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:00,917 INFO L470 AbstractCegarLoop]: Abstraction has 10406 states and 34982 transitions. [2021-11-20 23:19:00,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10406 states and 34982 transitions. [2021-11-20 23:19:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:19:00,927 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:00,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:00,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-11-20 23:19:00,928 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:19:00,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2109249087, now seen corresponding path program 7 times [2021-11-20 23:19:00,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:00,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726340894] [2021-11-20 23:19:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:00,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:19:01,773 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:01,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726340894] [2021-11-20 23:19:01,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726340894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:19:01,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:19:01,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-20 23:19:01,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817840275] [2021-11-20 23:19:01,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:19:01,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 23:19:01,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:19:01,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 23:19:01,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-11-20 23:19:01,774 INFO L87 Difference]: Start difference. First operand 10406 states and 34982 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:19:04,259 INFO L93 Difference]: Finished difference Result 10960 states and 36781 transitions. [2021-11-20 23:19:04,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 23:19:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-20 23:19:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:19:04,282 INFO L225 Difference]: With dead ends: 10960 [2021-11-20 23:19:04,282 INFO L226 Difference]: Without dead ends: 10960 [2021-11-20 23:19:04,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2021-11-20 23:19:04,283 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 374 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 3131 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:19:04,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 89 Invalid, 3171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3131 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-20 23:19:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10960 states. [2021-11-20 23:19:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10960 to 9702. [2021-11-20 23:19:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9702 states, 9698 states have (on average 3.368942049907197) internal successors, (32672), 9701 states have internal predecessors, (32672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9702 states to 9702 states and 32672 transitions. [2021-11-20 23:19:04,451 INFO L78 Accepts]: Start accepts. Automaton has 9702 states and 32672 transitions. Word has length 31 [2021-11-20 23:19:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:19:04,451 INFO L470 AbstractCegarLoop]: Abstraction has 9702 states and 32672 transitions. [2021-11-20 23:19:04,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:19:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9702 states and 32672 transitions. [2021-11-20 23:19:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-20 23:19:04,460 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:19:04,460 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:19:04,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-11-20 23:19:04,461 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-20 23:19:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:19:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2023938091, now seen corresponding path program 7 times [2021-11-20 23:19:04,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:19:04,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743803446] [2021-11-20 23:19:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:19:04,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:19:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:19:05,392 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:19:05,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743803446] [2021-11-20 23:19:05,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743803446] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:19:05,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463474350] [2021-11-20 23:19:05,393 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:19:05,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:19:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:19:05,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:19:05,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8394b5-c2d2-4ef0-8686-94eec46f0a0c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 23:19:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:19:05,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 93 conjunts are in the unsatisfiable core [2021-11-20 23:19:05,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:19:05,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:05,627 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-20 23:19:05,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 35 [2021-11-20 23:19:05,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2021-11-20 23:19:05,863 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-20 23:19:05,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:19:06,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:06,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:19:06,320 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-20 23:19:06,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 41 [2021-11-20 23:19:06,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:06,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:06,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:06,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-11-20 23:19:06,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:06,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:06,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:19:06,796 INFO L354 Elim1Store]: treesize reduction 84, result has 27.6 percent of original size [2021-11-20 23:19:06,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 56 [2021-11-20 23:19:06,988 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-20 23:19:06,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2021-11-20 23:19:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:19:07,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:19:40,262 WARN L227 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:20:01,429 WARN L227 SmtUtils]: Spent 10.34s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:20:21,430 WARN L227 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:20:32,154 WARN L227 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:21:51,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~pre31#1_110| Int) (|v_ULTIMATE.start_ring_enqueue_~x#1_61| Int) (|ULTIMATE.start_main_~#writer~0#1.offset| Int)) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base|) |ULTIMATE.start_main_~#writer~0#1.offset| |v_ULTIMATE.start_main_#t~pre31#1_110|)) |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse14 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse13 (select .cse12 .cse14))) (let ((.cse18 (+ .cse13 1))) (let ((.cse17 (mod .cse18 4))) (let ((.cse16 (select .cse12 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (.cse15 (= .cse17 0))) (or (let ((.cse0 (+ (select (store .cse12 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* .cse13 4)) |v_ULTIMATE.start_ring_enqueue_~x#1_61|) .cse14) 1))) (let ((.cse1 (= (mod .cse0 4) 0))) (and (or (<= 0 .cse0) .cse1 (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (v_subst_2 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse3 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base|) |ULTIMATE.start_main_~#writer~0#1.offset| |v_ULTIMATE.start_main_#t~pre31#1_110|)) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse6 .cse4) 4)) |v_ULTIMATE.start_ring_enqueue_~x#1_61|)))) (let ((.cse5 (mod (+ (select .cse3 .cse4) 1) 4))) (or (<= (let ((.cse2 (store (store .cse3 .cse4 (+ (- 4) .cse5)) (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_subst_2))) (select .cse2 (+ (* (select .cse2 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4))) 8) (< (+ |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) .cse5))))))) (or (and (not .cse1) (< .cse0 0)) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (v_subst_1 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse9 (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base|) |ULTIMATE.start_main_~#writer~0#1.offset| |v_ULTIMATE.start_main_#t~pre31#1_110|)) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse11 .cse10) 4)) |v_ULTIMATE.start_ring_enqueue_~x#1_61|)))) (let ((.cse7 (mod (+ (select .cse9 .cse10) 1) 4))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| .cse7) (<= (let ((.cse8 (store (store .cse9 .cse10 .cse7) (+ (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_subst_1))) (select .cse8 (+ (* (select .cse8 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4))) 8)))))))))) (and (not .cse15) (= (+ .cse16 4) .cse17) (< .cse18 0)) (and (= .cse16 .cse17) (or (<= 0 .cse18) .cse15)) (< 1 |v_ULTIMATE.start_ring_enqueue_~x#1_61|)))))))) is different from false [2021-11-20 23:21:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:21:51,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463474350] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:51,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2026063713] [2021-11-20 23:21:51,938 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:21:51,939 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:51,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 17] total 48 [2021-11-20 23:21:51,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791943899] [2021-11-20 23:21:51,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:51,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-20 23:21:51,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:51,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-20 23:21:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2109, Unknown=30, NotChecked=94, Total=2450 [2021-11-20 23:21:51,942 INFO L87 Difference]: Start difference. First operand 9702 states and 32672 transitions. Second operand has 50 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 49 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:55,575 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (<= (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)) 1) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (<= (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4)) 1) (= (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 0) (= (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) 1) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse18 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse17 (select .cse16 .cse18))) (let ((.cse19 (+ .cse17 1))) (let ((.cse21 (mod .cse19 4))) (let ((.cse20 (select .cse16 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|)) (.cse22 (= .cse21 0))) (or (let ((.cse9 (+ 1 (select (store .cse16 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* .cse17 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse18)))) (let ((.cse8 (= (mod .cse9 4) 0))) (and (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (v_subst_2 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse6 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse5 (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse7 .cse6) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse5 .cse6 (+ (- 4) (mod (+ 1 (select .cse5 .cse6)) 4)))))))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| (select .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (<= (let ((.cse3 (select (store .cse4 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse2 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) 4) v_subst_2)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse3 (+ (* (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8))))) .cse8 (<= 0 .cse9)) (or (and (< .cse9 0) (not .cse8)) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (v_subst_1 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse14 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse13 (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse15 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse15 .cse14) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse13 .cse14 (mod (+ 1 (select .cse13 .cse14)) 4))))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) 4) v_subst_1)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse10 (+ (* (select .cse10 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| (select .cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))))))) (and (< .cse19 0) (= (+ .cse20 4) .cse21) (not .cse22)) (and (= .cse20 .cse21) (or (<= 0 .cse19) .cse22)))))))) (= (select .cse1 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 1))) is different from false [2021-11-20 23:21:57,429 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse30 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse29 (select .cse28 .cse30))) (let ((.cse9 (+ .cse29 1)) (.cse7 (+ 1 (select (store .cse28 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* .cse29 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|) .cse30)))) (let ((.cse6 (= (mod .cse7 4) 0)) (.cse8 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|)) (.cse15 (= (mod .cse9 4) 0)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (and (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (or (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (v_subst_2 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse4 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse5 .cse4) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse3 .cse4 (+ (- 4) (mod (+ 1 (select .cse3 .cse4)) 4)))))))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| (select .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (<= (let ((.cse1 (select (store .cse2 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse0 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) 4) v_subst_2)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse1 (+ (* (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8))))) .cse6 (<= 0 .cse7)) (<= (select .cse8 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)) 1) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (or (<= 0 .cse9) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse14 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse13 .cse14 (+ (- 4) (mod (+ (select .cse13 .cse14) 1) 4))))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse10 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse10 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4)))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| (select .cse12 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))) .cse15) (or (and (< .cse7 0) (not .cse6)) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (v_subst_1 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse20 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse19 (let ((.cse21 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (store .cse21 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse21 .cse20) 4)) |c_ULTIMATE.start_ring_enqueue_~x#1|)))) (store .cse19 .cse20 (mod (+ 1 (select .cse19 .cse20)) 4))))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse16 (select (store .cse17 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse18 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) 4) v_subst_1)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse16 (+ (* (select .cse16 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| (select .cse18 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)))))))) (<= (select .cse22 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4)) 1) (= (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 0) (= (select .cse8 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) 1) (or (and (< .cse9 0) (not .cse15)) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (|ULTIMATE.start_ring_enqueue_~x#1| Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse27 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse26 .cse27 (mod (+ (select .cse26 .cse27) 1) 4)))))) (let ((.cse23 (select .cse25 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| (select .cse23 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (<= (let ((.cse24 (select (store .cse25 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse23 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) 4) |ULTIMATE.start_ring_enqueue_~x#1|)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse24 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse24 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4)))) 8)))))) (= (select .cse22 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) 1)))))) is different from false [2021-11-20 23:23:12,206 WARN L227 SmtUtils]: Spent 14.16s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:23:14,465 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|))) (let ((.cse10 (store .cse17 (+ (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4) |c_ULTIMATE.start_ring_enqueue_~x#1|))) (let ((.cse1 (+ (select .cse10 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20)) 1)) (.cse0 (* 4 |c_ULTIMATE.start_ring_enqueue_#t~mem6#1|))) (let ((.cse11 (= (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| .cse0) 0)) (.cse9 (select .cse17 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|)) (.cse2 (= (mod .cse1 4) 0)) (.cse8 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (and (not (= (+ .cse0 4) 0)) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0) (or (and (< .cse1 0) (not .cse2)) (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (v_subst_1 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4) |c_ULTIMATE.start_ring_enqueue_~x#1|)) (.cse7 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse6 .cse7 (mod (+ (select .cse6 .cse7) 1) 4)))))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| (select .cse3 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (<= (let ((.cse4 (select (store .cse5 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse3 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) 4) v_subst_1)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))) 8)))))) (<= (select .cse8 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)) 1) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| |c_ULTIMATE.start_ring_enqueue_~r#1.offset|) (= .cse9 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (or (<= (select .cse10 4) 1) .cse11) (or (not .cse11) (= .cse9 (select .cse10 20))) (= (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 0) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 0) (or .cse2 (forall ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| Int) (v_subst_2 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (let ((.cse15 (store (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|) (+ (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4) |c_ULTIMATE.start_ring_enqueue_~x#1|)) (.cse16 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (store .cse15 .cse16 (+ (- 4) (mod (+ (select .cse15 .cse16) 1) 4))))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (or (<= (let ((.cse12 (select (store .cse13 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse14 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| 4) 4) v_subst_2)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse12 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse12 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))) 8) (< |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_246| (select .cse14 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))))))) (<= 0 .cse1)) (= (select .cse8 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) 1)))))) is different from false [2021-11-20 23:23:48,674 WARN L227 SmtUtils]: Spent 18.10s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:24:23,801 WARN L227 SmtUtils]: Spent 14.16s on a formula simplification. DAG size of input: 71 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:25:44,464 WARN L227 SmtUtils]: Spent 1.03m on a formula simplification. DAG size of input: 110 DAG size of output: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:26:51,977 WARN L227 SmtUtils]: Spent 47.48s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)